./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers/floppy.i.cil-3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a 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_7462177c-1602-4726-a8ce-2d1955a7074d/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7462177c-1602-4726-a8ce-2d1955a7074d/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7462177c-1602-4726-a8ce-2d1955a7074d/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7462177c-1602-4726-a8ce-2d1955a7074d/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ntdrivers/floppy.i.cil-3.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7462177c-1602-4726-a8ce-2d1955a7074d/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7462177c-1602-4726-a8ce-2d1955a7074d/bin/uautomizer-ZsLfNo2U6R --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 13096ecc896a778cf08851ae14dc5c7b87ba00c42e74b90edd25cd2cb7c21f17 --- 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-38b53e6 [2022-11-25 18:21:00,856 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 18:21:00,859 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 18:21:00,885 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 18:21:00,886 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 18:21:00,890 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 18:21:00,894 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 18:21:00,898 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 18:21:00,901 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 18:21:00,908 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 18:21:00,910 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 18:21:00,913 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 18:21:00,913 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 18:21:00,920 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 18:21:00,923 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 18:21:00,925 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 18:21:00,928 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 18:21:00,929 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 18:21:00,931 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 18:21:00,938 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 18:21:00,941 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 18:21:00,944 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 18:21:00,946 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 18:21:00,947 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 18:21:00,960 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 18:21:00,960 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 18:21:00,961 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 18:21:00,964 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 18:21:00,964 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 18:21:00,965 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 18:21:00,967 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 18:21:00,968 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 18:21:00,970 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 18:21:00,972 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 18:21:00,973 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 18:21:00,973 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 18:21:00,974 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 18:21:00,974 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 18:21:00,975 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 18:21:00,976 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 18:21:00,977 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 18:21:00,978 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7462177c-1602-4726-a8ce-2d1955a7074d/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 18:21:01,022 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 18:21:01,027 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 18:21:01,028 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 18:21:01,028 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 18:21:01,029 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 18:21:01,029 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 18:21:01,030 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 18:21:01,030 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 18:21:01,031 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 18:21:01,031 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 18:21:01,031 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 18:21:01,031 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 18:21:01,032 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 18:21:01,032 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 18:21:01,032 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 18:21:01,032 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 18:21:01,033 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 18:21:01,033 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 18:21:01,033 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 18:21:01,033 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 18:21:01,034 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 18:21:01,034 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 18:21:01,034 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 18:21:01,034 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 18:21:01,035 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:21:01,035 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 18:21:01,035 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 18:21:01,035 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 18:21:01,036 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 18:21:01,036 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 18:21:01,036 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 18:21:01,036 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 18:21:01,036 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 18:21:01,037 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 18:21:01,037 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7462177c-1602-4726-a8ce-2d1955a7074d/bin/uautomizer-ZsLfNo2U6R/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_7462177c-1602-4726-a8ce-2d1955a7074d/bin/uautomizer-ZsLfNo2U6R 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 -> 13096ecc896a778cf08851ae14dc5c7b87ba00c42e74b90edd25cd2cb7c21f17 [2022-11-25 18:21:01,355 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 18:21:01,391 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 18:21:01,394 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 18:21:01,395 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 18:21:01,396 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 18:21:01,397 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7462177c-1602-4726-a8ce-2d1955a7074d/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/ntdrivers/floppy.i.cil-3.c [2022-11-25 18:21:04,897 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 18:21:05,547 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 18:21:05,547 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7462177c-1602-4726-a8ce-2d1955a7074d/sv-benchmarks/c/ntdrivers/floppy.i.cil-3.c [2022-11-25 18:21:05,612 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7462177c-1602-4726-a8ce-2d1955a7074d/bin/uautomizer-ZsLfNo2U6R/data/b65d90c69/7c91445df4bd4db293f2333f60440d6b/FLAG90d5f312c [2022-11-25 18:21:05,629 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7462177c-1602-4726-a8ce-2d1955a7074d/bin/uautomizer-ZsLfNo2U6R/data/b65d90c69/7c91445df4bd4db293f2333f60440d6b [2022-11-25 18:21:05,633 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 18:21:05,635 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 18:21:05,637 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 18:21:05,637 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 18:21:05,644 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 18:21:05,647 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:21:05" (1/1) ... [2022-11-25 18:21:05,649 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ae54052 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:21:05, skipping insertion in model container [2022-11-25 18:21:05,650 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:21:05" (1/1) ... [2022-11-25 18:21:05,659 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 18:21:05,844 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 18:21:06,812 WARN L237 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_7462177c-1602-4726-a8ce-2d1955a7074d/sv-benchmarks/c/ntdrivers/floppy.i.cil-3.c[77246,77259] [2022-11-25 18:21:06,842 WARN L623 FunctionHandler]: Unknown extern function swprintf [2022-11-25 18:21:06,849 WARN L623 FunctionHandler]: Unknown extern function sprintf [2022-11-25 18:21:07,269 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:21:07,309 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 18:21:07,374 WARN L237 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_7462177c-1602-4726-a8ce-2d1955a7074d/sv-benchmarks/c/ntdrivers/floppy.i.cil-3.c[77246,77259] [2022-11-25 18:21:07,388 WARN L623 FunctionHandler]: Unknown extern function swprintf [2022-11-25 18:21:07,391 WARN L623 FunctionHandler]: Unknown extern function sprintf [2022-11-25 18:21:07,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:21:07,834 INFO L208 MainTranslator]: Completed translation [2022-11-25 18:21:07,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:21:07 WrapperNode [2022-11-25 18:21:07,835 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 18:21:07,837 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 18:21:07,837 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 18:21:07,837 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 18:21:07,848 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:21:07" (1/1) ... [2022-11-25 18:21:07,945 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:21:07" (1/1) ... [2022-11-25 18:21:08,153 INFO L138 Inliner]: procedures = 128, calls = 2895, calls flagged for inlining = 37, calls inlined = 26, statements flattened = 3094 [2022-11-25 18:21:08,154 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 18:21:08,155 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 18:21:08,156 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 18:21:08,156 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 18:21:08,167 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:21:07" (1/1) ... [2022-11-25 18:21:08,168 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:21:07" (1/1) ... [2022-11-25 18:21:08,206 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:21:07" (1/1) ... [2022-11-25 18:21:08,207 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:21:07" (1/1) ... [2022-11-25 18:21:08,331 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:21:07" (1/1) ... [2022-11-25 18:21:08,367 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:21:07" (1/1) ... [2022-11-25 18:21:08,381 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:21:07" (1/1) ... [2022-11-25 18:21:08,407 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:21:07" (1/1) ... [2022-11-25 18:21:08,441 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 18:21:08,445 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 18:21:08,446 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 18:21:08,446 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 18:21:08,447 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:21:07" (1/1) ... [2022-11-25 18:21:08,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:21:08,468 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7462177c-1602-4726-a8ce-2d1955a7074d/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:21:08,494 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7462177c-1602-4726-a8ce-2d1955a7074d/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 18:21:08,521 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7462177c-1602-4726-a8ce-2d1955a7074d/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 18:21:08,554 INFO L130 BoogieDeclarations]: Found specification of procedure IoGetConfigurationInformation [2022-11-25 18:21:08,554 INFO L138 BoogieDeclarations]: Found implementation of procedure IoGetConfigurationInformation [2022-11-25 18:21:08,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-11-25 18:21:08,554 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-11-25 18:21:08,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-11-25 18:21:08,555 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 18:21:08,555 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-11-25 18:21:08,555 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-11-25 18:21:08,555 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2022-11-25 18:21:08,555 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2022-11-25 18:21:08,555 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyCreateClose [2022-11-25 18:21:08,555 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyCreateClose [2022-11-25 18:21:08,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 18:21:08,556 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnpComplete [2022-11-25 18:21:08,556 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnpComplete [2022-11-25 18:21:08,556 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-11-25 18:21:08,556 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-11-25 18:21:08,556 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedExchange [2022-11-25 18:21:08,557 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedExchange [2022-11-25 18:21:08,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-11-25 18:21:08,557 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-11-25 18:21:08,557 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-11-25 18:21:08,557 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-11-25 18:21:08,557 INFO L130 BoogieDeclarations]: Found specification of procedure FlQueueIrpToThread [2022-11-25 18:21:08,558 INFO L138 BoogieDeclarations]: Found implementation of procedure FlQueueIrpToThread [2022-11-25 18:21:08,559 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyDeviceControl [2022-11-25 18:21:08,559 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyDeviceControl [2022-11-25 18:21:08,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 18:21:08,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 18:21:08,560 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyProcessQueuedRequests [2022-11-25 18:21:08,561 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyProcessQueuedRequests [2022-11-25 18:21:08,561 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedInsertTailList [2022-11-25 18:21:08,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedInsertTailList [2022-11-25 18:21:08,561 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 18:21:08,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 18:21:08,562 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-11-25 18:21:08,562 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-11-25 18:21:08,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 18:21:08,562 INFO L130 BoogieDeclarations]: Found specification of procedure FlFdcDeviceIo [2022-11-25 18:21:08,563 INFO L138 BoogieDeclarations]: Found implementation of procedure FlFdcDeviceIo [2022-11-25 18:21:08,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 18:21:08,563 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-11-25 18:21:08,563 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-11-25 18:21:08,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove [2022-11-25 18:21:08,563 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove [2022-11-25 18:21:08,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 18:21:08,564 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy_guard [2022-11-25 18:21:08,564 INFO L138 BoogieDeclarations]: Found implementation of procedure memcpy_guard [2022-11-25 18:21:08,564 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyQueueRequest [2022-11-25 18:21:08,565 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyQueueRequest [2022-11-25 18:21:08,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-11-25 18:21:08,565 INFO L130 BoogieDeclarations]: Found specification of procedure ExAllocatePoolWithTag [2022-11-25 18:21:08,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ExAllocatePoolWithTag [2022-11-25 18:21:08,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 18:21:08,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 18:21:09,250 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 18:21:09,253 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 18:21:09,309 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-25 18:21:09,325 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-11-25 18:21:09,326 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-11-25 18:21:09,329 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-25 18:21:09,576 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##24: assume !false; [2022-11-25 18:21:09,576 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##23: assume false; [2022-11-25 18:21:09,628 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-25 18:21:09,732 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-11-25 18:21:09,732 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-11-25 18:21:09,894 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-25 18:21:09,931 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2022-11-25 18:21:09,932 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2022-11-25 18:21:09,933 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-25 18:21:09,934 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-25 18:21:09,935 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-25 18:21:10,155 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume !false; [2022-11-25 18:21:10,156 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##24: assume !false; [2022-11-25 18:21:10,156 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##23: assume false; [2022-11-25 18:21:10,156 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume false; [2022-11-25 18:21:10,156 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume false; [2022-11-25 18:21:10,156 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !false; [2022-11-25 18:21:10,160 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-25 18:21:10,170 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-25 18:21:10,173 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-25 18:21:10,903 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##38: assume !false; [2022-11-25 18:21:10,903 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##37: assume false; [2022-11-25 18:21:10,903 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##139: assume false; [2022-11-25 18:21:10,903 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##140: assume !false; [2022-11-25 18:21:10,904 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##124: assume !false; [2022-11-25 18:21:10,904 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##123: assume false; [2022-11-25 18:21:10,970 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-25 18:21:11,015 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-11-25 18:21:11,015 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-11-25 18:21:11,033 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-25 18:21:11,036 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-25 18:21:11,038 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-25 18:21:11,040 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-25 18:21:11,040 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-25 18:21:11,044 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-25 18:21:11,045 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-25 18:21:11,046 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-25 18:21:15,476 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##97: assume !false; [2022-11-25 18:21:15,476 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##96: assume false; [2022-11-25 18:21:15,476 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##76: assume false; [2022-11-25 18:21:15,476 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##177: assume !false; [2022-11-25 18:21:15,476 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##176: assume false; [2022-11-25 18:21:15,477 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##77: assume !false; [2022-11-25 18:21:15,477 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##48: assume !false; [2022-11-25 18:21:15,477 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##47: assume false; [2022-11-25 18:21:15,477 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##27: assume !false; [2022-11-25 18:21:15,477 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume false; [2022-11-25 18:21:15,477 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##162: assume false; [2022-11-25 18:21:15,478 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##163: assume !false; [2022-11-25 18:21:15,478 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##210: assume false; [2022-11-25 18:21:15,478 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##211: assume !false; [2022-11-25 18:21:15,478 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##108: assume !false; [2022-11-25 18:21:15,478 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##107: assume false; [2022-11-25 18:21:15,506 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 18:21:15,530 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 18:21:15,530 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-25 18:21:15,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:21:15 BoogieIcfgContainer [2022-11-25 18:21:15,537 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 18:21:15,542 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 18:21:15,546 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 18:21:15,550 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 18:21:15,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 06:21:05" (1/3) ... [2022-11-25 18:21:15,551 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a11d82d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:21:15, skipping insertion in model container [2022-11-25 18:21:15,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:21:07" (2/3) ... [2022-11-25 18:21:15,552 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a11d82d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:21:15, skipping insertion in model container [2022-11-25 18:21:15,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:21:15" (3/3) ... [2022-11-25 18:21:15,553 INFO L112 eAbstractionObserver]: Analyzing ICFG floppy.i.cil-3.c [2022-11-25 18:21:15,579 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 18:21:15,580 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 18:21:15,693 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 18:21:15,706 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;@3f991e5a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:21:15,706 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-25 18:21:15,715 INFO L276 IsEmpty]: Start isEmpty. Operand has 580 states, 463 states have (on average 1.4989200863930885) internal successors, (694), 496 states have internal predecessors, (694), 95 states have call successors, (95), 20 states have call predecessors, (95), 20 states have return successors, (95), 89 states have call predecessors, (95), 95 states have call successors, (95) [2022-11-25 18:21:15,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-25 18:21:15,725 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:21:15,726 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] [2022-11-25 18:21:15,727 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:21:15,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:21:15,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1811520219, now seen corresponding path program 1 times [2022-11-25 18:21:15,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:21:15,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543450324] [2022-11-25 18:21:15,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:21:15,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:21:16,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:16,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:21:16,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:16,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:21:16,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:16,845 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-25 18:21:16,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:21:16,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543450324] [2022-11-25 18:21:16,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543450324] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:21:16,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:21:16,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:21:16,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597507840] [2022-11-25 18:21:16,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:21:16,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:21:16,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:21:16,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:21:16,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:21:16,920 INFO L87 Difference]: Start difference. First operand has 580 states, 463 states have (on average 1.4989200863930885) internal successors, (694), 496 states have internal predecessors, (694), 95 states have call successors, (95), 20 states have call predecessors, (95), 20 states have return successors, (95), 89 states have call predecessors, (95), 95 states have call successors, (95) Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 3 states have internal predecessors, (21), 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-25 18:21:22,811 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:21:23,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:21:23,307 INFO L93 Difference]: Finished difference Result 1174 states and 1848 transitions. [2022-11-25 18:21:23,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:21:23,313 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 3 states have internal predecessors, (21), 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 26 [2022-11-25 18:21:23,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:21:23,341 INFO L225 Difference]: With dead ends: 1174 [2022-11-25 18:21:23,341 INFO L226 Difference]: Without dead ends: 657 [2022-11-25 18:21:23,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-25 18:21:23,369 INFO L413 NwaCegarLoop]: 669 mSDtfsCounter, 419 mSDsluCounter, 1385 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 219 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 2054 SdHoareTripleChecker+Invalid, 1107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 219 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:21:23,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 2054 Invalid, 1107 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [219 Valid, 887 Invalid, 1 Unknown, 0 Unchecked, 6.0s Time] [2022-11-25 18:21:23,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2022-11-25 18:21:23,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 579. [2022-11-25 18:21:23,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 462 states have (on average 1.4567099567099566) internal successors, (673), 493 states have internal predecessors, (673), 95 states have call successors, (95), 22 states have call predecessors, (95), 21 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2022-11-25 18:21:23,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 840 transitions. [2022-11-25 18:21:23,540 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 840 transitions. Word has length 26 [2022-11-25 18:21:23,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:21:23,541 INFO L495 AbstractCegarLoop]: Abstraction has 579 states and 840 transitions. [2022-11-25 18:21:23,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 3 states have internal predecessors, (21), 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-25 18:21:23,542 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 840 transitions. [2022-11-25 18:21:23,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-25 18:21:23,544 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:21:23,544 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-25 18:21:23,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 18:21:23,544 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:21:23,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:21:23,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1723209200, now seen corresponding path program 1 times [2022-11-25 18:21:23,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:21:23,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703179558] [2022-11-25 18:21:23,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:21:23,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:21:23,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:24,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:21:24,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:24,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:21:24,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:24,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:21:24,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:21:24,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703179558] [2022-11-25 18:21:24,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703179558] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:21:24,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:21:24,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 18:21:24,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211203550] [2022-11-25 18:21:24,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:21:24,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:21:24,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:21:24,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:21:24,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:21:24,207 INFO L87 Difference]: Start difference. First operand 579 states and 840 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 18:21:30,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:21:30,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:21:30,588 INFO L93 Difference]: Finished difference Result 1217 states and 1784 transitions. [2022-11-25 18:21:30,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:21:30,589 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2022-11-25 18:21:30,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:21:30,596 INFO L225 Difference]: With dead ends: 1217 [2022-11-25 18:21:30,596 INFO L226 Difference]: Without dead ends: 657 [2022-11-25 18:21:30,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-25 18:21:30,601 INFO L413 NwaCegarLoop]: 659 mSDtfsCounter, 381 mSDsluCounter, 2004 mSDsCounter, 0 mSdLazyCounter, 1088 mSolverCounterSat, 213 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 2663 SdHoareTripleChecker+Invalid, 1302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 1088 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:21:30,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 2663 Invalid, 1302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 1088 Invalid, 1 Unknown, 0 Unchecked, 6.2s Time] [2022-11-25 18:21:30,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2022-11-25 18:21:30,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 579. [2022-11-25 18:21:30,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 462 states have (on average 1.4545454545454546) internal successors, (672), 493 states have internal predecessors, (672), 95 states have call successors, (95), 22 states have call predecessors, (95), 21 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2022-11-25 18:21:30,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 839 transitions. [2022-11-25 18:21:30,654 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 839 transitions. Word has length 29 [2022-11-25 18:21:30,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:21:30,655 INFO L495 AbstractCegarLoop]: Abstraction has 579 states and 839 transitions. [2022-11-25 18:21:30,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 18:21:30,655 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 839 transitions. [2022-11-25 18:21:30,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-25 18:21:30,656 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:21:30,656 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:21:30,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 18:21:30,657 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:21:30,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:21:30,658 INFO L85 PathProgramCache]: Analyzing trace with hash 51194362, now seen corresponding path program 1 times [2022-11-25 18:21:30,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:21:30,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612938810] [2022-11-25 18:21:30,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:21:30,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:21:30,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:31,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:21:31,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:31,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:21:31,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:31,533 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-25 18:21:31,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:21:31,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612938810] [2022-11-25 18:21:31,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612938810] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:21:31,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:21:31,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:21:31,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699902066] [2022-11-25 18:21:31,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:21:31,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:21:31,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:21:31,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:21:31,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:21:31,541 INFO L87 Difference]: Start difference. First operand 579 states and 839 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 3 states have internal predecessors, (26), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 18:21:36,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:21:38,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:21:38,630 INFO L93 Difference]: Finished difference Result 1542 states and 2294 transitions. [2022-11-25 18:21:38,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:21:38,632 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 3 states have internal predecessors, (26), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2022-11-25 18:21:38,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:21:38,642 INFO L225 Difference]: With dead ends: 1542 [2022-11-25 18:21:38,643 INFO L226 Difference]: Without dead ends: 1127 [2022-11-25 18:21:38,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-25 18:21:38,647 INFO L413 NwaCegarLoop]: 821 mSDtfsCounter, 1376 mSDsluCounter, 1487 mSDsCounter, 0 mSdLazyCounter, 1152 mSolverCounterSat, 380 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1413 SdHoareTripleChecker+Valid, 2308 SdHoareTripleChecker+Invalid, 1533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 380 IncrementalHoareTripleChecker+Valid, 1152 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-11-25 18:21:38,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1413 Valid, 2308 Invalid, 1533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [380 Valid, 1152 Invalid, 1 Unknown, 0 Unchecked, 6.8s Time] [2022-11-25 18:21:38,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1127 states. [2022-11-25 18:21:38,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1127 to 1008. [2022-11-25 18:21:38,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1008 states, 832 states have (on average 1.4399038461538463) internal successors, (1198), 859 states have internal predecessors, (1198), 132 states have call successors, (132), 40 states have call predecessors, (132), 43 states have return successors, (155), 116 states have call predecessors, (155), 117 states have call successors, (155) [2022-11-25 18:21:38,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1485 transitions. [2022-11-25 18:21:38,753 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1485 transitions. Word has length 33 [2022-11-25 18:21:38,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:21:38,754 INFO L495 AbstractCegarLoop]: Abstraction has 1008 states and 1485 transitions. [2022-11-25 18:21:38,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 3 states have internal predecessors, (26), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 18:21:38,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1485 transitions. [2022-11-25 18:21:38,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-25 18:21:38,758 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:21:38,758 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-25 18:21:38,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 18:21:38,759 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:21:38,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:21:38,759 INFO L85 PathProgramCache]: Analyzing trace with hash -778149095, now seen corresponding path program 1 times [2022-11-25 18:21:38,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:21:38,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289931390] [2022-11-25 18:21:38,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:21:38,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:21:38,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:39,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:21:39,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:39,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:21:39,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:39,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 18:21:39,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:39,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:21:39,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:21:39,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289931390] [2022-11-25 18:21:39,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289931390] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:21:39,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:21:39,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:21:39,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511027288] [2022-11-25 18:21:39,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:21:39,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:21:39,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:21:39,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:21:39,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:21:39,637 INFO L87 Difference]: Start difference. First operand 1008 states and 1485 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 18:21:44,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:21:46,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:21:46,219 INFO L93 Difference]: Finished difference Result 1879 states and 2849 transitions. [2022-11-25 18:21:46,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:21:46,220 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 45 [2022-11-25 18:21:46,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:21:46,233 INFO L225 Difference]: With dead ends: 1879 [2022-11-25 18:21:46,234 INFO L226 Difference]: Without dead ends: 1860 [2022-11-25 18:21:46,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-25 18:21:46,237 INFO L413 NwaCegarLoop]: 692 mSDtfsCounter, 1502 mSDsluCounter, 1255 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 364 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1572 SdHoareTripleChecker+Valid, 1947 SdHoareTripleChecker+Invalid, 1291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 364 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-11-25 18:21:46,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1572 Valid, 1947 Invalid, 1291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [364 Valid, 926 Invalid, 1 Unknown, 0 Unchecked, 6.3s Time] [2022-11-25 18:21:46,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1860 states. [2022-11-25 18:21:46,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1860 to 1624. [2022-11-25 18:21:46,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1624 states, 1348 states have (on average 1.4614243323442135) internal successors, (1970), 1393 states have internal predecessors, (1970), 203 states have call successors, (203), 65 states have call predecessors, (203), 72 states have return successors, (264), 178 states have call predecessors, (264), 188 states have call successors, (264) [2022-11-25 18:21:46,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 2437 transitions. [2022-11-25 18:21:46,367 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 2437 transitions. Word has length 45 [2022-11-25 18:21:46,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:21:46,368 INFO L495 AbstractCegarLoop]: Abstraction has 1624 states and 2437 transitions. [2022-11-25 18:21:46,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 18:21:46,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 2437 transitions. [2022-11-25 18:21:46,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-25 18:21:46,371 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:21:46,371 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-25 18:21:46,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 18:21:46,372 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:21:46,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:21:46,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1291674765, now seen corresponding path program 1 times [2022-11-25 18:21:46,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:21:46,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766316690] [2022-11-25 18:21:46,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:21:46,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:21:46,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:46,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:21:46,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:46,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:21:46,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:46,809 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-25 18:21:46,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:21:46,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766316690] [2022-11-25 18:21:46,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766316690] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:21:46,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:21:46,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:21:46,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648363373] [2022-11-25 18:21:46,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:21:46,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:21:46,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:21:46,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:21:46,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:21:46,813 INFO L87 Difference]: Start difference. First operand 1624 states and 2437 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 3 states have internal predecessors, (38), 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-25 18:21:52,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:21:53,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:21:53,550 INFO L93 Difference]: Finished difference Result 1856 states and 2829 transitions. [2022-11-25 18:21:53,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:21:53,551 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 3 states have internal predecessors, (38), 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 43 [2022-11-25 18:21:53,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:21:53,563 INFO L225 Difference]: With dead ends: 1856 [2022-11-25 18:21:53,564 INFO L226 Difference]: Without dead ends: 1852 [2022-11-25 18:21:53,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-25 18:21:53,567 INFO L413 NwaCegarLoop]: 635 mSDtfsCounter, 492 mSDsluCounter, 1304 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 221 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 1939 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-11-25 18:21:53,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 1939 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 871 Invalid, 1 Unknown, 0 Unchecked, 6.5s Time] [2022-11-25 18:21:53,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1852 states. [2022-11-25 18:21:53,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1852 to 1657. [2022-11-25 18:21:53,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1657 states, 1379 states have (on average 1.4612037708484409) internal successors, (2015), 1421 states have internal predecessors, (2015), 204 states have call successors, (204), 67 states have call predecessors, (204), 73 states have return successors, (265), 179 states have call predecessors, (265), 189 states have call successors, (265) [2022-11-25 18:21:53,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1657 states to 1657 states and 2484 transitions. [2022-11-25 18:21:53,725 INFO L78 Accepts]: Start accepts. Automaton has 1657 states and 2484 transitions. Word has length 43 [2022-11-25 18:21:53,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:21:53,726 INFO L495 AbstractCegarLoop]: Abstraction has 1657 states and 2484 transitions. [2022-11-25 18:21:53,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 3 states have internal predecessors, (38), 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-25 18:21:53,727 INFO L276 IsEmpty]: Start isEmpty. Operand 1657 states and 2484 transitions. [2022-11-25 18:21:53,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-25 18:21:53,732 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:21:53,732 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-25 18:21:53,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 18:21:53,733 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:21:53,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:21:53,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1850160334, now seen corresponding path program 1 times [2022-11-25 18:21:53,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:21:53,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291656630] [2022-11-25 18:21:53,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:21:53,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:21:53,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:54,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:21:54,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:54,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:21:54,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:54,102 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-25 18:21:54,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:21:54,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291656630] [2022-11-25 18:21:54,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291656630] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:21:54,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:21:54,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:21:54,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556412216] [2022-11-25 18:21:54,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:21:54,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:21:54,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:21:54,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:21:54,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:21:54,107 INFO L87 Difference]: Start difference. First operand 1657 states and 2484 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 18:21:59,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:22:02,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:22:02,644 INFO L93 Difference]: Finished difference Result 3293 states and 5099 transitions. [2022-11-25 18:22:02,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:22:02,645 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2022-11-25 18:22:02,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:22:02,668 INFO L225 Difference]: With dead ends: 3293 [2022-11-25 18:22:02,668 INFO L226 Difference]: Without dead ends: 3290 [2022-11-25 18:22:02,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-25 18:22:02,672 INFO L413 NwaCegarLoop]: 1008 mSDtfsCounter, 958 mSDsluCounter, 1779 mSDsCounter, 0 mSdLazyCounter, 1355 mSolverCounterSat, 277 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 987 SdHoareTripleChecker+Valid, 2787 SdHoareTripleChecker+Invalid, 1633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 1355 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:22:02,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [987 Valid, 2787 Invalid, 1633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 1355 Invalid, 1 Unknown, 0 Unchecked, 8.2s Time] [2022-11-25 18:22:02,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3290 states. [2022-11-25 18:22:02,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3290 to 2657. [2022-11-25 18:22:02,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2657 states, 2246 states have (on average 1.4746215494211932) internal successors, (3312), 2298 states have internal predecessors, (3312), 292 states have call successors, (292), 107 states have call predecessors, (292), 118 states have return successors, (418), 262 states have call predecessors, (418), 277 states have call successors, (418) [2022-11-25 18:22:02,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2657 states to 2657 states and 4022 transitions. [2022-11-25 18:22:02,871 INFO L78 Accepts]: Start accepts. Automaton has 2657 states and 4022 transitions. Word has length 45 [2022-11-25 18:22:02,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:22:02,871 INFO L495 AbstractCegarLoop]: Abstraction has 2657 states and 4022 transitions. [2022-11-25 18:22:02,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 18:22:02,872 INFO L276 IsEmpty]: Start isEmpty. Operand 2657 states and 4022 transitions. [2022-11-25 18:22:02,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-25 18:22:02,873 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:22:02,874 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-25 18:22:02,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 18:22:02,874 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:22:02,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:22:02,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1615003555, now seen corresponding path program 1 times [2022-11-25 18:22:02,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:22:02,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814871747] [2022-11-25 18:22:02,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:22:02,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:22:02,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:03,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:22:03,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:03,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:22:03,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:03,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 18:22:03,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:03,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:22:03,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:03,377 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-25 18:22:03,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:22:03,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814871747] [2022-11-25 18:22:03,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814871747] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:22:03,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:22:03,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 18:22:03,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408639337] [2022-11-25 18:22:03,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:22:03,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 18:22:03,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:22:03,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 18:22:03,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:22:03,383 INFO L87 Difference]: Start difference. First operand 2657 states and 4022 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 18:22:08,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:22:12,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:22:12,299 INFO L93 Difference]: Finished difference Result 3942 states and 6165 transitions. [2022-11-25 18:22:12,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 18:22:12,300 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 48 [2022-11-25 18:22:12,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:22:12,325 INFO L225 Difference]: With dead ends: 3942 [2022-11-25 18:22:12,325 INFO L226 Difference]: Without dead ends: 3937 [2022-11-25 18:22:12,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2022-11-25 18:22:12,329 INFO L413 NwaCegarLoop]: 870 mSDtfsCounter, 1306 mSDsluCounter, 1824 mSDsCounter, 0 mSdLazyCounter, 1848 mSolverCounterSat, 545 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1327 SdHoareTripleChecker+Valid, 2694 SdHoareTripleChecker+Invalid, 2394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 545 IncrementalHoareTripleChecker+Valid, 1848 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2022-11-25 18:22:12,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1327 Valid, 2694 Invalid, 2394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [545 Valid, 1848 Invalid, 1 Unknown, 0 Unchecked, 8.4s Time] [2022-11-25 18:22:12,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3937 states. [2022-11-25 18:22:12,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3937 to 3272. [2022-11-25 18:22:12,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3272 states, 2761 states have (on average 1.4791742122419413) internal successors, (4084), 2832 states have internal predecessors, (4084), 364 states have call successors, (364), 126 states have call predecessors, (364), 146 states have return successors, (557), 324 states have call predecessors, (557), 349 states have call successors, (557) [2022-11-25 18:22:12,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3272 states to 3272 states and 5005 transitions. [2022-11-25 18:22:12,587 INFO L78 Accepts]: Start accepts. Automaton has 3272 states and 5005 transitions. Word has length 48 [2022-11-25 18:22:12,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:22:12,588 INFO L495 AbstractCegarLoop]: Abstraction has 3272 states and 5005 transitions. [2022-11-25 18:22:12,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 18:22:12,588 INFO L276 IsEmpty]: Start isEmpty. Operand 3272 states and 5005 transitions. [2022-11-25 18:22:12,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-25 18:22:12,590 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:22:12,590 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-25 18:22:12,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 18:22:12,591 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:22:12,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:22:12,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1759276290, now seen corresponding path program 1 times [2022-11-25 18:22:12,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:22:12,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532685505] [2022-11-25 18:22:12,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:22:12,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:22:12,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:13,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:22:13,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:13,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:22:13,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:13,385 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-25 18:22:13,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:22:13,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532685505] [2022-11-25 18:22:13,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532685505] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:22:13,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:22:13,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 18:22:13,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618769327] [2022-11-25 18:22:13,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:22:13,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:22:13,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:22:13,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:22:13,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:22:13,389 INFO L87 Difference]: Start difference. First operand 3272 states and 5005 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 4 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:22:18,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:22:20,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:22:23,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:22:23,302 INFO L93 Difference]: Finished difference Result 7046 states and 10914 transitions. [2022-11-25 18:22:23,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 18:22:23,303 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), 4 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 46 [2022-11-25 18:22:23,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:22:23,331 INFO L225 Difference]: With dead ends: 7046 [2022-11-25 18:22:23,331 INFO L226 Difference]: Without dead ends: 4021 [2022-11-25 18:22:23,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-11-25 18:22:23,348 INFO L413 NwaCegarLoop]: 783 mSDtfsCounter, 2405 mSDsluCounter, 1376 mSDsCounter, 0 mSdLazyCounter, 1285 mSolverCounterSat, 681 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2452 SdHoareTripleChecker+Valid, 2159 SdHoareTripleChecker+Invalid, 1968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 681 IncrementalHoareTripleChecker+Valid, 1285 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2022-11-25 18:22:23,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2452 Valid, 2159 Invalid, 1968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [681 Valid, 1285 Invalid, 2 Unknown, 0 Unchecked, 9.3s Time] [2022-11-25 18:22:23,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4021 states. [2022-11-25 18:22:23,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4021 to 3266. [2022-11-25 18:22:23,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3266 states, 2755 states have (on average 1.4773139745916515) internal successors, (4070), 2826 states have internal predecessors, (4070), 364 states have call successors, (364), 126 states have call predecessors, (364), 146 states have return successors, (557), 324 states have call predecessors, (557), 349 states have call successors, (557) [2022-11-25 18:22:23,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3266 states to 3266 states and 4991 transitions. [2022-11-25 18:22:23,645 INFO L78 Accepts]: Start accepts. Automaton has 3266 states and 4991 transitions. Word has length 46 [2022-11-25 18:22:23,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:22:23,645 INFO L495 AbstractCegarLoop]: Abstraction has 3266 states and 4991 transitions. [2022-11-25 18:22:23,646 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), 4 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:22:23,646 INFO L276 IsEmpty]: Start isEmpty. Operand 3266 states and 4991 transitions. [2022-11-25 18:22:23,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-25 18:22:23,649 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:22:23,650 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-25 18:22:23,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 18:22:23,650 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:22:23,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:22:23,651 INFO L85 PathProgramCache]: Analyzing trace with hash 436509709, now seen corresponding path program 1 times [2022-11-25 18:22:23,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:22:23,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194259496] [2022-11-25 18:22:23,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:22:23,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:22:23,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:24,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:22:24,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:24,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:22:24,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:24,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-25 18:22:24,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:24,155 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-25 18:22:24,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:22:24,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194259496] [2022-11-25 18:22:24,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194259496] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:22:24,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:22:24,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 18:22:24,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968884267] [2022-11-25 18:22:24,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:22:24,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:22:24,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:22:24,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:22:24,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:22:24,159 INFO L87 Difference]: Start difference. First operand 3266 states and 4991 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 18:22:28,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:22:32,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:22:32,364 INFO L93 Difference]: Finished difference Result 10834 states and 17245 transitions. [2022-11-25 18:22:32,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 18:22:32,365 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 47 [2022-11-25 18:22:32,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:22:32,441 INFO L225 Difference]: With dead ends: 10834 [2022-11-25 18:22:32,442 INFO L226 Difference]: Without dead ends: 7785 [2022-11-25 18:22:32,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2022-11-25 18:22:32,468 INFO L413 NwaCegarLoop]: 801 mSDtfsCounter, 2172 mSDsluCounter, 1768 mSDsCounter, 0 mSdLazyCounter, 1381 mSolverCounterSat, 628 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2248 SdHoareTripleChecker+Valid, 2569 SdHoareTripleChecker+Invalid, 2010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 628 IncrementalHoareTripleChecker+Valid, 1381 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:22:32,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2248 Valid, 2569 Invalid, 2010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [628 Valid, 1381 Invalid, 1 Unknown, 0 Unchecked, 7.2s Time] [2022-11-25 18:22:32,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7785 states. [2022-11-25 18:22:33,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7785 to 6900. [2022-11-25 18:22:33,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6900 states, 5812 states have (on average 1.4893324156916723) internal successors, (8656), 6037 states have internal predecessors, (8656), 801 states have call successors, (801), 234 states have call predecessors, (801), 286 states have return successors, (1391), 659 states have call predecessors, (1391), 789 states have call successors, (1391) [2022-11-25 18:22:33,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6900 states to 6900 states and 10848 transitions. [2022-11-25 18:22:33,242 INFO L78 Accepts]: Start accepts. Automaton has 6900 states and 10848 transitions. Word has length 47 [2022-11-25 18:22:33,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:22:33,244 INFO L495 AbstractCegarLoop]: Abstraction has 6900 states and 10848 transitions. [2022-11-25 18:22:33,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 18:22:33,245 INFO L276 IsEmpty]: Start isEmpty. Operand 6900 states and 10848 transitions. [2022-11-25 18:22:33,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-25 18:22:33,247 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:22:33,247 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-25 18:22:33,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 18:22:33,248 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:22:33,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:22:33,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1335861569, now seen corresponding path program 1 times [2022-11-25 18:22:33,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:22:33,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161900877] [2022-11-25 18:22:33,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:22:33,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:22:33,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:33,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:22:33,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:33,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:22:33,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:33,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-25 18:22:33,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:34,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:22:34,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:34,078 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-25 18:22:34,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:22:34,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161900877] [2022-11-25 18:22:34,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161900877] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:22:34,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:22:34,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-25 18:22:34,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048679899] [2022-11-25 18:22:34,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:22:34,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 18:22:34,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:22:34,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 18:22:34,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-25 18:22:34,082 INFO L87 Difference]: Start difference. First operand 6900 states and 10848 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 18:22:40,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:22:45,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:22:45,105 INFO L93 Difference]: Finished difference Result 7819 states and 12472 transitions. [2022-11-25 18:22:45,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-25 18:22:45,106 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 48 [2022-11-25 18:22:45,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:22:45,143 INFO L225 Difference]: With dead ends: 7819 [2022-11-25 18:22:45,143 INFO L226 Difference]: Without dead ends: 7813 [2022-11-25 18:22:45,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=191, Invalid=511, Unknown=0, NotChecked=0, Total=702 [2022-11-25 18:22:45,149 INFO L413 NwaCegarLoop]: 840 mSDtfsCounter, 2829 mSDsluCounter, 2145 mSDsCounter, 0 mSdLazyCounter, 2276 mSolverCounterSat, 998 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2890 SdHoareTripleChecker+Valid, 2985 SdHoareTripleChecker+Invalid, 3275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 998 IncrementalHoareTripleChecker+Valid, 2276 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.7s IncrementalHoareTripleChecker+Time [2022-11-25 18:22:45,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2890 Valid, 2985 Invalid, 3275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [998 Valid, 2276 Invalid, 1 Unknown, 0 Unchecked, 9.7s Time] [2022-11-25 18:22:45,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7813 states. [2022-11-25 18:22:45,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7813 to 6900. [2022-11-25 18:22:45,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6900 states, 5812 states have (on average 1.4891603578802477) internal successors, (8655), 6037 states have internal predecessors, (8655), 801 states have call successors, (801), 234 states have call predecessors, (801), 286 states have return successors, (1391), 659 states have call predecessors, (1391), 789 states have call successors, (1391) [2022-11-25 18:22:45,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6900 states to 6900 states and 10847 transitions. [2022-11-25 18:22:45,915 INFO L78 Accepts]: Start accepts. Automaton has 6900 states and 10847 transitions. Word has length 48 [2022-11-25 18:22:45,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:22:45,915 INFO L495 AbstractCegarLoop]: Abstraction has 6900 states and 10847 transitions. [2022-11-25 18:22:45,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 18:22:45,916 INFO L276 IsEmpty]: Start isEmpty. Operand 6900 states and 10847 transitions. [2022-11-25 18:22:45,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-25 18:22:45,918 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:22:45,918 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-25 18:22:45,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 18:22:45,918 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:22:45,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:22:45,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1807638448, now seen corresponding path program 1 times [2022-11-25 18:22:45,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:22:45,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497470101] [2022-11-25 18:22:45,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:22:45,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:22:46,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:46,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:22:46,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:46,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:22:46,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:46,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 18:22:46,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:46,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:22:46,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:22:46,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-25 18:22:46,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:22:46,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497470101] [2022-11-25 18:22:46,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497470101] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:22:46,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:22:46,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-25 18:22:46,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361641209] [2022-11-25 18:22:46,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:22:46,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 18:22:46,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:22:46,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 18:22:46,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-25 18:22:46,548 INFO L87 Difference]: Start difference. First operand 6900 states and 10847 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 18:22:53,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:22:55,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:23:00,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:23:00,561 INFO L93 Difference]: Finished difference Result 7815 states and 12466 transitions. [2022-11-25 18:23:00,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-25 18:23:00,562 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 50 [2022-11-25 18:23:00,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:23:00,598 INFO L225 Difference]: With dead ends: 7815 [2022-11-25 18:23:00,599 INFO L226 Difference]: Without dead ends: 7809 [2022-11-25 18:23:00,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=191, Invalid=511, Unknown=0, NotChecked=0, Total=702 [2022-11-25 18:23:00,604 INFO L413 NwaCegarLoop]: 840 mSDtfsCounter, 2414 mSDsluCounter, 2490 mSDsCounter, 0 mSdLazyCounter, 2808 mSolverCounterSat, 754 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2477 SdHoareTripleChecker+Valid, 3330 SdHoareTripleChecker+Invalid, 3564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 754 IncrementalHoareTripleChecker+Valid, 2808 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.6s IncrementalHoareTripleChecker+Time [2022-11-25 18:23:00,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2477 Valid, 3330 Invalid, 3564 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [754 Valid, 2808 Invalid, 2 Unknown, 0 Unchecked, 12.6s Time] [2022-11-25 18:23:00,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7809 states. [2022-11-25 18:23:01,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7809 to 6900. [2022-11-25 18:23:01,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6900 states, 5812 states have (on average 1.488988300068823) internal successors, (8654), 6037 states have internal predecessors, (8654), 801 states have call successors, (801), 234 states have call predecessors, (801), 286 states have return successors, (1391), 659 states have call predecessors, (1391), 789 states have call successors, (1391) [2022-11-25 18:23:01,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6900 states to 6900 states and 10846 transitions. [2022-11-25 18:23:01,432 INFO L78 Accepts]: Start accepts. Automaton has 6900 states and 10846 transitions. Word has length 50 [2022-11-25 18:23:01,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:23:01,433 INFO L495 AbstractCegarLoop]: Abstraction has 6900 states and 10846 transitions. [2022-11-25 18:23:01,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 18:23:01,433 INFO L276 IsEmpty]: Start isEmpty. Operand 6900 states and 10846 transitions. [2022-11-25 18:23:01,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-25 18:23:01,435 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:23:01,435 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-25 18:23:01,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 18:23:01,436 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:23:01,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:23:01,436 INFO L85 PathProgramCache]: Analyzing trace with hash 286289769, now seen corresponding path program 1 times [2022-11-25 18:23:01,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:23:01,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111204684] [2022-11-25 18:23:01,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:23:01,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:23:01,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:02,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:23:02,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:02,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:23:02,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:02,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 18:23:02,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:02,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:23:02,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:02,281 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-25 18:23:02,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:23:02,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111204684] [2022-11-25 18:23:02,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111204684] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:23:02,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:23:02,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-25 18:23:02,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941136461] [2022-11-25 18:23:02,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:23:02,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 18:23:02,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:23:02,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 18:23:02,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-25 18:23:02,285 INFO L87 Difference]: Start difference. First operand 6900 states and 10846 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 18:23:09,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:23:11,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:23:13,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:23:13,964 INFO L93 Difference]: Finished difference Result 7824 states and 12487 transitions. [2022-11-25 18:23:13,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 18:23:13,965 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 51 [2022-11-25 18:23:13,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:23:14,000 INFO L225 Difference]: With dead ends: 7824 [2022-11-25 18:23:14,000 INFO L226 Difference]: Without dead ends: 7807 [2022-11-25 18:23:14,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-11-25 18:23:14,007 INFO L413 NwaCegarLoop]: 590 mSDtfsCounter, 716 mSDsluCounter, 2880 mSDsCounter, 0 mSdLazyCounter, 2282 mSolverCounterSat, 240 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 742 SdHoareTripleChecker+Valid, 3470 SdHoareTripleChecker+Invalid, 2524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 2282 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2022-11-25 18:23:14,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [742 Valid, 3470 Invalid, 2524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 2282 Invalid, 2 Unknown, 0 Unchecked, 10.7s Time] [2022-11-25 18:23:14,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7807 states. [2022-11-25 18:23:14,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7807 to 6904. [2022-11-25 18:23:14,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6904 states, 5815 states have (on average 1.4885640584694755) internal successors, (8656), 6042 states have internal predecessors, (8656), 800 states have call successors, (800), 234 states have call predecessors, (800), 288 states have return successors, (1397), 658 states have call predecessors, (1397), 788 states have call successors, (1397) [2022-11-25 18:23:14,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6904 states to 6904 states and 10853 transitions. [2022-11-25 18:23:14,836 INFO L78 Accepts]: Start accepts. Automaton has 6904 states and 10853 transitions. Word has length 51 [2022-11-25 18:23:14,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:23:14,837 INFO L495 AbstractCegarLoop]: Abstraction has 6904 states and 10853 transitions. [2022-11-25 18:23:14,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 18:23:14,837 INFO L276 IsEmpty]: Start isEmpty. Operand 6904 states and 10853 transitions. [2022-11-25 18:23:14,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-25 18:23:14,839 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:23:14,839 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-25 18:23:14,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 18:23:14,840 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:23:14,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:23:14,841 INFO L85 PathProgramCache]: Analyzing trace with hash -376802648, now seen corresponding path program 1 times [2022-11-25 18:23:14,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:23:14,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735552741] [2022-11-25 18:23:14,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:23:14,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:23:14,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:15,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:23:15,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:15,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:23:15,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:15,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-25 18:23:15,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:15,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:23:15,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:15,499 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-25 18:23:15,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:23:15,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735552741] [2022-11-25 18:23:15,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735552741] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:23:15,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:23:15,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-25 18:23:15,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115480758] [2022-11-25 18:23:15,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:23:15,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 18:23:15,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:23:15,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 18:23:15,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-25 18:23:15,503 INFO L87 Difference]: Start difference. First operand 6904 states and 10853 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 18:23:23,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:23:25,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:23:28,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:23:28,097 INFO L93 Difference]: Finished difference Result 7822 states and 12483 transitions. [2022-11-25 18:23:28,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 18:23:28,098 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 50 [2022-11-25 18:23:28,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:23:28,135 INFO L225 Difference]: With dead ends: 7822 [2022-11-25 18:23:28,135 INFO L226 Difference]: Without dead ends: 7800 [2022-11-25 18:23:28,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-11-25 18:23:28,142 INFO L413 NwaCegarLoop]: 574 mSDtfsCounter, 716 mSDsluCounter, 2802 mSDsCounter, 0 mSdLazyCounter, 2264 mSolverCounterSat, 238 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 742 SdHoareTripleChecker+Valid, 3376 SdHoareTripleChecker+Invalid, 2504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 2264 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.7s IncrementalHoareTripleChecker+Time [2022-11-25 18:23:28,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [742 Valid, 3376 Invalid, 2504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 2264 Invalid, 2 Unknown, 0 Unchecked, 11.7s Time] [2022-11-25 18:23:28,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7800 states. [2022-11-25 18:23:28,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7800 to 6897. [2022-11-25 18:23:28,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6897 states, 5811 states have (on average 1.4887282739631733) internal successors, (8651), 6038 states have internal predecessors, (8651), 798 states have call successors, (798), 233 states have call predecessors, (798), 287 states have return successors, (1395), 656 states have call predecessors, (1395), 786 states have call successors, (1395) [2022-11-25 18:23:28,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6897 states to 6897 states and 10844 transitions. [2022-11-25 18:23:28,891 INFO L78 Accepts]: Start accepts. Automaton has 6897 states and 10844 transitions. Word has length 50 [2022-11-25 18:23:28,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:23:28,891 INFO L495 AbstractCegarLoop]: Abstraction has 6897 states and 10844 transitions. [2022-11-25 18:23:28,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 18:23:28,892 INFO L276 IsEmpty]: Start isEmpty. Operand 6897 states and 10844 transitions. [2022-11-25 18:23:28,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-25 18:23:28,897 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:23:28,897 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-25 18:23:28,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 18:23:28,898 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:23:28,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:23:28,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1945256571, now seen corresponding path program 1 times [2022-11-25 18:23:28,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:23:28,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479337606] [2022-11-25 18:23:28,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:23:28,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:23:29,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:29,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:23:29,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:29,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:23:29,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:29,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 18:23:29,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:29,325 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-25 18:23:29,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:23:29,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479337606] [2022-11-25 18:23:29,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479337606] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:23:29,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:23:29,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 18:23:29,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992217481] [2022-11-25 18:23:29,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:23:29,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:23:29,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:23:29,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:23:29,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:23:29,329 INFO L87 Difference]: Start difference. First operand 6897 states and 10844 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 18:23:34,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:23:36,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:23:36,223 INFO L93 Difference]: Finished difference Result 13804 states and 22175 transitions. [2022-11-25 18:23:36,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:23:36,224 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 52 [2022-11-25 18:23:36,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:23:36,268 INFO L225 Difference]: With dead ends: 13804 [2022-11-25 18:23:36,268 INFO L226 Difference]: Without dead ends: 8064 [2022-11-25 18:23:36,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-25 18:23:36,313 INFO L413 NwaCegarLoop]: 625 mSDtfsCounter, 434 mSDsluCounter, 1356 mSDsCounter, 0 mSdLazyCounter, 1010 mSolverCounterSat, 211 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 1981 SdHoareTripleChecker+Invalid, 1222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 1010 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-11-25 18:23:36,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 1981 Invalid, 1222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 1010 Invalid, 1 Unknown, 0 Unchecked, 5.9s Time] [2022-11-25 18:23:36,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8064 states. [2022-11-25 18:23:37,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8064 to 7053. [2022-11-25 18:23:37,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7053 states, 5967 states have (on average 1.4799731858555387) internal successors, (8831), 6194 states have internal predecessors, (8831), 798 states have call successors, (798), 233 states have call predecessors, (798), 287 states have return successors, (1395), 656 states have call predecessors, (1395), 786 states have call successors, (1395) [2022-11-25 18:23:37,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7053 states to 7053 states and 11024 transitions. [2022-11-25 18:23:37,206 INFO L78 Accepts]: Start accepts. Automaton has 7053 states and 11024 transitions. Word has length 52 [2022-11-25 18:23:37,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:23:37,206 INFO L495 AbstractCegarLoop]: Abstraction has 7053 states and 11024 transitions. [2022-11-25 18:23:37,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 18:23:37,207 INFO L276 IsEmpty]: Start isEmpty. Operand 7053 states and 11024 transitions. [2022-11-25 18:23:37,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-25 18:23:37,210 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:23:37,210 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-25 18:23:37,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 18:23:37,211 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:23:37,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:23:37,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1217127572, now seen corresponding path program 1 times [2022-11-25 18:23:37,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:23:37,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010739046] [2022-11-25 18:23:37,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:23:37,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:23:37,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:37,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:23:37,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:37,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:23:37,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:37,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-25 18:23:37,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:37,730 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-25 18:23:37,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:23:37,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010739046] [2022-11-25 18:23:37,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010739046] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:23:37,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:23:37,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 18:23:37,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420355127] [2022-11-25 18:23:37,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:23:37,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 18:23:37,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:23:37,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 18:23:37,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:23:37,733 INFO L87 Difference]: Start difference. First operand 7053 states and 11024 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, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 18:23:43,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:23:45,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:23:45,741 INFO L93 Difference]: Finished difference Result 8020 states and 12715 transitions. [2022-11-25 18:23:45,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:23:45,742 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, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 53 [2022-11-25 18:23:45,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:23:45,773 INFO L225 Difference]: With dead ends: 8020 [2022-11-25 18:23:45,774 INFO L226 Difference]: Without dead ends: 8002 [2022-11-25 18:23:45,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-11-25 18:23:45,779 INFO L413 NwaCegarLoop]: 583 mSDtfsCounter, 907 mSDsluCounter, 2093 mSDsCounter, 0 mSdLazyCounter, 1532 mSolverCounterSat, 335 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 930 SdHoareTripleChecker+Valid, 2676 SdHoareTripleChecker+Invalid, 1868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 335 IncrementalHoareTripleChecker+Valid, 1532 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:23:45,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [930 Valid, 2676 Invalid, 1868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [335 Valid, 1532 Invalid, 1 Unknown, 0 Unchecked, 7.1s Time] [2022-11-25 18:23:45,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8002 states. [2022-11-25 18:23:46,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8002 to 7051. [2022-11-25 18:23:46,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7051 states, 5966 states have (on average 1.479886020784445) internal successors, (8829), 6193 states have internal predecessors, (8829), 797 states have call successors, (797), 233 states have call predecessors, (797), 287 states have return successors, (1394), 655 states have call predecessors, (1394), 785 states have call successors, (1394) [2022-11-25 18:23:46,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7051 states to 7051 states and 11020 transitions. [2022-11-25 18:23:46,575 INFO L78 Accepts]: Start accepts. Automaton has 7051 states and 11020 transitions. Word has length 53 [2022-11-25 18:23:46,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:23:46,576 INFO L495 AbstractCegarLoop]: Abstraction has 7051 states and 11020 transitions. [2022-11-25 18:23:46,576 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, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 18:23:46,576 INFO L276 IsEmpty]: Start isEmpty. Operand 7051 states and 11020 transitions. [2022-11-25 18:23:46,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-25 18:23:46,577 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:23:46,577 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-25 18:23:46,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 18:23:46,578 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:23:46,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:23:46,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1937199149, now seen corresponding path program 1 times [2022-11-25 18:23:46,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:23:46,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718084297] [2022-11-25 18:23:46,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:23:46,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:23:46,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:47,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:23:47,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:47,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:23:47,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:47,077 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-25 18:23:47,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:23:47,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718084297] [2022-11-25 18:23:47,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718084297] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:23:47,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:23:47,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 18:23:47,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982038837] [2022-11-25 18:23:47,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:23:47,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:23:47,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:23:47,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:23:47,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:23:47,081 INFO L87 Difference]: Start difference. First operand 7051 states and 11020 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 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-25 18:23:52,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:23:54,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:23:54,754 INFO L93 Difference]: Finished difference Result 11721 states and 18614 transitions. [2022-11-25 18:23:54,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:23:54,755 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 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 52 [2022-11-25 18:23:54,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:23:54,785 INFO L225 Difference]: With dead ends: 11721 [2022-11-25 18:23:54,786 INFO L226 Difference]: Without dead ends: 7953 [2022-11-25 18:23:54,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2022-11-25 18:23:54,817 INFO L413 NwaCegarLoop]: 591 mSDtfsCounter, 1226 mSDsluCounter, 1168 mSDsCounter, 0 mSdLazyCounter, 1005 mSolverCounterSat, 311 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1277 SdHoareTripleChecker+Valid, 1759 SdHoareTripleChecker+Invalid, 1317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 311 IncrementalHoareTripleChecker+Valid, 1005 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-11-25 18:23:54,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1277 Valid, 1759 Invalid, 1317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [311 Valid, 1005 Invalid, 1 Unknown, 0 Unchecked, 6.5s Time] [2022-11-25 18:23:54,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7953 states. [2022-11-25 18:23:55,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7953 to 7041. [2022-11-25 18:23:55,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7041 states, 5957 states have (on average 1.4787644787644787) internal successors, (8809), 6184 states have internal predecessors, (8809), 797 states have call successors, (797), 233 states have call predecessors, (797), 286 states have return successors, (1393), 654 states have call predecessors, (1393), 784 states have call successors, (1393) [2022-11-25 18:23:55,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7041 states to 7041 states and 10999 transitions. [2022-11-25 18:23:55,651 INFO L78 Accepts]: Start accepts. Automaton has 7041 states and 10999 transitions. Word has length 52 [2022-11-25 18:23:55,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:23:55,652 INFO L495 AbstractCegarLoop]: Abstraction has 7041 states and 10999 transitions. [2022-11-25 18:23:55,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 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-25 18:23:55,652 INFO L276 IsEmpty]: Start isEmpty. Operand 7041 states and 10999 transitions. [2022-11-25 18:23:55,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-25 18:23:55,657 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:23:55,657 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-25 18:23:55,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 18:23:55,658 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:23:55,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:23:55,658 INFO L85 PathProgramCache]: Analyzing trace with hash 872726643, now seen corresponding path program 1 times [2022-11-25 18:23:55,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:23:55,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102494747] [2022-11-25 18:23:55,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:23:55,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:23:55,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:56,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:23:56,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:56,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:23:56,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:56,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 18:23:56,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:56,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 18:23:56,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:56,298 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-25 18:23:56,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:23:56,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102494747] [2022-11-25 18:23:56,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102494747] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:23:56,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:23:56,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-25 18:23:56,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974711381] [2022-11-25 18:23:56,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:23:56,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 18:23:56,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:23:56,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 18:23:56,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-25 18:23:56,302 INFO L87 Difference]: Start difference. First operand 7041 states and 10999 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 18:24:02,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:24:04,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:24:04,271 INFO L93 Difference]: Finished difference Result 8024 states and 12754 transitions. [2022-11-25 18:24:04,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 18:24:04,272 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 55 [2022-11-25 18:24:04,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:24:04,298 INFO L225 Difference]: With dead ends: 8024 [2022-11-25 18:24:04,298 INFO L226 Difference]: Without dead ends: 8008 [2022-11-25 18:24:04,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-11-25 18:24:04,303 INFO L413 NwaCegarLoop]: 579 mSDtfsCounter, 978 mSDsluCounter, 2603 mSDsCounter, 0 mSdLazyCounter, 1867 mSolverCounterSat, 430 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1001 SdHoareTripleChecker+Valid, 3182 SdHoareTripleChecker+Invalid, 2298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 430 IncrementalHoareTripleChecker+Valid, 1867 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:24:04,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1001 Valid, 3182 Invalid, 2298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [430 Valid, 1867 Invalid, 1 Unknown, 0 Unchecked, 7.0s Time] [2022-11-25 18:24:04,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8008 states. [2022-11-25 18:24:05,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8008 to 7047. [2022-11-25 18:24:05,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7047 states, 5960 states have (on average 1.4785234899328858) internal successors, (8812), 6190 states have internal predecessors, (8812), 797 states have call successors, (797), 233 states have call predecessors, (797), 289 states have return successors, (1415), 654 states have call predecessors, (1415), 784 states have call successors, (1415) [2022-11-25 18:24:05,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7047 states to 7047 states and 11024 transitions. [2022-11-25 18:24:05,089 INFO L78 Accepts]: Start accepts. Automaton has 7047 states and 11024 transitions. Word has length 55 [2022-11-25 18:24:05,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:24:05,089 INFO L495 AbstractCegarLoop]: Abstraction has 7047 states and 11024 transitions. [2022-11-25 18:24:05,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 18:24:05,089 INFO L276 IsEmpty]: Start isEmpty. Operand 7047 states and 11024 transitions. [2022-11-25 18:24:05,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-25 18:24:05,091 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:24:05,092 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-25 18:24:05,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-25 18:24:05,092 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:24:05,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:24:05,093 INFO L85 PathProgramCache]: Analyzing trace with hash 555700014, now seen corresponding path program 1 times [2022-11-25 18:24:05,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:24:05,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948955656] [2022-11-25 18:24:05,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:24:05,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:24:05,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:05,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:24:05,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:05,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:24:05,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:05,418 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-25 18:24:05,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:24:05,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948955656] [2022-11-25 18:24:05,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948955656] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:24:05,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:24:05,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:24:05,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198413437] [2022-11-25 18:24:05,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:24:05,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:24:05,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:24:05,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:24:05,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:24:05,421 INFO L87 Difference]: Start difference. First operand 7047 states and 11024 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-25 18:24:10,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:24:12,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:24:15,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:24:15,986 INFO L93 Difference]: Finished difference Result 10992 states and 17757 transitions. [2022-11-25 18:24:15,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:24:15,987 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-25 18:24:15,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:24:16,030 INFO L225 Difference]: With dead ends: 10992 [2022-11-25 18:24:16,030 INFO L226 Difference]: Without dead ends: 10979 [2022-11-25 18:24:16,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-25 18:24:16,038 INFO L413 NwaCegarLoop]: 1030 mSDtfsCounter, 998 mSDsluCounter, 1801 mSDsCounter, 0 mSdLazyCounter, 1357 mSolverCounterSat, 276 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1029 SdHoareTripleChecker+Valid, 2831 SdHoareTripleChecker+Invalid, 1635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 1357 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:24:16,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1029 Valid, 2831 Invalid, 1635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 1357 Invalid, 2 Unknown, 0 Unchecked, 9.2s Time] [2022-11-25 18:24:16,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10979 states. [2022-11-25 18:24:16,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10979 to 8362. [2022-11-25 18:24:16,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8362 states, 7112 states have (on average 1.4822834645669292) internal successors, (10542), 7344 states have internal predecessors, (10542), 910 states have call successors, (910), 275 states have call predecessors, (910), 339 states have return successors, (1687), 773 states have call predecessors, (1687), 897 states have call successors, (1687) [2022-11-25 18:24:16,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8362 states to 8362 states and 13139 transitions. [2022-11-25 18:24:16,935 INFO L78 Accepts]: Start accepts. Automaton has 8362 states and 13139 transitions. Word has length 54 [2022-11-25 18:24:16,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:24:16,935 INFO L495 AbstractCegarLoop]: Abstraction has 8362 states and 13139 transitions. [2022-11-25 18:24:16,935 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-25 18:24:16,935 INFO L276 IsEmpty]: Start isEmpty. Operand 8362 states and 13139 transitions. [2022-11-25 18:24:16,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-25 18:24:16,937 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:24:16,937 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-25 18:24:16,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-25 18:24:16,938 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:24:16,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:24:16,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1129689134, now seen corresponding path program 1 times [2022-11-25 18:24:16,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:24:16,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881997117] [2022-11-25 18:24:16,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:24:16,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:24:17,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:17,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:24:17,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:17,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:24:17,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:17,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-25 18:24:17,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:24:17,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881997117] [2022-11-25 18:24:17,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881997117] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:24:17,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:24:17,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 18:24:17,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477925633] [2022-11-25 18:24:17,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:24:17,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:24:17,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:24:17,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:24:17,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:24:17,448 INFO L87 Difference]: Start difference. First operand 8362 states and 13139 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 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-25 18:24:23,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:24:24,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:24:24,853 INFO L93 Difference]: Finished difference Result 13163 states and 20813 transitions. [2022-11-25 18:24:24,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:24:24,854 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 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 54 [2022-11-25 18:24:24,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:24:24,892 INFO L225 Difference]: With dead ends: 13163 [2022-11-25 18:24:24,892 INFO L226 Difference]: Without dead ends: 8839 [2022-11-25 18:24:24,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2022-11-25 18:24:24,910 INFO L413 NwaCegarLoop]: 590 mSDtfsCounter, 1208 mSDsluCounter, 1169 mSDsCounter, 0 mSdLazyCounter, 960 mSolverCounterSat, 296 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1259 SdHoareTripleChecker+Valid, 1759 SdHoareTripleChecker+Invalid, 1257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 296 IncrementalHoareTripleChecker+Valid, 960 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:24:24,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1259 Valid, 1759 Invalid, 1257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [296 Valid, 960 Invalid, 1 Unknown, 0 Unchecked, 6.2s Time] [2022-11-25 18:24:24,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8839 states. [2022-11-25 18:24:25,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8839 to 6799. [2022-11-25 18:24:25,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6799 states, 5772 states have (on average 1.48007623007623) internal successors, (8543), 5976 states have internal predecessors, (8543), 751 states have call successors, (751), 230 states have call predecessors, (751), 275 states have return successors, (1161), 623 states have call predecessors, (1161), 738 states have call successors, (1161) [2022-11-25 18:24:25,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6799 states to 6799 states and 10455 transitions. [2022-11-25 18:24:25,642 INFO L78 Accepts]: Start accepts. Automaton has 6799 states and 10455 transitions. Word has length 54 [2022-11-25 18:24:25,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:24:25,642 INFO L495 AbstractCegarLoop]: Abstraction has 6799 states and 10455 transitions. [2022-11-25 18:24:25,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 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-25 18:24:25,643 INFO L276 IsEmpty]: Start isEmpty. Operand 6799 states and 10455 transitions. [2022-11-25 18:24:25,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-25 18:24:25,644 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:24:25,644 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-25 18:24:25,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-25 18:24:25,644 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:24:25,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:24:25,645 INFO L85 PathProgramCache]: Analyzing trace with hash 238766756, now seen corresponding path program 1 times [2022-11-25 18:24:25,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:24:25,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156957721] [2022-11-25 18:24:25,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:24:25,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:24:25,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:26,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:24:26,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:26,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:24:26,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:26,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 18:24:26,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:26,097 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-25 18:24:26,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:24:26,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156957721] [2022-11-25 18:24:26,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156957721] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:24:26,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:24:26,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 18:24:26,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682699437] [2022-11-25 18:24:26,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:24:26,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 18:24:26,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:24:26,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 18:24:26,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:24:26,104 INFO L87 Difference]: Start difference. First operand 6799 states and 10455 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 18:24:31,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:24:33,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:24:33,392 INFO L93 Difference]: Finished difference Result 7691 states and 11990 transitions. [2022-11-25 18:24:33,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:24:33,393 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 55 [2022-11-25 18:24:33,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:24:33,420 INFO L225 Difference]: With dead ends: 7691 [2022-11-25 18:24:33,420 INFO L226 Difference]: Without dead ends: 7673 [2022-11-25 18:24:33,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-11-25 18:24:33,426 INFO L413 NwaCegarLoop]: 586 mSDtfsCounter, 900 mSDsluCounter, 2096 mSDsCounter, 0 mSdLazyCounter, 1531 mSolverCounterSat, 332 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 923 SdHoareTripleChecker+Valid, 2682 SdHoareTripleChecker+Invalid, 1864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 332 IncrementalHoareTripleChecker+Valid, 1531 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:24:33,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [923 Valid, 2682 Invalid, 1864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [332 Valid, 1531 Invalid, 1 Unknown, 0 Unchecked, 6.2s Time] [2022-11-25 18:24:33,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7673 states. [2022-11-25 18:24:34,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7673 to 6796. [2022-11-25 18:24:34,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6796 states, 5770 states have (on average 1.4800693240901213) internal successors, (8540), 5974 states have internal predecessors, (8540), 750 states have call successors, (750), 230 states have call predecessors, (750), 275 states have return successors, (1160), 622 states have call predecessors, (1160), 737 states have call successors, (1160) [2022-11-25 18:24:34,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6796 states to 6796 states and 10450 transitions. [2022-11-25 18:24:34,591 INFO L78 Accepts]: Start accepts. Automaton has 6796 states and 10450 transitions. Word has length 55 [2022-11-25 18:24:34,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:24:34,591 INFO L495 AbstractCegarLoop]: Abstraction has 6796 states and 10450 transitions. [2022-11-25 18:24:34,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 18:24:34,591 INFO L276 IsEmpty]: Start isEmpty. Operand 6796 states and 10450 transitions. [2022-11-25 18:24:34,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-25 18:24:34,594 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:24:34,594 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-25 18:24:34,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-25 18:24:34,595 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:24:34,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:24:34,595 INFO L85 PathProgramCache]: Analyzing trace with hash 499005845, now seen corresponding path program 1 times [2022-11-25 18:24:34,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:24:34,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457561730] [2022-11-25 18:24:34,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:24:34,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:24:34,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:35,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:24:35,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:35,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:24:35,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:35,106 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-25 18:24:35,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:24:35,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457561730] [2022-11-25 18:24:35,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457561730] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:24:35,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:24:35,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 18:24:35,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391628563] [2022-11-25 18:24:35,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:24:35,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:24:35,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:24:35,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:24:35,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:24:35,111 INFO L87 Difference]: Start difference. First operand 6796 states and 10450 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 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-25 18:24:39,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:24:43,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:24:43,710 INFO L93 Difference]: Finished difference Result 9126 states and 14313 transitions. [2022-11-25 18:24:43,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 18:24:43,711 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 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 55 [2022-11-25 18:24:43,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:24:43,743 INFO L225 Difference]: With dead ends: 9126 [2022-11-25 18:24:43,743 INFO L226 Difference]: Without dead ends: 9122 [2022-11-25 18:24:43,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-11-25 18:24:43,750 INFO L413 NwaCegarLoop]: 975 mSDtfsCounter, 1708 mSDsluCounter, 1641 mSDsCounter, 0 mSdLazyCounter, 1436 mSolverCounterSat, 487 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1765 SdHoareTripleChecker+Valid, 2616 SdHoareTripleChecker+Invalid, 1924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 487 IncrementalHoareTripleChecker+Valid, 1436 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:24:43,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1765 Valid, 2616 Invalid, 1924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [487 Valid, 1436 Invalid, 1 Unknown, 0 Unchecked, 7.1s Time] [2022-11-25 18:24:43,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9122 states. [2022-11-25 18:24:44,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9122 to 6807. [2022-11-25 18:24:44,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6807 states, 5780 states have (on average 1.479757785467128) internal successors, (8553), 5982 states have internal predecessors, (8553), 750 states have call successors, (750), 230 states have call predecessors, (750), 276 states have return successors, (1164), 625 states have call predecessors, (1164), 737 states have call successors, (1164) [2022-11-25 18:24:44,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6807 states to 6807 states and 10467 transitions. [2022-11-25 18:24:44,712 INFO L78 Accepts]: Start accepts. Automaton has 6807 states and 10467 transitions. Word has length 55 [2022-11-25 18:24:44,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:24:44,713 INFO L495 AbstractCegarLoop]: Abstraction has 6807 states and 10467 transitions. [2022-11-25 18:24:44,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 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-25 18:24:44,713 INFO L276 IsEmpty]: Start isEmpty. Operand 6807 states and 10467 transitions. [2022-11-25 18:24:44,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-25 18:24:44,715 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:24:44,715 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-25 18:24:44,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-25 18:24:44,716 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:24:44,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:24:44,716 INFO L85 PathProgramCache]: Analyzing trace with hash 499282675, now seen corresponding path program 1 times [2022-11-25 18:24:44,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:24:44,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972972747] [2022-11-25 18:24:44,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:24:44,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:24:44,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:45,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:24:45,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:45,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:24:45,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:45,266 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-25 18:24:45,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:24:45,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972972747] [2022-11-25 18:24:45,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972972747] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:24:45,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:24:45,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 18:24:45,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435278806] [2022-11-25 18:24:45,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:24:45,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 18:24:45,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:24:45,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 18:24:45,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-25 18:24:45,270 INFO L87 Difference]: Start difference. First operand 6807 states and 10467 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 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-25 18:24:51,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:24:53,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:24:53,071 INFO L93 Difference]: Finished difference Result 7650 states and 11920 transitions. [2022-11-25 18:24:53,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 18:24:53,072 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 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 55 [2022-11-25 18:24:53,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:24:53,094 INFO L225 Difference]: With dead ends: 7650 [2022-11-25 18:24:53,094 INFO L226 Difference]: Without dead ends: 7607 [2022-11-25 18:24:53,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-11-25 18:24:53,098 INFO L413 NwaCegarLoop]: 609 mSDtfsCounter, 423 mSDsluCounter, 2955 mSDsCounter, 0 mSdLazyCounter, 1539 mSolverCounterSat, 179 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 3564 SdHoareTripleChecker+Invalid, 1719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 1539 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-11-25 18:24:53,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 3564 Invalid, 1719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 1539 Invalid, 1 Unknown, 0 Unchecked, 6.5s Time] [2022-11-25 18:24:53,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7607 states. [2022-11-25 18:24:53,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7607 to 6777. [2022-11-25 18:24:53,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6777 states, 5751 states have (on average 1.480264301860546) internal successors, (8513), 5953 states have internal predecessors, (8513), 749 states have call successors, (749), 230 states have call predecessors, (749), 276 states have return successors, (1162), 624 states have call predecessors, (1162), 736 states have call successors, (1162) [2022-11-25 18:24:53,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6777 states to 6777 states and 10424 transitions. [2022-11-25 18:24:53,896 INFO L78 Accepts]: Start accepts. Automaton has 6777 states and 10424 transitions. Word has length 55 [2022-11-25 18:24:53,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:24:53,896 INFO L495 AbstractCegarLoop]: Abstraction has 6777 states and 10424 transitions. [2022-11-25 18:24:53,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 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-25 18:24:53,897 INFO L276 IsEmpty]: Start isEmpty. Operand 6777 states and 10424 transitions. [2022-11-25 18:24:53,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-25 18:24:53,899 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:24:53,899 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-25 18:24:53,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-25 18:24:53,900 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:24:53,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:24:53,900 INFO L85 PathProgramCache]: Analyzing trace with hash 948026652, now seen corresponding path program 1 times [2022-11-25 18:24:53,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:24:53,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587540742] [2022-11-25 18:24:53,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:24:53,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:24:54,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:54,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:24:54,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:54,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:24:54,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:54,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 18:24:54,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:54,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:24:54,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:54,618 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-25 18:24:54,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:24:54,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587540742] [2022-11-25 18:24:54,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587540742] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:24:54,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:24:54,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-25 18:24:54,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170729242] [2022-11-25 18:24:54,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:24:54,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 18:24:54,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:24:54,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 18:24:54,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-25 18:24:54,622 INFO L87 Difference]: Start difference. First operand 6777 states and 10424 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 18:25:01,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:25:03,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:25:03,394 INFO L93 Difference]: Finished difference Result 13421 states and 21123 transitions. [2022-11-25 18:25:03,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:25:03,395 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 60 [2022-11-25 18:25:03,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:25:03,414 INFO L225 Difference]: With dead ends: 13421 [2022-11-25 18:25:03,415 INFO L226 Difference]: Without dead ends: 7857 [2022-11-25 18:25:03,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-11-25 18:25:03,429 INFO L413 NwaCegarLoop]: 558 mSDtfsCounter, 401 mSDsluCounter, 2420 mSDsCounter, 0 mSdLazyCounter, 1791 mSolverCounterSat, 208 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 2978 SdHoareTripleChecker+Invalid, 2000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 1791 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2022-11-25 18:25:03,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 2978 Invalid, 2000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 1791 Invalid, 1 Unknown, 0 Unchecked, 7.6s Time] [2022-11-25 18:25:03,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7857 states. [2022-11-25 18:25:04,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7857 to 6853. [2022-11-25 18:25:04,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6853 states, 5807 states have (on average 1.4756328568968486) internal successors, (8569), 6017 states have internal predecessors, (8569), 749 states have call successors, (749), 230 states have call predecessors, (749), 296 states have return successors, (1233), 636 states have call predecessors, (1233), 736 states have call successors, (1233) [2022-11-25 18:25:04,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6853 states to 6853 states and 10551 transitions. [2022-11-25 18:25:04,161 INFO L78 Accepts]: Start accepts. Automaton has 6853 states and 10551 transitions. Word has length 60 [2022-11-25 18:25:04,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:25:04,162 INFO L495 AbstractCegarLoop]: Abstraction has 6853 states and 10551 transitions. [2022-11-25 18:25:04,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 18:25:04,162 INFO L276 IsEmpty]: Start isEmpty. Operand 6853 states and 10551 transitions. [2022-11-25 18:25:04,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-25 18:25:04,165 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:25:04,165 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 18:25:04,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-25 18:25:04,166 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:25:04,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:25:04,166 INFO L85 PathProgramCache]: Analyzing trace with hash -749476623, now seen corresponding path program 1 times [2022-11-25 18:25:04,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:25:04,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109012212] [2022-11-25 18:25:04,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:25:04,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:25:04,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:25:04,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:25:04,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:25:04,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:25:04,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:25:04,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 18:25:04,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:25:04,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 18:25:04,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:25:05,049 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-25 18:25:05,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:25:05,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109012212] [2022-11-25 18:25:05,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109012212] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:25:05,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:25:05,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-25 18:25:05,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22048367] [2022-11-25 18:25:05,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:25:05,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 18:25:05,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:25:05,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 18:25:05,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-11-25 18:25:05,052 INFO L87 Difference]: Start difference. First operand 6853 states and 10551 transitions. Second operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 18:25:13,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:25:16,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:25:16,410 INFO L93 Difference]: Finished difference Result 7755 states and 12177 transitions. [2022-11-25 18:25:16,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 18:25:16,415 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 62 [2022-11-25 18:25:16,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:25:16,447 INFO L225 Difference]: With dead ends: 7755 [2022-11-25 18:25:16,447 INFO L226 Difference]: Without dead ends: 7741 [2022-11-25 18:25:16,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2022-11-25 18:25:16,455 INFO L413 NwaCegarLoop]: 524 mSDtfsCounter, 952 mSDsluCounter, 3500 mSDsCounter, 0 mSdLazyCounter, 3004 mSolverCounterSat, 426 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 976 SdHoareTripleChecker+Valid, 4024 SdHoareTripleChecker+Invalid, 3431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 426 IncrementalHoareTripleChecker+Valid, 3004 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:25:16,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [976 Valid, 4024 Invalid, 3431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [426 Valid, 3004 Invalid, 1 Unknown, 0 Unchecked, 10.0s Time] [2022-11-25 18:25:16,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7741 states. [2022-11-25 18:25:17,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7741 to 6855. [2022-11-25 18:25:17,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6855 states, 5808 states have (on average 1.475550964187328) internal successors, (8570), 6019 states have internal predecessors, (8570), 749 states have call successors, (749), 230 states have call predecessors, (749), 297 states have return successors, (1248), 636 states have call predecessors, (1248), 736 states have call successors, (1248) [2022-11-25 18:25:17,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6855 states to 6855 states and 10567 transitions. [2022-11-25 18:25:17,288 INFO L78 Accepts]: Start accepts. Automaton has 6855 states and 10567 transitions. Word has length 62 [2022-11-25 18:25:17,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:25:17,289 INFO L495 AbstractCegarLoop]: Abstraction has 6855 states and 10567 transitions. [2022-11-25 18:25:17,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 18:25:17,289 INFO L276 IsEmpty]: Start isEmpty. Operand 6855 states and 10567 transitions. [2022-11-25 18:25:17,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-25 18:25:17,292 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:25:17,292 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, 1, 1] [2022-11-25 18:25:17,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-25 18:25:17,293 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:25:17,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:25:17,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1416668636, now seen corresponding path program 1 times [2022-11-25 18:25:17,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:25:17,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682346115] [2022-11-25 18:25:17,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:25:17,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:25:17,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:25:17,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:25:17,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:25:17,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:25:17,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:25:17,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 18:25:17,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:25:17,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:25:17,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:25:17,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:25:17,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:25:17,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:25:17,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:25:17,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:25:17,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:25:17,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682346115] [2022-11-25 18:25:17,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682346115] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:25:17,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:25:17,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 18:25:17,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828543181] [2022-11-25 18:25:17,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:25:17,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 18:25:17,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:25:17,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 18:25:17,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:25:17,847 INFO L87 Difference]: Start difference. First operand 6855 states and 10567 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-25 18:25:23,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:25:25,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:25:28,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:25:31,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:25:31,745 INFO L93 Difference]: Finished difference Result 10875 states and 17003 transitions. [2022-11-25 18:25:31,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 18:25:31,746 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 65 [2022-11-25 18:25:31,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:25:31,777 INFO L225 Difference]: With dead ends: 10875 [2022-11-25 18:25:31,778 INFO L226 Difference]: Without dead ends: 7624 [2022-11-25 18:25:31,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2022-11-25 18:25:31,795 INFO L413 NwaCegarLoop]: 948 mSDtfsCounter, 965 mSDsluCounter, 1881 mSDsCounter, 0 mSdLazyCounter, 1901 mSolverCounterSat, 347 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1008 SdHoareTripleChecker+Valid, 2829 SdHoareTripleChecker+Invalid, 2250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 347 IncrementalHoareTripleChecker+Valid, 1901 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2022-11-25 18:25:31,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1008 Valid, 2829 Invalid, 2250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [347 Valid, 1901 Invalid, 2 Unknown, 0 Unchecked, 12.4s Time] [2022-11-25 18:25:31,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7624 states. [2022-11-25 18:25:32,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7624 to 6723. [2022-11-25 18:25:32,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6723 states, 5693 states have (on average 1.476725803618479) internal successors, (8407), 5908 states have internal predecessors, (8407), 738 states have call successors, (738), 227 states have call predecessors, (738), 291 states have return successors, (1189), 617 states have call predecessors, (1189), 717 states have call successors, (1189) [2022-11-25 18:25:32,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6723 states to 6723 states and 10334 transitions. [2022-11-25 18:25:32,696 INFO L78 Accepts]: Start accepts. Automaton has 6723 states and 10334 transitions. Word has length 65 [2022-11-25 18:25:32,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:25:32,696 INFO L495 AbstractCegarLoop]: Abstraction has 6723 states and 10334 transitions. [2022-11-25 18:25:32,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-25 18:25:32,696 INFO L276 IsEmpty]: Start isEmpty. Operand 6723 states and 10334 transitions. [2022-11-25 18:25:32,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-25 18:25:32,699 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:25:32,699 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, 1, 1, 1] [2022-11-25 18:25:32,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-25 18:25:32,699 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:25:32,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:25:32,700 INFO L85 PathProgramCache]: Analyzing trace with hash -340114262, now seen corresponding path program 1 times [2022-11-25 18:25:32,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:25:32,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841596207] [2022-11-25 18:25:32,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:25:32,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:25:32,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:25:32,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:25:32,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:25:33,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:25:33,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:25:33,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 18:25:33,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:25:33,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:25:33,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:25:33,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 18:25:33,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:25:33,196 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-25 18:25:33,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:25:33,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841596207] [2022-11-25 18:25:33,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841596207] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:25:33,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:25:33,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 18:25:33,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076970619] [2022-11-25 18:25:33,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:25:33,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:25:33,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:25:33,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:25:33,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:25:33,200 INFO L87 Difference]: Start difference. First operand 6723 states and 10334 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-25 18:25:38,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:25:40,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:25:40,389 INFO L93 Difference]: Finished difference Result 13105 states and 20530 transitions. [2022-11-25 18:25:40,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:25:40,390 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 66 [2022-11-25 18:25:40,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:25:40,421 INFO L225 Difference]: With dead ends: 13105 [2022-11-25 18:25:40,421 INFO L226 Difference]: Without dead ends: 7568 [2022-11-25 18:25:40,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-25 18:25:40,445 INFO L413 NwaCegarLoop]: 571 mSDtfsCounter, 466 mSDsluCounter, 1159 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 265 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 1730 SdHoareTripleChecker+Invalid, 1172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:25:40,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 1730 Invalid, 1172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 906 Invalid, 1 Unknown, 0 Unchecked, 6.0s Time] [2022-11-25 18:25:40,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7568 states. [2022-11-25 18:25:41,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7568 to 6629. [2022-11-25 18:25:41,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6629 states, 5601 states have (on average 1.4767005891805034) internal successors, (8271), 5826 states have internal predecessors, (8271), 744 states have call successors, (744), 227 states have call predecessors, (744), 283 states have return successors, (1184), 605 states have call predecessors, (1184), 723 states have call successors, (1184) [2022-11-25 18:25:41,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6629 states to 6629 states and 10199 transitions. [2022-11-25 18:25:41,315 INFO L78 Accepts]: Start accepts. Automaton has 6629 states and 10199 transitions. Word has length 66 [2022-11-25 18:25:41,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:25:41,316 INFO L495 AbstractCegarLoop]: Abstraction has 6629 states and 10199 transitions. [2022-11-25 18:25:41,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-25 18:25:41,316 INFO L276 IsEmpty]: Start isEmpty. Operand 6629 states and 10199 transitions. [2022-11-25 18:25:41,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-25 18:25:41,318 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:25:41,319 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, 1, 1] [2022-11-25 18:25:41,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-25 18:25:41,319 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:25:41,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:25:41,320 INFO L85 PathProgramCache]: Analyzing trace with hash 437037204, now seen corresponding path program 1 times [2022-11-25 18:25:41,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:25:41,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299195909] [2022-11-25 18:25:41,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:25:41,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:25:41,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:25:41,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:25:41,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:25:41,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:25:41,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:25:41,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-25 18:25:41,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:25:42,002 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-25 18:25:42,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:25:42,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299195909] [2022-11-25 18:25:42,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299195909] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:25:42,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:25:42,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-25 18:25:42,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706401605] [2022-11-25 18:25:42,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:25:42,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 18:25:42,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:25:42,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 18:25:42,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-11-25 18:25:42,005 INFO L87 Difference]: Start difference. First operand 6629 states and 10199 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 18:25:49,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:25:51,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:25:51,861 INFO L93 Difference]: Finished difference Result 7477 states and 11670 transitions. [2022-11-25 18:25:51,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 18:25:51,861 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 65 [2022-11-25 18:25:51,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:25:51,881 INFO L225 Difference]: With dead ends: 7477 [2022-11-25 18:25:51,881 INFO L226 Difference]: Without dead ends: 7459 [2022-11-25 18:25:51,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2022-11-25 18:25:51,885 INFO L413 NwaCegarLoop]: 531 mSDtfsCounter, 902 mSDsluCounter, 3120 mSDsCounter, 0 mSdLazyCounter, 2630 mSolverCounterSat, 331 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 926 SdHoareTripleChecker+Valid, 3651 SdHoareTripleChecker+Invalid, 2962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 331 IncrementalHoareTripleChecker+Valid, 2630 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2022-11-25 18:25:51,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [926 Valid, 3651 Invalid, 2962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [331 Valid, 2630 Invalid, 1 Unknown, 0 Unchecked, 8.4s Time] [2022-11-25 18:25:51,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7459 states. [2022-11-25 18:25:52,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7459 to 6625. [2022-11-25 18:25:52,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6625 states, 5598 states have (on average 1.476777420507324) internal successors, (8267), 5823 states have internal predecessors, (8267), 743 states have call successors, (743), 227 states have call predecessors, (743), 283 states have return successors, (1183), 604 states have call predecessors, (1183), 722 states have call successors, (1183) [2022-11-25 18:25:52,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6625 states to 6625 states and 10193 transitions. [2022-11-25 18:25:52,681 INFO L78 Accepts]: Start accepts. Automaton has 6625 states and 10193 transitions. Word has length 65 [2022-11-25 18:25:52,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:25:52,681 INFO L495 AbstractCegarLoop]: Abstraction has 6625 states and 10193 transitions. [2022-11-25 18:25:52,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 18:25:52,681 INFO L276 IsEmpty]: Start isEmpty. Operand 6625 states and 10193 transitions. [2022-11-25 18:25:52,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-25 18:25:52,684 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:25:52,684 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, 1, 1, 1, 1] [2022-11-25 18:25:52,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-25 18:25:52,684 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:25:52,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:25:52,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1869722635, now seen corresponding path program 1 times [2022-11-25 18:25:52,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:25:52,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029742480] [2022-11-25 18:25:52,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:25:52,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:25:52,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:25:52,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:25:52,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:25:52,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:25:52,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:25:53,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 18:25:53,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:25:53,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:25:53,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:25:53,129 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-25 18:25:53,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:25:53,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029742480] [2022-11-25 18:25:53,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029742480] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:25:53,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:25:53,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 18:25:53,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308660897] [2022-11-25 18:25:53,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:25:53,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 18:25:53,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:25:53,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 18:25:53,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:25:53,132 INFO L87 Difference]: Start difference. First operand 6625 states and 10193 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 18:25:59,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:26:01,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:26:01,377 INFO L93 Difference]: Finished difference Result 10441 states and 16350 transitions. [2022-11-25 18:26:01,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 18:26:01,378 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 67 [2022-11-25 18:26:01,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:26:01,406 INFO L225 Difference]: With dead ends: 10441 [2022-11-25 18:26:01,406 INFO L226 Difference]: Without dead ends: 7793 [2022-11-25 18:26:01,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-11-25 18:26:01,416 INFO L413 NwaCegarLoop]: 520 mSDtfsCounter, 954 mSDsluCounter, 1322 mSDsCounter, 0 mSdLazyCounter, 1288 mSolverCounterSat, 358 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 976 SdHoareTripleChecker+Valid, 1842 SdHoareTripleChecker+Invalid, 1647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 358 IncrementalHoareTripleChecker+Valid, 1288 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-11-25 18:26:01,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [976 Valid, 1842 Invalid, 1647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [358 Valid, 1288 Invalid, 1 Unknown, 0 Unchecked, 6.8s Time] [2022-11-25 18:26:01,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7793 states. [2022-11-25 18:26:02,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7793 to 6847. [2022-11-25 18:26:02,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6847 states, 5810 states have (on average 1.4731497418244406) internal successors, (8559), 6043 states have internal predecessors, (8559), 743 states have call successors, (743), 227 states have call predecessors, (743), 293 states have return successors, (1198), 606 states have call predecessors, (1198), 722 states have call successors, (1198) [2022-11-25 18:26:02,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6847 states to 6847 states and 10500 transitions. [2022-11-25 18:26:02,207 INFO L78 Accepts]: Start accepts. Automaton has 6847 states and 10500 transitions. Word has length 67 [2022-11-25 18:26:02,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:26:02,207 INFO L495 AbstractCegarLoop]: Abstraction has 6847 states and 10500 transitions. [2022-11-25 18:26:02,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 18:26:02,208 INFO L276 IsEmpty]: Start isEmpty. Operand 6847 states and 10500 transitions. [2022-11-25 18:26:02,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-25 18:26:02,209 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:26:02,209 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, 1, 1, 1, 1, 1, 1] [2022-11-25 18:26:02,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-25 18:26:02,210 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:26:02,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:26:02,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1466440038, now seen corresponding path program 1 times [2022-11-25 18:26:02,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:26:02,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979477142] [2022-11-25 18:26:02,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:26:02,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:26:02,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:02,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:26:02,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:02,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:26:02,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:02,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 18:26:02,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:02,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-25 18:26:02,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:02,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-25 18:26:02,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:02,726 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-25 18:26:02,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:26:02,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979477142] [2022-11-25 18:26:02,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979477142] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:26:02,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:26:02,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 18:26:02,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147139724] [2022-11-25 18:26:02,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:26:02,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 18:26:02,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:26:02,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 18:26:02,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:26:02,731 INFO L87 Difference]: Start difference. First operand 6847 states and 10500 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 4 states have internal predecessors, (57), 3 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-25 18:26:08,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:26:13,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:26:13,330 INFO L93 Difference]: Finished difference Result 9490 states and 14566 transitions. [2022-11-25 18:26:13,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-25 18:26:13,330 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 4 states have internal predecessors, (57), 3 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-11-25 18:26:13,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:26:13,344 INFO L225 Difference]: With dead ends: 9490 [2022-11-25 18:26:13,344 INFO L226 Difference]: Without dead ends: 5437 [2022-11-25 18:26:13,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2022-11-25 18:26:13,357 INFO L413 NwaCegarLoop]: 757 mSDtfsCounter, 2908 mSDsluCounter, 1946 mSDsCounter, 0 mSdLazyCounter, 2165 mSolverCounterSat, 796 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2967 SdHoareTripleChecker+Valid, 2703 SdHoareTripleChecker+Invalid, 2962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 796 IncrementalHoareTripleChecker+Valid, 2165 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:26:13,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2967 Valid, 2703 Invalid, 2962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [796 Valid, 2165 Invalid, 1 Unknown, 0 Unchecked, 9.1s Time] [2022-11-25 18:26:13,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5437 states. [2022-11-25 18:26:13,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5437 to 4456. [2022-11-25 18:26:13,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4456 states, 3785 states have (on average 1.4544253632760897) internal successors, (5505), 3908 states have internal predecessors, (5505), 466 states have call successors, (466), 162 states have call predecessors, (466), 204 states have return successors, (652), 401 states have call predecessors, (652), 449 states have call successors, (652) [2022-11-25 18:26:13,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4456 states to 4456 states and 6623 transitions. [2022-11-25 18:26:13,981 INFO L78 Accepts]: Start accepts. Automaton has 4456 states and 6623 transitions. Word has length 69 [2022-11-25 18:26:13,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:26:13,981 INFO L495 AbstractCegarLoop]: Abstraction has 4456 states and 6623 transitions. [2022-11-25 18:26:13,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 4 states have internal predecessors, (57), 3 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-25 18:26:13,982 INFO L276 IsEmpty]: Start isEmpty. Operand 4456 states and 6623 transitions. [2022-11-25 18:26:13,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-25 18:26:13,983 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:26:13,983 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, 1, 1, 1, 1, 1] [2022-11-25 18:26:13,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-25 18:26:13,984 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:26:13,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:26:13,984 INFO L85 PathProgramCache]: Analyzing trace with hash -677342089, now seen corresponding path program 1 times [2022-11-25 18:26:13,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:26:13,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824264883] [2022-11-25 18:26:13,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:26:13,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:26:14,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:14,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:26:14,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:14,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:26:14,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:14,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 18:26:14,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:14,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 18:26:14,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:14,376 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-25 18:26:14,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:26:14,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824264883] [2022-11-25 18:26:14,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824264883] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:26:14,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:26:14,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 18:26:14,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442354159] [2022-11-25 18:26:14,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:26:14,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 18:26:14,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:26:14,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 18:26:14,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:26:14,378 INFO L87 Difference]: Start difference. First operand 4456 states and 6623 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 18:26:20,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:26:22,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:26:24,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:26:24,649 INFO L93 Difference]: Finished difference Result 7882 states and 11879 transitions. [2022-11-25 18:26:24,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 18:26:24,650 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 68 [2022-11-25 18:26:24,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:26:24,673 INFO L225 Difference]: With dead ends: 7882 [2022-11-25 18:26:24,673 INFO L226 Difference]: Without dead ends: 5395 [2022-11-25 18:26:24,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-11-25 18:26:24,683 INFO L413 NwaCegarLoop]: 529 mSDtfsCounter, 837 mSDsluCounter, 1604 mSDsCounter, 0 mSdLazyCounter, 1694 mSolverCounterSat, 140 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 860 SdHoareTripleChecker+Valid, 2133 SdHoareTripleChecker+Invalid, 1836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 1694 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:26:24,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [860 Valid, 2133 Invalid, 1836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 1694 Invalid, 2 Unknown, 0 Unchecked, 9.1s Time] [2022-11-25 18:26:24,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5395 states. [2022-11-25 18:26:25,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5395 to 4432. [2022-11-25 18:26:25,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4432 states, 3761 states have (on average 1.4557298590800318) internal successors, (5475), 3884 states have internal predecessors, (5475), 466 states have call successors, (466), 162 states have call predecessors, (466), 204 states have return successors, (652), 401 states have call predecessors, (652), 449 states have call successors, (652) [2022-11-25 18:26:25,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4432 states to 4432 states and 6593 transitions. [2022-11-25 18:26:25,268 INFO L78 Accepts]: Start accepts. Automaton has 4432 states and 6593 transitions. Word has length 68 [2022-11-25 18:26:25,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:26:25,268 INFO L495 AbstractCegarLoop]: Abstraction has 4432 states and 6593 transitions. [2022-11-25 18:26:25,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 18:26:25,268 INFO L276 IsEmpty]: Start isEmpty. Operand 4432 states and 6593 transitions. [2022-11-25 18:26:25,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-25 18:26:25,271 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:26:25,271 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:26:25,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-25 18:26:25,271 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:26:25,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:26:25,272 INFO L85 PathProgramCache]: Analyzing trace with hash -554272668, now seen corresponding path program 1 times [2022-11-25 18:26:25,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:26:25,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666194839] [2022-11-25 18:26:25,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:26:25,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:26:25,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:25,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:26:25,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:25,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:26:25,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:25,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 18:26:25,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:25,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-25 18:26:25,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:25,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-25 18:26:25,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:25,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-25 18:26:25,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:25,731 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-25 18:26:25,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:26:25,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666194839] [2022-11-25 18:26:25,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666194839] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:26:25,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:26:25,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 18:26:25,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766234205] [2022-11-25 18:26:25,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:26:25,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 18:26:25,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:26:25,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 18:26:25,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:26:25,735 INFO L87 Difference]: Start difference. First operand 4432 states and 6593 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-25 18:26:31,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:26:33,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:26:33,874 INFO L93 Difference]: Finished difference Result 7928 states and 11993 transitions. [2022-11-25 18:26:33,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-25 18:26:33,874 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 71 [2022-11-25 18:26:33,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:26:33,892 INFO L225 Difference]: With dead ends: 7928 [2022-11-25 18:26:33,892 INFO L226 Difference]: Without dead ends: 5377 [2022-11-25 18:26:33,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2022-11-25 18:26:33,900 INFO L413 NwaCegarLoop]: 507 mSDtfsCounter, 1469 mSDsluCounter, 1585 mSDsCounter, 0 mSdLazyCounter, 1394 mSolverCounterSat, 539 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1479 SdHoareTripleChecker+Valid, 2092 SdHoareTripleChecker+Invalid, 1934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 539 IncrementalHoareTripleChecker+Valid, 1394 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-11-25 18:26:33,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1479 Valid, 2092 Invalid, 1934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [539 Valid, 1394 Invalid, 1 Unknown, 0 Unchecked, 6.7s Time] [2022-11-25 18:26:33,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5377 states. [2022-11-25 18:26:34,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5377 to 4423. [2022-11-25 18:26:34,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4423 states, 3755 states have (on average 1.4561917443408787) internal successors, (5468), 3877 states have internal predecessors, (5468), 464 states have call successors, (464), 161 states have call predecessors, (464), 203 states have return successors, (638), 399 states have call predecessors, (638), 447 states have call successors, (638) [2022-11-25 18:26:34,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4423 states to 4423 states and 6570 transitions. [2022-11-25 18:26:34,524 INFO L78 Accepts]: Start accepts. Automaton has 4423 states and 6570 transitions. Word has length 71 [2022-11-25 18:26:34,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:26:34,524 INFO L495 AbstractCegarLoop]: Abstraction has 4423 states and 6570 transitions. [2022-11-25 18:26:34,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-25 18:26:34,525 INFO L276 IsEmpty]: Start isEmpty. Operand 4423 states and 6570 transitions. [2022-11-25 18:26:34,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-25 18:26:34,526 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:26:34,527 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, 1, 1, 1, 1, 1] [2022-11-25 18:26:34,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-25 18:26:34,527 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:26:34,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:26:34,527 INFO L85 PathProgramCache]: Analyzing trace with hash 827121083, now seen corresponding path program 1 times [2022-11-25 18:26:34,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:26:34,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517487948] [2022-11-25 18:26:34,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:26:34,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:26:34,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:35,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:26:35,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:35,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:26:35,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:35,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-25 18:26:35,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:35,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-25 18:26:35,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:35,236 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-25 18:26:35,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:26:35,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517487948] [2022-11-25 18:26:35,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517487948] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:26:35,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:26:35,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-25 18:26:35,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269825027] [2022-11-25 18:26:35,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:26:35,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 18:26:35,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:26:35,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 18:26:35,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-25 18:26:35,239 INFO L87 Difference]: Start difference. First operand 4423 states and 6570 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (5), 5 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 18:26:41,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:26:44,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:26:44,151 INFO L93 Difference]: Finished difference Result 5300 states and 8024 transitions. [2022-11-25 18:26:44,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 18:26:44,152 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (5), 5 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 68 [2022-11-25 18:26:44,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:26:44,163 INFO L225 Difference]: With dead ends: 5300 [2022-11-25 18:26:44,163 INFO L226 Difference]: Without dead ends: 5280 [2022-11-25 18:26:44,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-11-25 18:26:44,166 INFO L413 NwaCegarLoop]: 533 mSDtfsCounter, 993 mSDsluCounter, 2337 mSDsCounter, 0 mSdLazyCounter, 1818 mSolverCounterSat, 419 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1016 SdHoareTripleChecker+Valid, 2870 SdHoareTripleChecker+Invalid, 2238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 419 IncrementalHoareTripleChecker+Valid, 1818 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2022-11-25 18:26:44,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1016 Valid, 2870 Invalid, 2238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [419 Valid, 1818 Invalid, 1 Unknown, 0 Unchecked, 7.7s Time] [2022-11-25 18:26:44,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5280 states. [2022-11-25 18:26:44,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5280 to 4422. [2022-11-25 18:26:44,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4422 states, 3755 states have (on average 1.455925432756325) internal successors, (5467), 3876 states have internal predecessors, (5467), 463 states have call successors, (463), 161 states have call predecessors, (463), 203 states have return successors, (637), 399 states have call predecessors, (637), 446 states have call successors, (637) [2022-11-25 18:26:44,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4422 states to 4422 states and 6567 transitions. [2022-11-25 18:26:44,730 INFO L78 Accepts]: Start accepts. Automaton has 4422 states and 6567 transitions. Word has length 68 [2022-11-25 18:26:44,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:26:44,730 INFO L495 AbstractCegarLoop]: Abstraction has 4422 states and 6567 transitions. [2022-11-25 18:26:44,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (5), 5 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 18:26:44,731 INFO L276 IsEmpty]: Start isEmpty. Operand 4422 states and 6567 transitions. [2022-11-25 18:26:44,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-25 18:26:44,732 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:26:44,733 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, 1, 1, 1, 1, 1, 1] [2022-11-25 18:26:44,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-25 18:26:44,733 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:26:44,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:26:44,734 INFO L85 PathProgramCache]: Analyzing trace with hash 463590116, now seen corresponding path program 1 times [2022-11-25 18:26:44,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:26:44,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982983272] [2022-11-25 18:26:44,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:26:44,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:26:44,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:45,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:26:45,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:45,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:26:45,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:45,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 18:26:45,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:45,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-25 18:26:45,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:45,671 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-25 18:26:45,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:26:45,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982983272] [2022-11-25 18:26:45,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982983272] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:26:45,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:26:45,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-25 18:26:45,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891686733] [2022-11-25 18:26:45,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:26:45,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 18:26:45,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:26:45,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 18:26:45,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-25 18:26:45,675 INFO L87 Difference]: Start difference. First operand 4422 states and 6567 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (5), 5 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-25 18:26:52,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:26:54,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:26:54,681 INFO L93 Difference]: Finished difference Result 5362 states and 8158 transitions. [2022-11-25 18:26:54,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 18:26:54,682 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (5), 5 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 69 [2022-11-25 18:26:54,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:26:54,695 INFO L225 Difference]: With dead ends: 5362 [2022-11-25 18:26:54,695 INFO L226 Difference]: Without dead ends: 5346 [2022-11-25 18:26:54,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2022-11-25 18:26:54,699 INFO L413 NwaCegarLoop]: 526 mSDtfsCounter, 998 mSDsluCounter, 2763 mSDsCounter, 0 mSdLazyCounter, 2228 mSolverCounterSat, 427 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1021 SdHoareTripleChecker+Valid, 3289 SdHoareTripleChecker+Invalid, 2656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 427 IncrementalHoareTripleChecker+Valid, 2228 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2022-11-25 18:26:54,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1021 Valid, 3289 Invalid, 2656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [427 Valid, 2228 Invalid, 1 Unknown, 0 Unchecked, 7.8s Time] [2022-11-25 18:26:54,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5346 states. [2022-11-25 18:26:55,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5346 to 4427. [2022-11-25 18:26:55,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4427 states, 3758 states have (on average 1.456093666844066) internal successors, (5472), 3880 states have internal predecessors, (5472), 465 states have call successors, (465), 161 states have call predecessors, (465), 203 states have return successors, (639), 400 states have call predecessors, (639), 448 states have call successors, (639) [2022-11-25 18:26:55,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4427 states to 4427 states and 6576 transitions. [2022-11-25 18:26:55,343 INFO L78 Accepts]: Start accepts. Automaton has 4427 states and 6576 transitions. Word has length 69 [2022-11-25 18:26:55,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:26:55,344 INFO L495 AbstractCegarLoop]: Abstraction has 4427 states and 6576 transitions. [2022-11-25 18:26:55,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (5), 5 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-25 18:26:55,344 INFO L276 IsEmpty]: Start isEmpty. Operand 4427 states and 6576 transitions. [2022-11-25 18:26:55,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-25 18:26:55,345 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:26:55,346 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, 1, 1, 1, 1, 1, 1] [2022-11-25 18:26:55,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-25 18:26:55,346 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:26:55,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:26:55,346 INFO L85 PathProgramCache]: Analyzing trace with hash -669900528, now seen corresponding path program 1 times [2022-11-25 18:26:55,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:26:55,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691253415] [2022-11-25 18:26:55,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:26:55,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:26:55,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:55,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:26:55,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:55,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:26:55,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:55,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 18:26:55,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:55,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:26:56,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:26:56,115 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-25 18:26:56,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:26:56,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691253415] [2022-11-25 18:26:56,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691253415] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:26:56,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:26:56,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 18:26:56,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199763590] [2022-11-25 18:26:56,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:26:56,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 18:26:56,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:26:56,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 18:26:56,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-25 18:26:56,117 INFO L87 Difference]: Start difference. First operand 4427 states and 6576 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 18:27:01,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:27:04,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:27:06,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:27:08,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:27:08,375 INFO L93 Difference]: Finished difference Result 9525 states and 14480 transitions. [2022-11-25 18:27:08,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:27:08,376 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 69 [2022-11-25 18:27:08,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:27:08,389 INFO L225 Difference]: With dead ends: 9525 [2022-11-25 18:27:08,389 INFO L226 Difference]: Without dead ends: 5473 [2022-11-25 18:27:08,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-11-25 18:27:08,399 INFO L413 NwaCegarLoop]: 567 mSDtfsCounter, 405 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 1453 mSolverCounterSat, 94 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 2523 SdHoareTripleChecker+Invalid, 1549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1453 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:27:08,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 2523 Invalid, 1549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1453 Invalid, 2 Unknown, 0 Unchecked, 11.1s Time] [2022-11-25 18:27:08,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5473 states. [2022-11-25 18:27:08,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5473 to 4455. [2022-11-25 18:27:08,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4455 states, 3786 states have (on average 1.4527205493924986) internal successors, (5500), 3908 states have internal predecessors, (5500), 465 states have call successors, (465), 161 states have call predecessors, (465), 203 states have return successors, (639), 400 states have call predecessors, (639), 448 states have call successors, (639) [2022-11-25 18:27:08,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4455 states to 4455 states and 6604 transitions. [2022-11-25 18:27:08,981 INFO L78 Accepts]: Start accepts. Automaton has 4455 states and 6604 transitions. Word has length 69 [2022-11-25 18:27:08,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:27:08,982 INFO L495 AbstractCegarLoop]: Abstraction has 4455 states and 6604 transitions. [2022-11-25 18:27:08,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 18:27:08,982 INFO L276 IsEmpty]: Start isEmpty. Operand 4455 states and 6604 transitions. [2022-11-25 18:27:08,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-25 18:27:08,986 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:27:08,986 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, 1, 1, 1, 1, 1, 1] [2022-11-25 18:27:08,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-11-25 18:27:08,987 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:27:08,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:27:08,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1685614928, now seen corresponding path program 1 times [2022-11-25 18:27:08,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:27:08,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379925911] [2022-11-25 18:27:08,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:27:08,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:27:09,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:27:09,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:27:09,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:27:09,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:27:09,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:27:09,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 18:27:09,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:27:09,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:27:09,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:27:09,911 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-25 18:27:09,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:27:09,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379925911] [2022-11-25 18:27:09,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379925911] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:27:09,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:27:09,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-25 18:27:09,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016863377] [2022-11-25 18:27:09,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:27:09,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 18:27:09,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:27:09,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 18:27:09,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-25 18:27:09,913 INFO L87 Difference]: Start difference. First operand 4455 states and 6604 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 18:27:15,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:27:17,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:27:17,855 INFO L93 Difference]: Finished difference Result 9445 states and 14286 transitions. [2022-11-25 18:27:17,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 18:27:17,856 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 69 [2022-11-25 18:27:17,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:27:17,866 INFO L225 Difference]: With dead ends: 9445 [2022-11-25 18:27:17,866 INFO L226 Difference]: Without dead ends: 5384 [2022-11-25 18:27:17,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-11-25 18:27:17,872 INFO L413 NwaCegarLoop]: 550 mSDtfsCounter, 570 mSDsluCounter, 2601 mSDsCounter, 0 mSdLazyCounter, 1678 mSolverCounterSat, 366 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 584 SdHoareTripleChecker+Valid, 3151 SdHoareTripleChecker+Invalid, 2045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 366 IncrementalHoareTripleChecker+Valid, 1678 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-11-25 18:27:17,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [584 Valid, 3151 Invalid, 2045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [366 Valid, 1678 Invalid, 1 Unknown, 0 Unchecked, 6.8s Time] [2022-11-25 18:27:17,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5384 states. [2022-11-25 18:27:18,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5384 to 4434. [2022-11-25 18:27:18,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4434 states, 3772 states have (on average 1.4544008483563096) internal successors, (5486), 3894 states have internal predecessors, (5486), 465 states have call successors, (465), 161 states have call predecessors, (465), 196 states have return successors, (594), 393 states have call predecessors, (594), 448 states have call successors, (594) [2022-11-25 18:27:18,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4434 states to 4434 states and 6545 transitions. [2022-11-25 18:27:18,340 INFO L78 Accepts]: Start accepts. Automaton has 4434 states and 6545 transitions. Word has length 69 [2022-11-25 18:27:18,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:27:18,341 INFO L495 AbstractCegarLoop]: Abstraction has 4434 states and 6545 transitions. [2022-11-25 18:27:18,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 18:27:18,341 INFO L276 IsEmpty]: Start isEmpty. Operand 4434 states and 6545 transitions. [2022-11-25 18:27:18,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-25 18:27:18,342 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:27:18,342 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:27:18,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-11-25 18:27:18,343 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:27:18,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:27:18,343 INFO L85 PathProgramCache]: Analyzing trace with hash 277949588, now seen corresponding path program 1 times [2022-11-25 18:27:18,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:27:18,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240260294] [2022-11-25 18:27:18,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:27:18,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:27:18,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:27:18,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:27:18,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:27:18,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:27:18,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:27:18,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 18:27:18,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:27:19,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:27:19,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:27:19,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 18:27:19,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:27: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-25 18:27:19,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:27:19,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240260294] [2022-11-25 18:27:19,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240260294] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:27:19,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:27:19,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-25 18:27:19,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479264370] [2022-11-25 18:27:19,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:27:19,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 18:27:19,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:27:19,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 18:27:19,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-11-25 18:27:19,161 INFO L87 Difference]: Start difference. First operand 4434 states and 6545 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (6), 6 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-25 18:27:28,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:27:30,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:27:33,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:27:33,626 INFO L93 Difference]: Finished difference Result 8059 states and 12189 transitions. [2022-11-25 18:27:33,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 18:27:33,627 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (6), 6 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2022-11-25 18:27:33,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:27:33,641 INFO L225 Difference]: With dead ends: 8059 [2022-11-25 18:27:33,641 INFO L226 Difference]: Without dead ends: 5579 [2022-11-25 18:27:33,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2022-11-25 18:27:33,648 INFO L413 NwaCegarLoop]: 527 mSDtfsCounter, 863 mSDsluCounter, 3644 mSDsCounter, 0 mSdLazyCounter, 3169 mSolverCounterSat, 244 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 886 SdHoareTripleChecker+Valid, 4171 SdHoareTripleChecker+Invalid, 3415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 3169 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:27:33,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [886 Valid, 4171 Invalid, 3415 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [244 Valid, 3169 Invalid, 2 Unknown, 0 Unchecked, 13.1s Time] [2022-11-25 18:27:33,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5579 states. [2022-11-25 18:27:34,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5579 to 4492. [2022-11-25 18:27:34,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4492 states, 3816 states have (on average 1.44916142557652) internal successors, (5530), 3940 states have internal predecessors, (5530), 465 states have call successors, (465), 161 states have call predecessors, (465), 210 states have return successors, (639), 405 states have call predecessors, (639), 448 states have call successors, (639) [2022-11-25 18:27:34,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4492 states to 4492 states and 6634 transitions. [2022-11-25 18:27:34,234 INFO L78 Accepts]: Start accepts. Automaton has 4492 states and 6634 transitions. Word has length 71 [2022-11-25 18:27:34,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:27:34,235 INFO L495 AbstractCegarLoop]: Abstraction has 4492 states and 6634 transitions. [2022-11-25 18:27:34,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (6), 6 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-25 18:27:34,235 INFO L276 IsEmpty]: Start isEmpty. Operand 4492 states and 6634 transitions. [2022-11-25 18:27:34,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-25 18:27:34,236 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:27:34,237 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, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:27:34,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-11-25 18:27:34,237 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:27:34,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:27:34,238 INFO L85 PathProgramCache]: Analyzing trace with hash 302497870, now seen corresponding path program 1 times [2022-11-25 18:27:34,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:27:34,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961125457] [2022-11-25 18:27:34,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:27:34,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:27:34,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:27:34,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:27:34,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:27:34,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:27:34,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:27:34,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 18:27:34,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:27:34,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 18:27:34,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:27:34,925 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-25 18:27:34,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:27:34,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961125457] [2022-11-25 18:27:34,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961125457] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:27:34,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:27:34,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-25 18:27:34,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399234362] [2022-11-25 18:27:34,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:27:34,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 18:27:34,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:27:34,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 18:27:34,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-25 18:27:34,929 INFO L87 Difference]: Start difference. First operand 4492 states and 6634 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 18:27:41,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:27:43,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:27:46,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:27:46,157 INFO L93 Difference]: Finished difference Result 9698 states and 14628 transitions. [2022-11-25 18:27:46,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:27:46,158 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 70 [2022-11-25 18:27:46,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:27:46,172 INFO L225 Difference]: With dead ends: 9698 [2022-11-25 18:27:46,172 INFO L226 Difference]: Without dead ends: 5600 [2022-11-25 18:27:46,181 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-11-25 18:27:46,181 INFO L413 NwaCegarLoop]: 543 mSDtfsCounter, 413 mSDsluCounter, 2316 mSDsCounter, 0 mSdLazyCounter, 1794 mSolverCounterSat, 125 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 2859 SdHoareTripleChecker+Invalid, 1921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 1794 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:27:46,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 2859 Invalid, 1921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 1794 Invalid, 2 Unknown, 0 Unchecked, 10.1s Time] [2022-11-25 18:27:46,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5600 states. [2022-11-25 18:27:46,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5600 to 4504. [2022-11-25 18:27:46,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4504 states, 3828 states have (on average 1.4477533960292581) internal successors, (5542), 3940 states have internal predecessors, (5542), 465 states have call successors, (465), 161 states have call predecessors, (465), 210 states have return successors, (639), 417 states have call predecessors, (639), 448 states have call successors, (639) [2022-11-25 18:27:46,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4504 states to 4504 states and 6646 transitions. [2022-11-25 18:27:46,734 INFO L78 Accepts]: Start accepts. Automaton has 4504 states and 6646 transitions. Word has length 70 [2022-11-25 18:27:46,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:27:46,734 INFO L495 AbstractCegarLoop]: Abstraction has 4504 states and 6646 transitions. [2022-11-25 18:27:46,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 18:27:46,734 INFO L276 IsEmpty]: Start isEmpty. Operand 4504 states and 6646 transitions. [2022-11-25 18:27:46,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-25 18:27:46,736 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:27:46,736 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, 1, 1, 1, 1, 1, 1] [2022-11-25 18:27:46,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-11-25 18:27:46,736 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:27:46,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:27:46,737 INFO L85 PathProgramCache]: Analyzing trace with hash 965591191, now seen corresponding path program 1 times [2022-11-25 18:27:46,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:27:46,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301124931] [2022-11-25 18:27:46,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:27:46,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:27:46,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:27:47,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:27:47,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:27:47,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:27:47,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:27:47,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-25 18:27:47,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:27:47,432 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-25 18:27:47,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:27:47,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301124931] [2022-11-25 18:27:47,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301124931] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:27:47,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:27:47,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-25 18:27:47,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776666185] [2022-11-25 18:27:47,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:27:47,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 18:27:47,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:27:47,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 18:27:47,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-11-25 18:27:47,435 INFO L87 Difference]: Start difference. First operand 4504 states and 6646 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 18:27:54,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:27:57,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:27:57,537 INFO L93 Difference]: Finished difference Result 5384 states and 8102 transitions. [2022-11-25 18:27:57,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 18:27:57,538 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 69 [2022-11-25 18:27:57,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:27:57,549 INFO L225 Difference]: With dead ends: 5384 [2022-11-25 18:27:57,549 INFO L226 Difference]: Without dead ends: 5362 [2022-11-25 18:27:57,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2022-11-25 18:27:57,551 INFO L413 NwaCegarLoop]: 527 mSDtfsCounter, 911 mSDsluCounter, 3519 mSDsCounter, 0 mSdLazyCounter, 2954 mSolverCounterSat, 324 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 935 SdHoareTripleChecker+Valid, 4046 SdHoareTripleChecker+Invalid, 3279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 324 IncrementalHoareTripleChecker+Valid, 2954 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2022-11-25 18:27:57,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [935 Valid, 4046 Invalid, 3279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [324 Valid, 2954 Invalid, 1 Unknown, 0 Unchecked, 8.7s Time] [2022-11-25 18:27:57,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5362 states. [2022-11-25 18:27:58,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5362 to 4499. [2022-11-25 18:27:58,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4499 states, 3824 states have (on average 1.4479602510460252) internal successors, (5537), 3936 states have internal predecessors, (5537), 464 states have call successors, (464), 161 states have call predecessors, (464), 210 states have return successors, (638), 416 states have call predecessors, (638), 447 states have call successors, (638) [2022-11-25 18:27:58,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4499 states to 4499 states and 6639 transitions. [2022-11-25 18:27:58,131 INFO L78 Accepts]: Start accepts. Automaton has 4499 states and 6639 transitions. Word has length 69 [2022-11-25 18:27:58,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:27:58,131 INFO L495 AbstractCegarLoop]: Abstraction has 4499 states and 6639 transitions. [2022-11-25 18:27:58,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 18:27:58,131 INFO L276 IsEmpty]: Start isEmpty. Operand 4499 states and 6639 transitions. [2022-11-25 18:27:58,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-25 18:27:58,133 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:27:58,133 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:27:58,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-11-25 18:27:58,134 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:27:58,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:27:58,134 INFO L85 PathProgramCache]: Analyzing trace with hash 2005419428, now seen corresponding path program 1 times [2022-11-25 18:27:58,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:27:58,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476107313] [2022-11-25 18:27:58,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:27:58,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:27:58,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:27:58,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:27:58,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:27:58,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:27:58,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:27:58,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-25 18:27:58,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:27:58,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:27:58,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:27:58,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 18:27:58,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:27:58,763 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:27:58,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:27:58,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476107313] [2022-11-25 18:27:58,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476107313] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:27:58,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:27:58,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 18:27:58,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428313932] [2022-11-25 18:27:58,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:27:58,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 18:27:58,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:27:58,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 18:27:58,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:27:58,766 INFO L87 Difference]: Start difference. First operand 4499 states and 6639 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-25 18:28:04,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:28:06,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:28:06,825 INFO L93 Difference]: Finished difference Result 9671 states and 14461 transitions. [2022-11-25 18:28:06,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 18:28:06,826 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2022-11-25 18:28:06,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:28:06,841 INFO L225 Difference]: With dead ends: 9671 [2022-11-25 18:28:06,841 INFO L226 Difference]: Without dead ends: 5575 [2022-11-25 18:28:06,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2022-11-25 18:28:06,851 INFO L413 NwaCegarLoop]: 519 mSDtfsCounter, 1016 mSDsluCounter, 1453 mSDsCounter, 0 mSdLazyCounter, 1370 mSolverCounterSat, 254 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1038 SdHoareTripleChecker+Valid, 1972 SdHoareTripleChecker+Invalid, 1625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 1370 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-11-25 18:28:06,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1038 Valid, 1972 Invalid, 1625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 1370 Invalid, 1 Unknown, 0 Unchecked, 6.6s Time] [2022-11-25 18:28:06,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5575 states. [2022-11-25 18:28:07,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5575 to 4515. [2022-11-25 18:28:07,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4515 states, 3840 states have (on average 1.44609375) internal successors, (5553), 3952 states have internal predecessors, (5553), 464 states have call successors, (464), 161 states have call predecessors, (464), 210 states have return successors, (638), 416 states have call predecessors, (638), 447 states have call successors, (638) [2022-11-25 18:28:07,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4515 states to 4515 states and 6655 transitions. [2022-11-25 18:28:07,503 INFO L78 Accepts]: Start accepts. Automaton has 4515 states and 6655 transitions. Word has length 71 [2022-11-25 18:28:07,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:28:07,503 INFO L495 AbstractCegarLoop]: Abstraction has 4515 states and 6655 transitions. [2022-11-25 18:28:07,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-25 18:28:07,503 INFO L276 IsEmpty]: Start isEmpty. Operand 4515 states and 6655 transitions. [2022-11-25 18:28:07,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-25 18:28:07,506 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:28:07,506 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, 1, 1, 1, 1, 1, 1] [2022-11-25 18:28:07,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-11-25 18:28:07,506 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:28:07,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:28:07,507 INFO L85 PathProgramCache]: Analyzing trace with hash 885604175, now seen corresponding path program 1 times [2022-11-25 18:28:07,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:28:07,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984023289] [2022-11-25 18:28:07,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:28:07,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:28:07,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:28:08,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:28:08,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:28:08,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:28:08,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:28:08,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-25 18:28:08,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:28:08,198 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-25 18:28:08,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:28:08,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984023289] [2022-11-25 18:28:08,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984023289] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:28:08,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:28:08,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-25 18:28:08,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232109376] [2022-11-25 18:28:08,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:28:08,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 18:28:08,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:28:08,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 18:28:08,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-11-25 18:28:08,200 INFO L87 Difference]: Start difference. First operand 4515 states and 6655 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 18:28:15,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:28:18,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:28:18,785 INFO L93 Difference]: Finished difference Result 5407 states and 8123 transitions. [2022-11-25 18:28:18,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 18:28:18,786 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 69 [2022-11-25 18:28:18,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:28:18,798 INFO L225 Difference]: With dead ends: 5407 [2022-11-25 18:28:18,798 INFO L226 Difference]: Without dead ends: 5386 [2022-11-25 18:28:18,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2022-11-25 18:28:18,801 INFO L413 NwaCegarLoop]: 522 mSDtfsCounter, 910 mSDsluCounter, 3479 mSDsCounter, 0 mSdLazyCounter, 2947 mSolverCounterSat, 318 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 934 SdHoareTripleChecker+Valid, 4001 SdHoareTripleChecker+Invalid, 3266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 318 IncrementalHoareTripleChecker+Valid, 2947 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:28:18,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [934 Valid, 4001 Invalid, 3266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [318 Valid, 2947 Invalid, 1 Unknown, 0 Unchecked, 9.1s Time] [2022-11-25 18:28:18,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5386 states. [2022-11-25 18:28:19,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5386 to 4511. [2022-11-25 18:28:19,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4511 states, 3837 states have (on average 1.4461819129528277) internal successors, (5549), 3949 states have internal predecessors, (5549), 463 states have call successors, (463), 161 states have call predecessors, (463), 210 states have return successors, (637), 415 states have call predecessors, (637), 446 states have call successors, (637) [2022-11-25 18:28:19,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4511 states to 4511 states and 6649 transitions. [2022-11-25 18:28:19,450 INFO L78 Accepts]: Start accepts. Automaton has 4511 states and 6649 transitions. Word has length 69 [2022-11-25 18:28:19,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:28:19,451 INFO L495 AbstractCegarLoop]: Abstraction has 4511 states and 6649 transitions. [2022-11-25 18:28:19,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 18:28:19,451 INFO L276 IsEmpty]: Start isEmpty. Operand 4511 states and 6649 transitions. [2022-11-25 18:28:19,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-25 18:28:19,452 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:28:19,452 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:28:19,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-11-25 18:28:19,453 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:28:19,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:28:19,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1081372361, now seen corresponding path program 1 times [2022-11-25 18:28:19,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:28:19,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992048890] [2022-11-25 18:28:19,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:28:19,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:28:19,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:28:19,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:28:19,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:28:19,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:28:19,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:28:19,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 18:28:19,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:28:19,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 18:28:19,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:28:19,891 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-25 18:28:19,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:28:19,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992048890] [2022-11-25 18:28:19,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992048890] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:28:19,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:28:19,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 18:28:19,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469278813] [2022-11-25 18:28:19,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:28:19,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 18:28:19,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:28:19,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 18:28:19,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:28:19,894 INFO L87 Difference]: Start difference. First operand 4511 states and 6649 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 18:28:27,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:28:29,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:28:31,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:28:31,819 INFO L93 Difference]: Finished difference Result 8174 states and 12226 transitions. [2022-11-25 18:28:31,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 18:28:31,820 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 71 [2022-11-25 18:28:31,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:28:31,833 INFO L225 Difference]: With dead ends: 8174 [2022-11-25 18:28:31,833 INFO L226 Difference]: Without dead ends: 5647 [2022-11-25 18:28:31,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-11-25 18:28:31,838 INFO L413 NwaCegarLoop]: 500 mSDtfsCounter, 856 mSDsluCounter, 1525 mSDsCounter, 0 mSdLazyCounter, 1650 mSolverCounterSat, 156 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 879 SdHoareTripleChecker+Valid, 2025 SdHoareTripleChecker+Invalid, 1808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 1650 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2022-11-25 18:28:31,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [879 Valid, 2025 Invalid, 1808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 1650 Invalid, 2 Unknown, 0 Unchecked, 10.5s Time] [2022-11-25 18:28:31,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5647 states. [2022-11-25 18:28:32,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5647 to 4571. [2022-11-25 18:28:32,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4571 states, 3897 states have (on average 1.4393122915062868) internal successors, (5609), 4009 states have internal predecessors, (5609), 463 states have call successors, (463), 161 states have call predecessors, (463), 210 states have return successors, (637), 415 states have call predecessors, (637), 446 states have call successors, (637) [2022-11-25 18:28:32,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4571 states to 4571 states and 6709 transitions. [2022-11-25 18:28:32,494 INFO L78 Accepts]: Start accepts. Automaton has 4571 states and 6709 transitions. Word has length 71 [2022-11-25 18:28:32,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:28:32,494 INFO L495 AbstractCegarLoop]: Abstraction has 4571 states and 6709 transitions. [2022-11-25 18:28:32,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 18:28:32,495 INFO L276 IsEmpty]: Start isEmpty. Operand 4571 states and 6709 transitions. [2022-11-25 18:28:32,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-25 18:28:32,497 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:28:32,497 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, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:28:32,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-11-25 18:28:32,497 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:28:32,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:28:32,498 INFO L85 PathProgramCache]: Analyzing trace with hash -100745951, now seen corresponding path program 1 times [2022-11-25 18:28:32,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:28:32,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268708289] [2022-11-25 18:28:32,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:28:32,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:28:32,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:28:32,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:28:32,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:28:33,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:28:33,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:28:33,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 18:28:33,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:28:33,110 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-25 18:28:33,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:28:33,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268708289] [2022-11-25 18:28:33,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268708289] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:28:33,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:28:33,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-25 18:28:33,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743453658] [2022-11-25 18:28:33,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:28:33,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 18:28:33,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:28:33,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 18:28:33,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-11-25 18:28:33,113 INFO L87 Difference]: Start difference. First operand 4571 states and 6709 transitions. Second operand has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 7 states have internal predecessors, (63), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 18:28:42,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:28:45,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:28:45,075 INFO L93 Difference]: Finished difference Result 5463 states and 8177 transitions. [2022-11-25 18:28:45,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 18:28:45,076 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 7 states have internal predecessors, (63), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 70 [2022-11-25 18:28:45,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:28:45,091 INFO L225 Difference]: With dead ends: 5463 [2022-11-25 18:28:45,091 INFO L226 Difference]: Without dead ends: 5442 [2022-11-25 18:28:45,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2022-11-25 18:28:45,095 INFO L413 NwaCegarLoop]: 516 mSDtfsCounter, 910 mSDsluCounter, 3440 mSDsCounter, 0 mSdLazyCounter, 2935 mSolverCounterSat, 315 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 934 SdHoareTripleChecker+Valid, 3956 SdHoareTripleChecker+Invalid, 3251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 315 IncrementalHoareTripleChecker+Valid, 2935 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2022-11-25 18:28:45,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [934 Valid, 3956 Invalid, 3251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [315 Valid, 2935 Invalid, 1 Unknown, 0 Unchecked, 10.5s Time] [2022-11-25 18:28:45,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5442 states. [2022-11-25 18:28:45,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5442 to 4567. [2022-11-25 18:28:45,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4567 states, 3894 states have (on average 1.4393939393939394) internal successors, (5605), 4006 states have internal predecessors, (5605), 462 states have call successors, (462), 161 states have call predecessors, (462), 210 states have return successors, (636), 414 states have call predecessors, (636), 445 states have call successors, (636) [2022-11-25 18:28:45,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4567 states to 4567 states and 6703 transitions. [2022-11-25 18:28:45,788 INFO L78 Accepts]: Start accepts. Automaton has 4567 states and 6703 transitions. Word has length 70 [2022-11-25 18:28:45,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:28:45,789 INFO L495 AbstractCegarLoop]: Abstraction has 4567 states and 6703 transitions. [2022-11-25 18:28:45,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 7 states have internal predecessors, (63), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 18:28:45,789 INFO L276 IsEmpty]: Start isEmpty. Operand 4567 states and 6703 transitions. [2022-11-25 18:28:45,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-11-25 18:28:45,791 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:28:45,791 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:28:45,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-11-25 18:28:45,791 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:28:45,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:28:45,792 INFO L85 PathProgramCache]: Analyzing trace with hash 2023695595, now seen corresponding path program 1 times [2022-11-25 18:28:45,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:28:45,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285571761] [2022-11-25 18:28:45,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:28:45,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:28:45,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:28:46,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:28:46,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:28:46,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:28:46,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:28:46,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-25 18:28:46,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:28:46,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:28:46,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:28:46,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 18:28:46,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:28:46,885 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:28:46,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:28:46,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285571761] [2022-11-25 18:28:46,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285571761] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:28:46,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:28:46,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 18:28:46,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946062674] [2022-11-25 18:28:46,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:28:46,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 18:28:46,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:28:46,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 18:28:46,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-25 18:28:46,893 INFO L87 Difference]: Start difference. First operand 4567 states and 6703 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-25 18:28:54,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:28:55,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:28:55,532 INFO L93 Difference]: Finished difference Result 5020 states and 7305 transitions. [2022-11-25 18:28:55,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 18:28:55,533 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 72 [2022-11-25 18:28:55,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:28:55,536 INFO L225 Difference]: With dead ends: 5020 [2022-11-25 18:28:55,536 INFO L226 Difference]: Without dead ends: 766 [2022-11-25 18:28:55,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2022-11-25 18:28:55,543 INFO L413 NwaCegarLoop]: 410 mSDtfsCounter, 590 mSDsluCounter, 1628 mSDsCounter, 0 mSdLazyCounter, 1549 mSolverCounterSat, 83 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 2038 SdHoareTripleChecker+Invalid, 1633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1549 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:28:55,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 2038 Invalid, 1633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1549 Invalid, 1 Unknown, 0 Unchecked, 8.1s Time] [2022-11-25 18:28:55,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2022-11-25 18:28:55,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 733. [2022-11-25 18:28:55,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 733 states, 624 states have (on average 1.3060897435897436) internal successors, (815), 636 states have internal predecessors, (815), 67 states have call successors, (67), 35 states have call predecessors, (67), 41 states have return successors, (84), 64 states have call predecessors, (84), 60 states have call successors, (84) [2022-11-25 18:28:55,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 966 transitions. [2022-11-25 18:28:55,642 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 966 transitions. Word has length 72 [2022-11-25 18:28:55,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:28:55,643 INFO L495 AbstractCegarLoop]: Abstraction has 733 states and 966 transitions. [2022-11-25 18:28:55,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-25 18:28:55,643 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 966 transitions. [2022-11-25 18:28:55,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-25 18:28:55,645 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:28:55,645 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:28:55,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-11-25 18:28:55,645 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:28:55,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:28:55,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1623584585, now seen corresponding path program 1 times [2022-11-25 18:28:55,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:28:55,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853198338] [2022-11-25 18:28:55,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:28:55,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:28:55,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:28:56,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:28:56,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:28:56,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:28:56,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:28:56,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 18:28:56,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:28:56,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:28:56,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:28:56,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:28:56,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:28:56,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-25 18:28:56,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:28:56,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 18:28:56,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:28:56,755 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 18:28:56,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:28:56,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853198338] [2022-11-25 18:28:56,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853198338] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:28:56,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:28:56,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-25 18:28:56,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539526841] [2022-11-25 18:28:56,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:28:56,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-25 18:28:56,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:28:56,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-25 18:28:56,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-11-25 18:28:56,759 INFO L87 Difference]: Start difference. First operand 733 states and 966 transitions. Second operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (8), 6 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-25 18:29:04,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:29:05,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:29:05,888 INFO L93 Difference]: Finished difference Result 777 states and 1025 transitions. [2022-11-25 18:29:05,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-25 18:29:05,889 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (8), 6 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) Word has length 75 [2022-11-25 18:29:05,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:29:05,891 INFO L225 Difference]: With dead ends: 777 [2022-11-25 18:29:05,891 INFO L226 Difference]: Without dead ends: 739 [2022-11-25 18:29:05,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2022-11-25 18:29:05,892 INFO L413 NwaCegarLoop]: 397 mSDtfsCounter, 453 mSDsluCounter, 3055 mSDsCounter, 0 mSdLazyCounter, 2490 mSolverCounterSat, 122 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 3452 SdHoareTripleChecker+Invalid, 2613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 2490 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2022-11-25 18:29:05,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 3452 Invalid, 2613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 2490 Invalid, 1 Unknown, 0 Unchecked, 8.7s Time] [2022-11-25 18:29:05,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2022-11-25 18:29:05,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 713. [2022-11-25 18:29:05,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 713 states, 610 states have (on average 1.3081967213114754) internal successors, (798), 622 states have internal predecessors, (798), 63 states have call successors, (63), 33 states have call predecessors, (63), 39 states have return successors, (80), 60 states have call predecessors, (80), 56 states have call successors, (80) [2022-11-25 18:29:05,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 941 transitions. [2022-11-25 18:29:05,985 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 941 transitions. Word has length 75 [2022-11-25 18:29:05,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:29:05,985 INFO L495 AbstractCegarLoop]: Abstraction has 713 states and 941 transitions. [2022-11-25 18:29:05,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (8), 6 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-25 18:29:05,985 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 941 transitions. [2022-11-25 18:29:05,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-25 18:29:05,987 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:29:05,987 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:29:05,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-11-25 18:29:05,987 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:29:05,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:29:05,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1736062830, now seen corresponding path program 1 times [2022-11-25 18:29:05,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:29:05,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70371458] [2022-11-25 18:29:05,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:29:05,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:29:06,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:06,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:29:06,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:06,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:29:06,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:06,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 18:29:06,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:06,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:29:06,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:06,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 18:29:06,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:06,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-25 18:29:06,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:06,871 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-25 18:29:06,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:29:06,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70371458] [2022-11-25 18:29:06,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70371458] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:29:06,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:29:06,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-25 18:29:06,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968709090] [2022-11-25 18:29:06,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:29:06,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 18:29:06,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:29:06,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 18:29:06,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-25 18:29:06,875 INFO L87 Difference]: Start difference. First operand 713 states and 941 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-25 18:29:12,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:29:13,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:29:13,297 INFO L93 Difference]: Finished difference Result 759 states and 1003 transitions. [2022-11-25 18:29:13,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 18:29:13,297 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 75 [2022-11-25 18:29:13,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:29:13,299 INFO L225 Difference]: With dead ends: 759 [2022-11-25 18:29:13,299 INFO L226 Difference]: Without dead ends: 713 [2022-11-25 18:29:13,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2022-11-25 18:29:13,300 INFO L413 NwaCegarLoop]: 400 mSDtfsCounter, 665 mSDsluCounter, 2088 mSDsCounter, 0 mSdLazyCounter, 1544 mSolverCounterSat, 220 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 2488 SdHoareTripleChecker+Invalid, 1765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 1544 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:29:13,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 2488 Invalid, 1765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 1544 Invalid, 1 Unknown, 0 Unchecked, 6.0s Time] [2022-11-25 18:29:13,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2022-11-25 18:29:13,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 691. [2022-11-25 18:29:13,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 592 states have (on average 1.3108108108108107) internal successors, (776), 604 states have internal predecessors, (776), 59 states have call successors, (59), 33 states have call predecessors, (59), 39 states have return successors, (76), 56 states have call predecessors, (76), 52 states have call successors, (76) [2022-11-25 18:29:13,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 911 transitions. [2022-11-25 18:29:13,379 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 911 transitions. Word has length 75 [2022-11-25 18:29:13,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:29:13,380 INFO L495 AbstractCegarLoop]: Abstraction has 691 states and 911 transitions. [2022-11-25 18:29:13,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-25 18:29:13,380 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 911 transitions. [2022-11-25 18:29:13,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-11-25 18:29:13,381 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:29:13,381 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:29:13,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-11-25 18:29:13,381 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:29:13,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:29:13,381 INFO L85 PathProgramCache]: Analyzing trace with hash -496016635, now seen corresponding path program 1 times [2022-11-25 18:29:13,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:29:13,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357356889] [2022-11-25 18:29:13,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:29:13,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:29:13,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:13,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:29:13,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:13,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:29:13,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:13,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 18:29:13,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:13,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-25 18:29:13,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:13,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-25 18:29:13,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:13,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:29:13,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:14,056 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-25 18:29:14,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:29:14,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357356889] [2022-11-25 18:29:14,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357356889] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:29:14,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:29:14,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-25 18:29:14,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731123985] [2022-11-25 18:29:14,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:29:14,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 18:29:14,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:29:14,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 18:29:14,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-11-25 18:29:14,058 INFO L87 Difference]: Start difference. First operand 691 states and 911 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 6 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-25 18:29:19,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:29:19,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:29:19,871 INFO L93 Difference]: Finished difference Result 979 states and 1303 transitions. [2022-11-25 18:29:19,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 18:29:19,872 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 6 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) Word has length 76 [2022-11-25 18:29:19,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:29:19,876 INFO L225 Difference]: With dead ends: 979 [2022-11-25 18:29:19,876 INFO L226 Difference]: Without dead ends: 634 [2022-11-25 18:29:19,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2022-11-25 18:29:19,878 INFO L413 NwaCegarLoop]: 370 mSDtfsCounter, 801 mSDsluCounter, 2349 mSDsCounter, 0 mSdLazyCounter, 1587 mSolverCounterSat, 207 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 807 SdHoareTripleChecker+Valid, 2719 SdHoareTripleChecker+Invalid, 1795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 1587 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-11-25 18:29:19,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [807 Valid, 2719 Invalid, 1795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 1587 Invalid, 1 Unknown, 0 Unchecked, 5.3s Time] [2022-11-25 18:29:19,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2022-11-25 18:29:19,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 613. [2022-11-25 18:29:19,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 521 states have (on average 1.2975047984644914) internal successors, (676), 531 states have internal predecessors, (676), 56 states have call successors, (56), 31 states have call predecessors, (56), 35 states have return successors, (72), 53 states have call predecessors, (72), 50 states have call successors, (72) [2022-11-25 18:29:19,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 804 transitions. [2022-11-25 18:29:19,954 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 804 transitions. Word has length 76 [2022-11-25 18:29:19,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:29:19,955 INFO L495 AbstractCegarLoop]: Abstraction has 613 states and 804 transitions. [2022-11-25 18:29:19,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 6 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-25 18:29:19,955 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 804 transitions. [2022-11-25 18:29:19,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-25 18:29:19,956 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:29:19,956 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:29:19,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-11-25 18:29:19,956 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:29:19,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:29:19,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1257721170, now seen corresponding path program 1 times [2022-11-25 18:29:19,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:29:19,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255042584] [2022-11-25 18:29:19,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:29:19,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:29:20,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:20,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:29:20,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:20,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:29:20,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:20,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 18:29:20,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:20,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:29:20,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:20,401 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-25 18:29:20,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:29:20,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255042584] [2022-11-25 18:29:20,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255042584] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:29:20,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:29:20,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 18:29:20,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347031152] [2022-11-25 18:29:20,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:29:20,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 18:29:20,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:29:20,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 18:29:20,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:29:20,404 INFO L87 Difference]: Start difference. First operand 613 states and 804 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 18:29:24,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:29:25,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:29:25,051 INFO L93 Difference]: Finished difference Result 680 states and 891 transitions. [2022-11-25 18:29:25,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 18:29:25,051 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 74 [2022-11-25 18:29:25,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:29:25,053 INFO L225 Difference]: With dead ends: 680 [2022-11-25 18:29:25,054 INFO L226 Difference]: Without dead ends: 655 [2022-11-25 18:29:25,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-11-25 18:29:25,055 INFO L413 NwaCegarLoop]: 369 mSDtfsCounter, 600 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 212 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 605 SdHoareTripleChecker+Valid, 1288 SdHoareTripleChecker+Invalid, 1017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-11-25 18:29:25,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [605 Valid, 1288 Invalid, 1017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 804 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2022-11-25 18:29:25,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2022-11-25 18:29:25,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 613. [2022-11-25 18:29:25,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 521 states have (on average 1.3032629558541267) internal successors, (679), 531 states have internal predecessors, (679), 56 states have call successors, (56), 31 states have call predecessors, (56), 35 states have return successors, (72), 53 states have call predecessors, (72), 50 states have call successors, (72) [2022-11-25 18:29:25,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 807 transitions. [2022-11-25 18:29:25,150 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 807 transitions. Word has length 74 [2022-11-25 18:29:25,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:29:25,151 INFO L495 AbstractCegarLoop]: Abstraction has 613 states and 807 transitions. [2022-11-25 18:29:25,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 18:29:25,151 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 807 transitions. [2022-11-25 18:29:25,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-25 18:29:25,153 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:29:25,153 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:29:25,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-11-25 18:29:25,153 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:29:25,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:29:25,154 INFO L85 PathProgramCache]: Analyzing trace with hash -280765008, now seen corresponding path program 1 times [2022-11-25 18:29:25,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:29:25,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857057753] [2022-11-25 18:29:25,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:29:25,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:29:25,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:25,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:29:25,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:25,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:29:25,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:25,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 18:29:25,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:25,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-25 18:29:25,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:25,987 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-25 18:29:25,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:29:25,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857057753] [2022-11-25 18:29:25,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857057753] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:29:25,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:29:25,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-25 18:29:25,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031949617] [2022-11-25 18:29:25,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:29:25,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 18:29:25,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:29:25,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 18:29:25,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-11-25 18:29:25,990 INFO L87 Difference]: Start difference. First operand 613 states and 807 transitions. Second operand has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 18:29:31,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:29:33,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:29:34,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:29:34,674 INFO L93 Difference]: Finished difference Result 648 states and 853 transitions. [2022-11-25 18:29:34,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 18:29:34,675 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 74 [2022-11-25 18:29:34,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:29:34,677 INFO L225 Difference]: With dead ends: 648 [2022-11-25 18:29:34,677 INFO L226 Difference]: Without dead ends: 628 [2022-11-25 18:29:34,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2022-11-25 18:29:34,678 INFO L413 NwaCegarLoop]: 379 mSDtfsCounter, 436 mSDsluCounter, 2788 mSDsCounter, 0 mSdLazyCounter, 2184 mSolverCounterSat, 64 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 3167 SdHoareTripleChecker+Invalid, 2250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 2184 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2022-11-25 18:29:34,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 3167 Invalid, 2250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 2184 Invalid, 2 Unknown, 0 Unchecked, 8.3s Time] [2022-11-25 18:29:34,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2022-11-25 18:29:34,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 606. [2022-11-25 18:29:34,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 516 states have (on average 1.302325581395349) internal successors, (672), 526 states have internal predecessors, (672), 55 states have call successors, (55), 31 states have call predecessors, (55), 34 states have return successors, (70), 51 states have call predecessors, (70), 49 states have call successors, (70) [2022-11-25 18:29:34,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 797 transitions. [2022-11-25 18:29:34,757 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 797 transitions. Word has length 74 [2022-11-25 18:29:34,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:29:34,757 INFO L495 AbstractCegarLoop]: Abstraction has 606 states and 797 transitions. [2022-11-25 18:29:34,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 18:29:34,758 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 797 transitions. [2022-11-25 18:29:34,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-25 18:29:34,759 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:29:34,759 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:29:34,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-11-25 18:29:34,759 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:29:34,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:29:34,759 INFO L85 PathProgramCache]: Analyzing trace with hash 480971669, now seen corresponding path program 1 times [2022-11-25 18:29:34,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:29:34,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409572589] [2022-11-25 18:29:34,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:29:34,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:29:34,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:34,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:29:34,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:35,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:29:35,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:35,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 18:29:35,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:35,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:29:35,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:35,174 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-25 18:29:35,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:29:35,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409572589] [2022-11-25 18:29:35,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409572589] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:29:35,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:29:35,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 18:29:35,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601273641] [2022-11-25 18:29:35,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:29:35,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 18:29:35,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:29:35,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 18:29:35,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:29:35,177 INFO L87 Difference]: Start difference. First operand 606 states and 797 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 18:29:39,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:29:39,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:29:39,691 INFO L93 Difference]: Finished difference Result 670 states and 878 transitions. [2022-11-25 18:29:39,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:29:39,691 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 74 [2022-11-25 18:29:39,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:29:39,693 INFO L225 Difference]: With dead ends: 670 [2022-11-25 18:29:39,693 INFO L226 Difference]: Without dead ends: 645 [2022-11-25 18:29:39,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-11-25 18:29:39,694 INFO L413 NwaCegarLoop]: 371 mSDtfsCounter, 541 mSDsluCounter, 929 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 159 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 1300 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:29:39,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 1300 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 817 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2022-11-25 18:29:39,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2022-11-25 18:29:39,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 606. [2022-11-25 18:29:39,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 516 states have (on average 1.302325581395349) internal successors, (672), 526 states have internal predecessors, (672), 55 states have call successors, (55), 31 states have call predecessors, (55), 34 states have return successors, (70), 51 states have call predecessors, (70), 49 states have call successors, (70) [2022-11-25 18:29:39,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 797 transitions. [2022-11-25 18:29:39,811 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 797 transitions. Word has length 74 [2022-11-25 18:29:39,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:29:39,811 INFO L495 AbstractCegarLoop]: Abstraction has 606 states and 797 transitions. [2022-11-25 18:29:39,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 18:29:39,812 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 797 transitions. [2022-11-25 18:29:39,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-25 18:29:39,813 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:29:39,813 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:29:39,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-11-25 18:29:39,814 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:29:39,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:29:39,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1282723427, now seen corresponding path program 1 times [2022-11-25 18:29:39,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:29:39,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713590330] [2022-11-25 18:29:39,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:29:39,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:29:39,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:40,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:29:40,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:40,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:29:40,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:40,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 18:29:40,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:40,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:29:40,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:40,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-25 18:29:40,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:40,496 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-25 18:29:40,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:29:40,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713590330] [2022-11-25 18:29:40,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713590330] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:29:40,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:29:40,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-25 18:29:40,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094041904] [2022-11-25 18:29:40,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:29:40,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 18:29:40,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:29:40,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 18:29:40,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-11-25 18:29:40,499 INFO L87 Difference]: Start difference. First operand 606 states and 797 transitions. Second operand has 11 states, 11 states have (on average 6.0) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-25 18:29:46,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:29:48,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:29:48,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:29:48,773 INFO L93 Difference]: Finished difference Result 651 states and 854 transitions. [2022-11-25 18:29:48,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 18:29:48,774 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 77 [2022-11-25 18:29:48,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:29:48,776 INFO L225 Difference]: With dead ends: 651 [2022-11-25 18:29:48,776 INFO L226 Difference]: Without dead ends: 567 [2022-11-25 18:29:48,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2022-11-25 18:29:48,777 INFO L413 NwaCegarLoop]: 352 mSDtfsCounter, 468 mSDsluCounter, 2023 mSDsCounter, 0 mSdLazyCounter, 1726 mSolverCounterSat, 71 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 2375 SdHoareTripleChecker+Invalid, 1799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1726 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2022-11-25 18:29:48,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 2375 Invalid, 1799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1726 Invalid, 2 Unknown, 0 Unchecked, 7.9s Time] [2022-11-25 18:29:48,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2022-11-25 18:29:48,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 545. [2022-11-25 18:29:48,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 456 states have (on average 1.2478070175438596) internal successors, (569), 468 states have internal predecessors, (569), 54 states have call successors, (54), 31 states have call predecessors, (54), 34 states have return successors, (67), 48 states have call predecessors, (67), 48 states have call successors, (67) [2022-11-25 18:29:48,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 690 transitions. [2022-11-25 18:29:48,851 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 690 transitions. Word has length 77 [2022-11-25 18:29:48,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:29:48,851 INFO L495 AbstractCegarLoop]: Abstraction has 545 states and 690 transitions. [2022-11-25 18:29:48,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-25 18:29:48,851 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 690 transitions. [2022-11-25 18:29:48,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-11-25 18:29:48,852 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:29:48,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, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 18:29:48,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-11-25 18:29:48,853 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:29:48,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:29:48,853 INFO L85 PathProgramCache]: Analyzing trace with hash 947563230, now seen corresponding path program 1 times [2022-11-25 18:29:48,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:29:48,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448529991] [2022-11-25 18:29:48,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:29:48,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:29:48,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:49,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:29:49,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:49,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:29:49,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:49,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 18:29:49,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:49,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-25 18:29:49,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:49,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-25 18:29:49,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:49,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:29:49,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:49,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:29:49,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:49,460 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-25 18:29:49,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:29:49,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448529991] [2022-11-25 18:29:49,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448529991] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:29:49,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:29:49,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-25 18:29:49,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102923823] [2022-11-25 18:29:49,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:29:49,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 18:29:49,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:29:49,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 18:29:49,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-25 18:29:49,464 INFO L87 Difference]: Start difference. First operand 545 states and 690 transitions. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (9), 7 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-25 18:29:53,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:29:54,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:29:54,451 INFO L93 Difference]: Finished difference Result 832 states and 1076 transitions. [2022-11-25 18:29:54,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 18:29:54,452 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (9), 7 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 80 [2022-11-25 18:29:54,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:29:54,457 INFO L225 Difference]: With dead ends: 832 [2022-11-25 18:29:54,457 INFO L226 Difference]: Without dead ends: 565 [2022-11-25 18:29:54,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=125, Invalid=381, Unknown=0, NotChecked=0, Total=506 [2022-11-25 18:29:54,458 INFO L413 NwaCegarLoop]: 297 mSDtfsCounter, 833 mSDsluCounter, 1331 mSDsCounter, 0 mSdLazyCounter, 1107 mSolverCounterSat, 193 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 1628 SdHoareTripleChecker+Invalid, 1301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 1107 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-11-25 18:29:54,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [859 Valid, 1628 Invalid, 1301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 1107 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2022-11-25 18:29:54,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2022-11-25 18:29:54,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 545. [2022-11-25 18:29:54,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 456 states have (on average 1.2456140350877194) internal successors, (568), 468 states have internal predecessors, (568), 54 states have call successors, (54), 31 states have call predecessors, (54), 34 states have return successors, (67), 48 states have call predecessors, (67), 48 states have call successors, (67) [2022-11-25 18:29:54,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 689 transitions. [2022-11-25 18:29:54,535 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 689 transitions. Word has length 80 [2022-11-25 18:29:54,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:29:54,535 INFO L495 AbstractCegarLoop]: Abstraction has 545 states and 689 transitions. [2022-11-25 18:29:54,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (9), 7 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-25 18:29:54,535 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 689 transitions. [2022-11-25 18:29:54,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-11-25 18:29:54,536 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:29:54,537 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:29:54,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-11-25 18:29:54,537 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:29:54,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:29:54,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1912417017, now seen corresponding path program 1 times [2022-11-25 18:29:54,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:29:54,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044820072] [2022-11-25 18:29:54,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:29:54,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:29:54,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:54,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:29:54,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:54,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:29:54,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:54,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 18:29:54,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:54,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-25 18:29:54,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:54,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-25 18:29:54,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:54,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:29:54,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:54,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:29:54,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:54,926 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-25 18:29:54,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:29:54,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044820072] [2022-11-25 18:29:54,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044820072] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:29:54,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:29:54,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 18:29:54,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74728031] [2022-11-25 18:29:54,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:29:54,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 18:29:54,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:29:54,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 18:29:54,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-25 18:29:54,929 INFO L87 Difference]: Start difference. First operand 545 states and 689 transitions. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (9), 7 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-25 18:29:58,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:29:59,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:29:59,399 INFO L93 Difference]: Finished difference Result 844 states and 1091 transitions. [2022-11-25 18:29:59,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 18:29:59,400 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (9), 7 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 82 [2022-11-25 18:29:59,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:29:59,403 INFO L225 Difference]: With dead ends: 844 [2022-11-25 18:29:59,404 INFO L226 Difference]: Without dead ends: 577 [2022-11-25 18:29:59,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2022-11-25 18:29:59,405 INFO L413 NwaCegarLoop]: 305 mSDtfsCounter, 439 mSDsluCounter, 1176 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 147 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 1481 SdHoareTripleChecker+Invalid, 931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:29:59,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 1481 Invalid, 931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 783 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2022-11-25 18:29:59,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2022-11-25 18:29:59,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 548. [2022-11-25 18:29:59,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 459 states have (on average 1.2440087145969498) internal successors, (571), 471 states have internal predecessors, (571), 54 states have call successors, (54), 31 states have call predecessors, (54), 34 states have return successors, (67), 48 states have call predecessors, (67), 48 states have call successors, (67) [2022-11-25 18:29:59,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 692 transitions. [2022-11-25 18:29:59,512 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 692 transitions. Word has length 82 [2022-11-25 18:29:59,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:29:59,513 INFO L495 AbstractCegarLoop]: Abstraction has 548 states and 692 transitions. [2022-11-25 18:29:59,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (9), 7 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-25 18:29:59,513 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 692 transitions. [2022-11-25 18:29:59,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-11-25 18:29:59,515 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:29:59,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 18:29:59,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-11-25 18:29:59,516 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:29:59,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:29:59,516 INFO L85 PathProgramCache]: Analyzing trace with hash 900956810, now seen corresponding path program 1 times [2022-11-25 18:29:59,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:29:59,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18093132] [2022-11-25 18:29:59,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:29:59,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:29:59,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:59,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:29:59,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:59,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:29:59,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:29:59,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 18:29:59,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:00,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 18:30:00,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:00,133 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-25 18:30:00,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:30:00,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18093132] [2022-11-25 18:30:00,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18093132] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:30:00,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:30:00,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-25 18:30:00,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345052008] [2022-11-25 18:30:00,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:30:00,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 18:30:00,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:30:00,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 18:30:00,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-25 18:30:00,135 INFO L87 Difference]: Start difference. First operand 548 states and 692 transitions. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 18:30:04,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:30:06,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:30:07,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:30:07,116 INFO L93 Difference]: Finished difference Result 614 states and 775 transitions. [2022-11-25 18:30:07,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:30:07,117 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 79 [2022-11-25 18:30:07,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:30:07,119 INFO L225 Difference]: With dead ends: 614 [2022-11-25 18:30:07,119 INFO L226 Difference]: Without dead ends: 562 [2022-11-25 18:30:07,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-11-25 18:30:07,120 INFO L413 NwaCegarLoop]: 338 mSDtfsCounter, 186 mSDsluCounter, 1788 mSDsCounter, 0 mSdLazyCounter, 1134 mSolverCounterSat, 89 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 2126 SdHoareTripleChecker+Invalid, 1225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1134 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-11-25 18:30:07,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 2126 Invalid, 1225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1134 Invalid, 2 Unknown, 0 Unchecked, 6.8s Time] [2022-11-25 18:30:07,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2022-11-25 18:30:07,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 540. [2022-11-25 18:30:07,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 453 states have (on average 1.2428256070640176) internal successors, (563), 464 states have internal predecessors, (563), 53 states have call successors, (53), 31 states have call predecessors, (53), 33 states have return successors, (65), 47 states have call predecessors, (65), 47 states have call successors, (65) [2022-11-25 18:30:07,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 681 transitions. [2022-11-25 18:30:07,198 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 681 transitions. Word has length 79 [2022-11-25 18:30:07,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:30:07,199 INFO L495 AbstractCegarLoop]: Abstraction has 540 states and 681 transitions. [2022-11-25 18:30:07,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 18:30:07,199 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 681 transitions. [2022-11-25 18:30:07,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-25 18:30:07,200 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:30:07,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, 1, 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-25 18:30:07,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-11-25 18:30:07,200 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:30:07,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:30:07,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1500515065, now seen corresponding path program 1 times [2022-11-25 18:30:07,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:30:07,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273715998] [2022-11-25 18:30:07,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:30:07,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:30:07,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:07,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:30:07,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:07,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:30:07,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:07,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 18:30:07,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:07,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-25 18:30:07,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:07,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-25 18:30:07,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:07,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:30:07,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:07,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:30:07,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:07,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:30:07,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:30:07,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273715998] [2022-11-25 18:30:07,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273715998] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:30:07,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:30:07,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 18:30:07,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233121351] [2022-11-25 18:30:07,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:30:07,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 18:30:07,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:30:07,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 18:30:07,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-25 18:30:07,637 INFO L87 Difference]: Start difference. First operand 540 states and 681 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (9), 8 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-25 18:30:11,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:30:12,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:30:12,246 INFO L93 Difference]: Finished difference Result 965 states and 1237 transitions. [2022-11-25 18:30:12,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-25 18:30:12,246 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (9), 8 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 83 [2022-11-25 18:30:12,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:30:12,252 INFO L225 Difference]: With dead ends: 965 [2022-11-25 18:30:12,252 INFO L226 Difference]: Without dead ends: 701 [2022-11-25 18:30:12,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2022-11-25 18:30:12,253 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 925 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 311 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 934 SdHoareTripleChecker+Valid, 1338 SdHoareTripleChecker+Invalid, 1121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 311 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:30:12,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [934 Valid, 1338 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [311 Valid, 809 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2022-11-25 18:30:12,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2022-11-25 18:30:12,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 660. [2022-11-25 18:30:12,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 553 states have (on average 1.240506329113924) internal successors, (686), 566 states have internal predecessors, (686), 63 states have call successors, (63), 37 states have call predecessors, (63), 43 states have return successors, (85), 60 states have call predecessors, (85), 58 states have call successors, (85) [2022-11-25 18:30:12,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 834 transitions. [2022-11-25 18:30:12,339 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 834 transitions. Word has length 83 [2022-11-25 18:30:12,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:30:12,340 INFO L495 AbstractCegarLoop]: Abstraction has 660 states and 834 transitions. [2022-11-25 18:30:12,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (9), 8 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-25 18:30:12,340 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 834 transitions. [2022-11-25 18:30:12,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-11-25 18:30:12,341 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:30:12,341 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, 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-25 18:30:12,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-11-25 18:30:12,341 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:30:12,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:30:12,342 INFO L85 PathProgramCache]: Analyzing trace with hash 868554885, now seen corresponding path program 1 times [2022-11-25 18:30:12,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:30:12,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161051592] [2022-11-25 18:30:12,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:30:12,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:30:12,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:12,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:30:12,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:12,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:30:12,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:12,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-25 18:30:12,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:12,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-25 18:30:12,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:12,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-25 18:30:12,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:12,993 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-25 18:30:12,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:30:12,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161051592] [2022-11-25 18:30:12,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161051592] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:30:12,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:30:12,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-25 18:30:12,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844584962] [2022-11-25 18:30:12,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:30:12,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 18:30:12,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:30:12,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 18:30:12,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-11-25 18:30:12,998 INFO L87 Difference]: Start difference. First operand 660 states and 834 transitions. Second operand has 12 states, 12 states have (on average 6.25) internal successors, (75), 7 states have internal predecessors, (75), 3 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-25 18:30:17,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:30:18,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:30:18,717 INFO L93 Difference]: Finished difference Result 697 states and 883 transitions. [2022-11-25 18:30:18,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 18:30:18,717 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.25) internal successors, (75), 7 states have internal predecessors, (75), 3 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 86 [2022-11-25 18:30:18,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:30:18,719 INFO L225 Difference]: With dead ends: 697 [2022-11-25 18:30:18,719 INFO L226 Difference]: Without dead ends: 645 [2022-11-25 18:30:18,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2022-11-25 18:30:18,720 INFO L413 NwaCegarLoop]: 296 mSDtfsCounter, 446 mSDsluCounter, 1998 mSDsCounter, 0 mSdLazyCounter, 1620 mSolverCounterSat, 173 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 2294 SdHoareTripleChecker+Invalid, 1794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 1620 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-11-25 18:30:18,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 2294 Invalid, 1794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 1620 Invalid, 1 Unknown, 0 Unchecked, 5.3s Time] [2022-11-25 18:30:18,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2022-11-25 18:30:18,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 625. [2022-11-25 18:30:18,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 525 states have (on average 1.243809523809524) internal successors, (653), 538 states have internal predecessors, (653), 59 states have call successors, (59), 34 states have call predecessors, (59), 40 states have return successors, (81), 56 states have call predecessors, (81), 54 states have call successors, (81) [2022-11-25 18:30:18,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 793 transitions. [2022-11-25 18:30:18,814 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 793 transitions. Word has length 86 [2022-11-25 18:30:18,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:30:18,814 INFO L495 AbstractCegarLoop]: Abstraction has 625 states and 793 transitions. [2022-11-25 18:30:18,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.25) internal successors, (75), 7 states have internal predecessors, (75), 3 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-25 18:30:18,814 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 793 transitions. [2022-11-25 18:30:18,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-11-25 18:30:18,815 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:30:18,815 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 18:30:18,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-11-25 18:30:18,816 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:30:18,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:30:18,816 INFO L85 PathProgramCache]: Analyzing trace with hash 773093388, now seen corresponding path program 1 times [2022-11-25 18:30:18,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:30:18,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058323492] [2022-11-25 18:30:18,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:30:18,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:30:18,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:19,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:30:19,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:19,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:30:19,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:19,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-25 18:30:19,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:19,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-25 18:30:19,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:19,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-25 18:30:19,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:19,382 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-25 18:30:19,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:30:19,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058323492] [2022-11-25 18:30:19,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058323492] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:30:19,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:30:19,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-25 18:30:19,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761607477] [2022-11-25 18:30:19,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:30:19,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 18:30:19,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:30:19,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 18:30:19,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-25 18:30:19,385 INFO L87 Difference]: Start difference. First operand 625 states and 793 transitions. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-25 18:30:23,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:30:25,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:30:26,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:30:26,735 INFO L93 Difference]: Finished difference Result 1142 states and 1426 transitions. [2022-11-25 18:30:26,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 18:30:26,736 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 86 [2022-11-25 18:30:26,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:30:26,740 INFO L225 Difference]: With dead ends: 1142 [2022-11-25 18:30:26,740 INFO L226 Difference]: Without dead ends: 805 [2022-11-25 18:30:26,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2022-11-25 18:30:26,741 INFO L413 NwaCegarLoop]: 279 mSDtfsCounter, 1151 mSDsluCounter, 1415 mSDsCounter, 0 mSdLazyCounter, 1068 mSolverCounterSat, 271 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1170 SdHoareTripleChecker+Valid, 1694 SdHoareTripleChecker+Invalid, 1341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Valid, 1068 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-11-25 18:30:26,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1170 Valid, 1694 Invalid, 1341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [271 Valid, 1068 Invalid, 2 Unknown, 0 Unchecked, 6.7s Time] [2022-11-25 18:30:26,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2022-11-25 18:30:26,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 768. [2022-11-25 18:30:26,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 768 states, 648 states have (on average 1.2376543209876543) internal successors, (802), 663 states have internal predecessors, (802), 64 states have call successors, (64), 46 states have call predecessors, (64), 55 states have return successors, (85), 63 states have call predecessors, (85), 59 states have call successors, (85) [2022-11-25 18:30:26,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 951 transitions. [2022-11-25 18:30:26,856 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 951 transitions. Word has length 86 [2022-11-25 18:30:26,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:30:26,856 INFO L495 AbstractCegarLoop]: Abstraction has 768 states and 951 transitions. [2022-11-25 18:30:26,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-25 18:30:26,856 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 951 transitions. [2022-11-25 18:30:26,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-11-25 18:30:26,857 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:30:26,857 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 18:30:26,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-11-25 18:30:26,857 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:30:26,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:30:26,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1759913001, now seen corresponding path program 1 times [2022-11-25 18:30:26,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:30:26,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958491874] [2022-11-25 18:30:26,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:30:26,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:30:26,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:27,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:30:27,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:27,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:30:27,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:27,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-25 18:30:27,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:27,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-25 18:30:27,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:27,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-25 18:30:27,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:27,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:30:27,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:27,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:30:27,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:27,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-25 18:30:27,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:27,612 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-25 18:30:27,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:30:27,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958491874] [2022-11-25 18:30:27,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958491874] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:30:27,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:30:27,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-25 18:30:27,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894278794] [2022-11-25 18:30:27,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:30:27,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 18:30:27,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:30:27,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 18:30:27,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-11-25 18:30:27,614 INFO L87 Difference]: Start difference. First operand 768 states and 951 transitions. Second operand has 12 states, 12 states have (on average 6.5) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (10), 8 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-25 18:30:32,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:30:33,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:30:33,368 INFO L93 Difference]: Finished difference Result 1196 states and 1501 transitions. [2022-11-25 18:30:33,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-25 18:30:33,369 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (10), 8 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 96 [2022-11-25 18:30:33,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:30:33,373 INFO L225 Difference]: With dead ends: 1196 [2022-11-25 18:30:33,373 INFO L226 Difference]: Without dead ends: 789 [2022-11-25 18:30:33,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2022-11-25 18:30:33,374 INFO L413 NwaCegarLoop]: 274 mSDtfsCounter, 600 mSDsluCounter, 1639 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 215 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 1913 SdHoareTripleChecker+Invalid, 1398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:30:33,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 1913 Invalid, 1398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 1182 Invalid, 1 Unknown, 0 Unchecked, 5.2s Time] [2022-11-25 18:30:33,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2022-11-25 18:30:33,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 768. [2022-11-25 18:30:33,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 768 states, 648 states have (on average 1.2314814814814814) internal successors, (798), 663 states have internal predecessors, (798), 64 states have call successors, (64), 46 states have call predecessors, (64), 55 states have return successors, (85), 63 states have call predecessors, (85), 59 states have call successors, (85) [2022-11-25 18:30:33,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 947 transitions. [2022-11-25 18:30:33,478 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 947 transitions. Word has length 96 [2022-11-25 18:30:33,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:30:33,478 INFO L495 AbstractCegarLoop]: Abstraction has 768 states and 947 transitions. [2022-11-25 18:30:33,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (10), 8 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-25 18:30:33,478 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 947 transitions. [2022-11-25 18:30:33,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-11-25 18:30:33,479 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:30:33,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, 1, 1, 1, 1, 1, 1, 1, 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-25 18:30:33,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-11-25 18:30:33,479 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:30:33,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:30:33,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1920923923, now seen corresponding path program 1 times [2022-11-25 18:30:33,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:30:33,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755743142] [2022-11-25 18:30:33,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:30:33,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:30:33,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:34,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:30:34,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:34,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:30:34,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:34,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-25 18:30:34,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:34,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-25 18:30:34,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:34,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-25 18:30:34,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:34,233 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-25 18:30:34,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:30:34,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755743142] [2022-11-25 18:30:34,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755743142] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:30:34,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:30:34,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-25 18:30:34,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673104172] [2022-11-25 18:30:34,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:30:34,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-25 18:30:34,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:30:34,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-25 18:30:34,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-11-25 18:30:34,237 INFO L87 Difference]: Start difference. First operand 768 states and 947 transitions. Second operand has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 7 states have internal predecessors, (76), 2 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-25 18:30:39,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:30:41,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:30:43,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:30:43,468 INFO L93 Difference]: Finished difference Result 789 states and 977 transitions. [2022-11-25 18:30:43,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 18:30:43,469 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 7 states have internal predecessors, (76), 2 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 87 [2022-11-25 18:30:43,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:30:43,471 INFO L225 Difference]: With dead ends: 789 [2022-11-25 18:30:43,471 INFO L226 Difference]: Without dead ends: 710 [2022-11-25 18:30:43,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2022-11-25 18:30:43,472 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 467 mSDsluCounter, 1775 mSDsCounter, 0 mSdLazyCounter, 2123 mSolverCounterSat, 139 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 1993 SdHoareTripleChecker+Invalid, 2264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 2123 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2022-11-25 18:30:43,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 1993 Invalid, 2264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 2123 Invalid, 2 Unknown, 0 Unchecked, 8.7s Time] [2022-11-25 18:30:43,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2022-11-25 18:30:43,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 695. [2022-11-25 18:30:43,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 581 states have (on average 1.2306368330464716) internal successors, (715), 596 states have internal predecessors, (715), 61 states have call successors, (61), 43 states have call predecessors, (61), 52 states have return successors, (82), 60 states have call predecessors, (82), 56 states have call successors, (82) [2022-11-25 18:30:43,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 858 transitions. [2022-11-25 18:30:43,575 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 858 transitions. Word has length 87 [2022-11-25 18:30:43,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:30:43,576 INFO L495 AbstractCegarLoop]: Abstraction has 695 states and 858 transitions. [2022-11-25 18:30:43,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 7 states have internal predecessors, (76), 2 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-25 18:30:43,576 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 858 transitions. [2022-11-25 18:30:43,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-11-25 18:30:43,577 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:30:43,577 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, 1, 1, 1, 1, 1, 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-25 18:30:43,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-11-25 18:30:43,577 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:30:43,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:30:43,578 INFO L85 PathProgramCache]: Analyzing trace with hash 985884663, now seen corresponding path program 1 times [2022-11-25 18:30:43,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:30:43,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340917258] [2022-11-25 18:30:43,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:30:43,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:30:43,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:44,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:30:44,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:44,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:30:44,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:44,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 18:30:44,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:44,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-25 18:30:44,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:44,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-25 18:30:44,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:44,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:30:44,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:44,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:30:44,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:44,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-25 18:30:44,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:44,284 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-25 18:30:44,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:30:44,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340917258] [2022-11-25 18:30:44,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340917258] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:30:44,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:30:44,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-25 18:30:44,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048727131] [2022-11-25 18:30:44,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:30:44,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 18:30:44,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:30:44,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 18:30:44,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-11-25 18:30:44,287 INFO L87 Difference]: Start difference. First operand 695 states and 858 transitions. Second operand has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (10), 8 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-25 18:30:47,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:30:48,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:30:48,782 INFO L93 Difference]: Finished difference Result 1067 states and 1334 transitions. [2022-11-25 18:30:48,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 18:30:48,783 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (10), 8 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 92 [2022-11-25 18:30:48,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:30:48,786 INFO L225 Difference]: With dead ends: 1067 [2022-11-25 18:30:48,786 INFO L226 Difference]: Without dead ends: 710 [2022-11-25 18:30:48,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2022-11-25 18:30:48,787 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 432 mSDsluCounter, 1488 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 160 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 1735 SdHoareTripleChecker+Invalid, 1147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 986 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:30:48,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 1735 Invalid, 1147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 986 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2022-11-25 18:30:48,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2022-11-25 18:30:48,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 695. [2022-11-25 18:30:48,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 581 states have (on average 1.2289156626506024) internal successors, (714), 596 states have internal predecessors, (714), 61 states have call successors, (61), 43 states have call predecessors, (61), 52 states have return successors, (82), 60 states have call predecessors, (82), 56 states have call successors, (82) [2022-11-25 18:30:48,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 857 transitions. [2022-11-25 18:30:48,916 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 857 transitions. Word has length 92 [2022-11-25 18:30:48,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:30:48,916 INFO L495 AbstractCegarLoop]: Abstraction has 695 states and 857 transitions. [2022-11-25 18:30:48,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (10), 8 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-25 18:30:48,916 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 857 transitions. [2022-11-25 18:30:48,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-11-25 18:30:48,917 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:30:48,917 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 18:30:48,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-11-25 18:30:48,917 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:30:48,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:30:48,917 INFO L85 PathProgramCache]: Analyzing trace with hash -751551231, now seen corresponding path program 1 times [2022-11-25 18:30:48,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:30:48,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200886082] [2022-11-25 18:30:48,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:30:48,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:30:49,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:49,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:30:49,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:49,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:30:49,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:49,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-25 18:30:49,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:49,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-25 18:30:49,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:49,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-25 18:30:49,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:49,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:30:49,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:49,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:30:49,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:49,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-25 18:30:49,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:49,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-25 18:30:49,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:49,582 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-25 18:30:49,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:30:49,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200886082] [2022-11-25 18:30:49,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200886082] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:30:49,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:30:49,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-25 18:30:49,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651332153] [2022-11-25 18:30:49,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:30:49,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 18:30:49,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:30:49,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 18:30:49,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-11-25 18:30:49,585 INFO L87 Difference]: Start difference. First operand 695 states and 857 transitions. Second operand has 11 states, 11 states have (on average 7.818181818181818) internal successors, (86), 5 states have internal predecessors, (86), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-25 18:30:53,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:30:55,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:30:56,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:30:56,714 INFO L93 Difference]: Finished difference Result 1045 states and 1301 transitions. [2022-11-25 18:30:56,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-25 18:30:56,715 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.818181818181818) internal successors, (86), 5 states have internal predecessors, (86), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 106 [2022-11-25 18:30:56,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:30:56,719 INFO L225 Difference]: With dead ends: 1045 [2022-11-25 18:30:56,720 INFO L226 Difference]: Without dead ends: 658 [2022-11-25 18:30:56,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=156, Invalid=396, Unknown=0, NotChecked=0, Total=552 [2022-11-25 18:30:56,721 INFO L413 NwaCegarLoop]: 281 mSDtfsCounter, 592 mSDsluCounter, 1190 mSDsCounter, 0 mSdLazyCounter, 1050 mSolverCounterSat, 152 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 595 SdHoareTripleChecker+Valid, 1471 SdHoareTripleChecker+Invalid, 1204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 1050 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-11-25 18:30:56,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [595 Valid, 1471 Invalid, 1204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 1050 Invalid, 2 Unknown, 0 Unchecked, 6.5s Time] [2022-11-25 18:30:56,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2022-11-25 18:30:56,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 638. [2022-11-25 18:30:56,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 538 states have (on average 1.2304832713754648) internal successors, (662), 551 states have internal predecessors, (662), 53 states have call successors, (53), 37 states have call predecessors, (53), 46 states have return successors, (63), 54 states have call predecessors, (63), 49 states have call successors, (63) [2022-11-25 18:30:56,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 778 transitions. [2022-11-25 18:30:56,821 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 778 transitions. Word has length 106 [2022-11-25 18:30:56,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:30:56,821 INFO L495 AbstractCegarLoop]: Abstraction has 638 states and 778 transitions. [2022-11-25 18:30:56,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.818181818181818) internal successors, (86), 5 states have internal predecessors, (86), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-25 18:30:56,821 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 778 transitions. [2022-11-25 18:30:56,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-11-25 18:30:56,822 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:30:56,822 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 18:30:56,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-11-25 18:30:56,823 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:30:56,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:30:56,823 INFO L85 PathProgramCache]: Analyzing trace with hash -708697275, now seen corresponding path program 1 times [2022-11-25 18:30:56,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:30:56,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220494286] [2022-11-25 18:30:56,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:30:56,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:30:56,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:57,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:30:57,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:57,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:30:57,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:57,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-25 18:30:57,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:57,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-25 18:30:57,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:57,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-25 18:30:57,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:57,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:30:57,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:57,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:30:57,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:57,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-25 18:30:57,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:57,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 18:30:57,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:30:57,591 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-25 18:30:57,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:30:57,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220494286] [2022-11-25 18:30:57,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220494286] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:30:57,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:30:57,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-25 18:30:57,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624198051] [2022-11-25 18:30:57,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:30:57,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-25 18:30:57,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:30:57,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-25 18:30:57,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-11-25 18:30:57,594 INFO L87 Difference]: Start difference. First operand 638 states and 778 transitions. Second operand has 14 states, 14 states have (on average 6.642857142857143) internal successors, (93), 7 states have internal predecessors, (93), 3 states have call successors, (10), 8 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-25 18:31:01,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:31:02,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:31:02,501 INFO L93 Difference]: Finished difference Result 740 states and 898 transitions. [2022-11-25 18:31:02,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-25 18:31:02,501 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.642857142857143) internal successors, (93), 7 states have internal predecessors, (93), 3 states have call successors, (10), 8 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 112 [2022-11-25 18:31:02,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:31:02,504 INFO L225 Difference]: With dead ends: 740 [2022-11-25 18:31:02,504 INFO L226 Difference]: Without dead ends: 673 [2022-11-25 18:31:02,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2022-11-25 18:31:02,505 INFO L413 NwaCegarLoop]: 264 mSDtfsCounter, 604 mSDsluCounter, 1958 mSDsCounter, 0 mSdLazyCounter, 1150 mSolverCounterSat, 195 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 628 SdHoareTripleChecker+Valid, 2222 SdHoareTripleChecker+Invalid, 1346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 1150 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-11-25 18:31:02,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [628 Valid, 2222 Invalid, 1346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 1150 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2022-11-25 18:31:02,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2022-11-25 18:31:02,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 644. [2022-11-25 18:31:02,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 543 states have (on average 1.2283609576427257) internal successors, (667), 557 states have internal predecessors, (667), 53 states have call successors, (53), 37 states have call predecessors, (53), 47 states have return successors, (64), 54 states have call predecessors, (64), 49 states have call successors, (64) [2022-11-25 18:31:02,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 784 transitions. [2022-11-25 18:31:02,651 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 784 transitions. Word has length 112 [2022-11-25 18:31:02,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:31:02,651 INFO L495 AbstractCegarLoop]: Abstraction has 644 states and 784 transitions. [2022-11-25 18:31:02,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.642857142857143) internal successors, (93), 7 states have internal predecessors, (93), 3 states have call successors, (10), 8 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-25 18:31:02,651 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 784 transitions. [2022-11-25 18:31:02,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-25 18:31:02,652 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:31:02,652 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 18:31:02,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-11-25 18:31:02,653 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:31:02,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:31:02,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1557650297, now seen corresponding path program 1 times [2022-11-25 18:31:02,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:31:02,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874923304] [2022-11-25 18:31:02,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:31:02,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:31:02,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:03,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:31:03,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:03,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:31:03,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:03,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-25 18:31:03,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:03,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-25 18:31:03,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:03,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-25 18:31:03,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:03,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:31:03,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:03,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:31:03,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:03,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-25 18:31:03,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:03,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-25 18:31:03,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:03,445 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-25 18:31:03,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:31:03,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874923304] [2022-11-25 18:31:03,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874923304] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:31:03,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:31:03,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-25 18:31:03,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290014859] [2022-11-25 18:31:03,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:31:03,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-25 18:31:03,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:31:03,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-25 18:31:03,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-11-25 18:31:03,447 INFO L87 Difference]: Start difference. First operand 644 states and 784 transitions. Second operand has 14 states, 14 states have (on average 6.714285714285714) internal successors, (94), 7 states have internal predecessors, (94), 3 states have call successors, (10), 8 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-25 18:31:07,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:31:08,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:31:08,472 INFO L93 Difference]: Finished difference Result 732 states and 885 transitions. [2022-11-25 18:31:08,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 18:31:08,472 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.714285714285714) internal successors, (94), 7 states have internal predecessors, (94), 3 states have call successors, (10), 8 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 113 [2022-11-25 18:31:08,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:31:08,475 INFO L225 Difference]: With dead ends: 732 [2022-11-25 18:31:08,475 INFO L226 Difference]: Without dead ends: 665 [2022-11-25 18:31:08,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2022-11-25 18:31:08,476 INFO L413 NwaCegarLoop]: 264 mSDtfsCounter, 386 mSDsluCounter, 2056 mSDsCounter, 0 mSdLazyCounter, 1278 mSolverCounterSat, 95 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 2320 SdHoareTripleChecker+Invalid, 1374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1278 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-11-25 18:31:08,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 2320 Invalid, 1374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1278 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2022-11-25 18:31:08,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2022-11-25 18:31:08,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 567. [2022-11-25 18:31:08,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 477 states have (on average 1.2180293501048218) internal successors, (581), 488 states have internal predecessors, (581), 47 states have call successors, (47), 34 states have call predecessors, (47), 42 states have return successors, (55), 48 states have call predecessors, (55), 43 states have call successors, (55) [2022-11-25 18:31:08,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 683 transitions. [2022-11-25 18:31:08,561 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 683 transitions. Word has length 113 [2022-11-25 18:31:08,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:31:08,561 INFO L495 AbstractCegarLoop]: Abstraction has 567 states and 683 transitions. [2022-11-25 18:31:08,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.714285714285714) internal successors, (94), 7 states have internal predecessors, (94), 3 states have call successors, (10), 8 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-25 18:31:08,561 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 683 transitions. [2022-11-25 18:31:08,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-11-25 18:31:08,562 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:31:08,562 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 18:31:08,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-11-25 18:31:08,562 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:31:08,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:31:08,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1717048505, now seen corresponding path program 1 times [2022-11-25 18:31:08,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:31:08,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025417864] [2022-11-25 18:31:08,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:31:08,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:31:08,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:09,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:31:09,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:09,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:31:09,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:09,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 18:31:09,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:09,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-25 18:31:09,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:09,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-25 18:31:09,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:09,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:31:09,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:09,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:31:09,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:09,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-25 18:31:09,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:09,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-25 18:31:09,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:09,522 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-25 18:31:09,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:31:09,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025417864] [2022-11-25 18:31:09,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025417864] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:31:09,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:31:09,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-25 18:31:09,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377557312] [2022-11-25 18:31:09,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:31:09,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-25 18:31:09,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:31:09,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-25 18:31:09,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-11-25 18:31:09,526 INFO L87 Difference]: Start difference. First operand 567 states and 683 transitions. Second operand has 13 states, 13 states have (on average 7.0) internal successors, (91), 7 states have internal predecessors, (91), 3 states have call successors, (10), 8 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-25 18:31:13,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:31:14,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:31:14,415 INFO L93 Difference]: Finished difference Result 744 states and 899 transitions. [2022-11-25 18:31:14,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 18:31:14,415 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.0) internal successors, (91), 7 states have internal predecessors, (91), 3 states have call successors, (10), 8 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 110 [2022-11-25 18:31:14,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:31:14,419 INFO L225 Difference]: With dead ends: 744 [2022-11-25 18:31:14,419 INFO L226 Difference]: Without dead ends: 610 [2022-11-25 18:31:14,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462 [2022-11-25 18:31:14,420 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 431 mSDsluCounter, 1707 mSDsCounter, 0 mSdLazyCounter, 1161 mSolverCounterSat, 96 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 1951 SdHoareTripleChecker+Invalid, 1258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 1161 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-11-25 18:31:14,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 1951 Invalid, 1258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 1161 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2022-11-25 18:31:14,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2022-11-25 18:31:14,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 576. [2022-11-25 18:31:14,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 485 states have (on average 1.2082474226804123) internal successors, (586), 494 states have internal predecessors, (586), 48 states have call successors, (48), 34 states have call predecessors, (48), 42 states have return successors, (55), 48 states have call predecessors, (55), 43 states have call successors, (55) [2022-11-25 18:31:14,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 689 transitions. [2022-11-25 18:31:14,500 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 689 transitions. Word has length 110 [2022-11-25 18:31:14,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:31:14,500 INFO L495 AbstractCegarLoop]: Abstraction has 576 states and 689 transitions. [2022-11-25 18:31:14,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.0) internal successors, (91), 7 states have internal predecessors, (91), 3 states have call successors, (10), 8 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-25 18:31:14,500 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 689 transitions. [2022-11-25 18:31:14,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-11-25 18:31:14,501 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:31:14,501 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 18:31:14,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-11-25 18:31:14,502 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:31:14,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:31:14,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1277151609, now seen corresponding path program 1 times [2022-11-25 18:31:14,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:31:14,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050789832] [2022-11-25 18:31:14,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:31:14,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:31:14,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:14,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:31:14,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:14,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:31:14,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:14,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 18:31:14,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:14,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-25 18:31:14,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:14,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-25 18:31:14,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:14,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:31:14,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:14,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:31:14,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:14,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-25 18:31:14,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:15,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 18:31:15,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:15,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:31:15,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:15,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:31:15,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:15,184 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-25 18:31:15,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:31:15,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050789832] [2022-11-25 18:31:15,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050789832] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:31:15,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:31:15,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-25 18:31:15,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244959725] [2022-11-25 18:31:15,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:31:15,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 18:31:15,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:31:15,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 18:31:15,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-11-25 18:31:15,187 INFO L87 Difference]: Start difference. First operand 576 states and 689 transitions. Second operand has 12 states, 12 states have (on average 7.0) internal successors, (84), 5 states have internal predecessors, (84), 2 states have call successors, (11), 8 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 1 states have call successors, (9) [2022-11-25 18:31:19,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:31:21,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:31:22,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:31:22,094 INFO L93 Difference]: Finished difference Result 618 states and 741 transitions. [2022-11-25 18:31:22,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 18:31:22,095 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 5 states have internal predecessors, (84), 2 states have call successors, (11), 8 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 1 states have call successors, (9) Word has length 117 [2022-11-25 18:31:22,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:31:22,096 INFO L225 Difference]: With dead ends: 618 [2022-11-25 18:31:22,096 INFO L226 Difference]: Without dead ends: 524 [2022-11-25 18:31:22,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2022-11-25 18:31:22,097 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 316 mSDsluCounter, 1563 mSDsCounter, 0 mSdLazyCounter, 1121 mSolverCounterSat, 60 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 1806 SdHoareTripleChecker+Invalid, 1183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1121 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-11-25 18:31:22,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 1806 Invalid, 1183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1121 Invalid, 2 Unknown, 0 Unchecked, 6.5s Time] [2022-11-25 18:31:22,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2022-11-25 18:31:22,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 379. [2022-11-25 18:31:22,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 316 states have (on average 1.1740506329113924) internal successors, (371), 321 states have internal predecessors, (371), 35 states have call successors, (35), 25 states have call predecessors, (35), 27 states have return successors, (35), 33 states have call predecessors, (35), 32 states have call successors, (35) [2022-11-25 18:31:22,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 441 transitions. [2022-11-25 18:31:22,165 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 441 transitions. Word has length 117 [2022-11-25 18:31:22,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:31:22,166 INFO L495 AbstractCegarLoop]: Abstraction has 379 states and 441 transitions. [2022-11-25 18:31:22,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 5 states have internal predecessors, (84), 2 states have call successors, (11), 8 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 1 states have call successors, (9) [2022-11-25 18:31:22,166 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 441 transitions. [2022-11-25 18:31:22,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-11-25 18:31:22,167 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:31:22,167 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 18:31:22,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-11-25 18:31:22,168 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:31:22,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:31:22,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1546029661, now seen corresponding path program 1 times [2022-11-25 18:31:22,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:31:22,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744366730] [2022-11-25 18:31:22,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:31:22,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:31:22,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:22,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:31:22,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:22,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:31:22,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:22,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 18:31:22,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:22,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 18:31:22,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:22,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-25 18:31:22,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:22,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 18:31:22,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:22,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-25 18:31:22,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:22,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-25 18:31:22,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:22,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-25 18:31:22,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:22,789 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-25 18:31:22,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:31:22,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744366730] [2022-11-25 18:31:22,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744366730] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:31:22,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:31:22,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 18:31:22,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863020345] [2022-11-25 18:31:22,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:31:22,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 18:31:22,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:31:22,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 18:31:22,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:31:22,791 INFO L87 Difference]: Start difference. First operand 379 states and 441 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 4 states have internal predecessors, (86), 3 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-25 18:31:26,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:31:26,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:31:26,880 INFO L93 Difference]: Finished difference Result 449 states and 532 transitions. [2022-11-25 18:31:26,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:31:26,881 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 4 states have internal predecessors, (86), 3 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 116 [2022-11-25 18:31:26,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:31:26,882 INFO L225 Difference]: With dead ends: 449 [2022-11-25 18:31:26,882 INFO L226 Difference]: Without dead ends: 423 [2022-11-25 18:31:26,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-25 18:31:26,882 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 171 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-11-25 18:31:26,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 1092 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 684 Invalid, 1 Unknown, 0 Unchecked, 3.9s Time] [2022-11-25 18:31:26,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2022-11-25 18:31:26,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 396. [2022-11-25 18:31:26,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 332 states have (on average 1.1746987951807228) internal successors, (390), 337 states have internal predecessors, (390), 36 states have call successors, (36), 25 states have call predecessors, (36), 27 states have return successors, (36), 34 states have call predecessors, (36), 33 states have call successors, (36) [2022-11-25 18:31:26,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 462 transitions. [2022-11-25 18:31:26,943 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 462 transitions. Word has length 116 [2022-11-25 18:31:26,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:31:26,943 INFO L495 AbstractCegarLoop]: Abstraction has 396 states and 462 transitions. [2022-11-25 18:31:26,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 4 states have internal predecessors, (86), 3 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-25 18:31:26,944 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 462 transitions. [2022-11-25 18:31:26,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-11-25 18:31:26,945 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:31:26,945 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 18:31:26,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-11-25 18:31:26,945 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:31:26,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:31:26,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1510565347, now seen corresponding path program 1 times [2022-11-25 18:31:26,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:31:26,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514296990] [2022-11-25 18:31:26,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:31:26,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:31:27,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:27,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:31:27,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:27,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:31:27,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:27,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 18:31:27,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:27,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 18:31:27,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:27,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-25 18:31:27,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:27,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 18:31:27,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:27,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-25 18:31:27,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:27,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-25 18:31:27,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:27,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-25 18:31:27,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:27,534 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-25 18:31:27,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:31:27,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514296990] [2022-11-25 18:31:27,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514296990] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:31:27,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:31:27,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 18:31:27,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869805221] [2022-11-25 18:31:27,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:31:27,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 18:31:27,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:31:27,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 18:31:27,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:31:27,537 INFO L87 Difference]: Start difference. First operand 396 states and 462 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-25 18:31:30,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:31:31,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:31:31,036 INFO L93 Difference]: Finished difference Result 447 states and 523 transitions. [2022-11-25 18:31:31,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:31:31,037 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 116 [2022-11-25 18:31:31,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:31:31,039 INFO L225 Difference]: With dead ends: 447 [2022-11-25 18:31:31,039 INFO L226 Difference]: Without dead ends: 380 [2022-11-25 18:31:31,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-25 18:31:31,040 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 214 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 89 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-11-25 18:31:31,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 966 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 511 Invalid, 1 Unknown, 0 Unchecked, 3.3s Time] [2022-11-25 18:31:31,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2022-11-25 18:31:31,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 358. [2022-11-25 18:31:31,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 298 states have (on average 1.1610738255033557) internal successors, (346), 301 states have internal predecessors, (346), 33 states have call successors, (33), 25 states have call predecessors, (33), 26 states have return successors, (34), 32 states have call predecessors, (34), 32 states have call successors, (34) [2022-11-25 18:31:31,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 413 transitions. [2022-11-25 18:31:31,130 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 413 transitions. Word has length 116 [2022-11-25 18:31:31,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:31:31,131 INFO L495 AbstractCegarLoop]: Abstraction has 358 states and 413 transitions. [2022-11-25 18:31:31,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-25 18:31:31,131 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 413 transitions. [2022-11-25 18:31:31,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-11-25 18:31:31,132 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:31:31,132 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 18:31:31,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-11-25 18:31:31,132 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:31:31,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:31:31,132 INFO L85 PathProgramCache]: Analyzing trace with hash 2088850613, now seen corresponding path program 1 times [2022-11-25 18:31:31,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:31:31,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446687329] [2022-11-25 18:31:31,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:31:31,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:31:31,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:31,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:31:31,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:31,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:31:31,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:31,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-25 18:31:31,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:31,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-25 18:31:31,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:31,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-25 18:31:31,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:31,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:31:31,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:31,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:31:31,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:31,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-25 18:31:31,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:31,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-25 18:31:31,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:31,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-25 18:31:31,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:31,892 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-25 18:31:31,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:31:31,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446687329] [2022-11-25 18:31:31,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446687329] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:31:31,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:31:31,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-25 18:31:31,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084930777] [2022-11-25 18:31:31,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:31:31,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-25 18:31:31,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:31:31,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-25 18:31:31,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-11-25 18:31:31,894 INFO L87 Difference]: Start difference. First operand 358 states and 413 transitions. Second operand has 13 states, 13 states have (on average 7.769230769230769) internal successors, (101), 6 states have internal predecessors, (101), 4 states have call successors, (11), 9 states have call predecessors, (11), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-25 18:31:37,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:31:39,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:31:40,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:31:40,858 INFO L93 Difference]: Finished difference Result 692 states and 815 transitions. [2022-11-25 18:31:40,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-25 18:31:40,859 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.769230769230769) internal successors, (101), 6 states have internal predecessors, (101), 4 states have call successors, (11), 9 states have call predecessors, (11), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 122 [2022-11-25 18:31:40,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:31:40,861 INFO L225 Difference]: With dead ends: 692 [2022-11-25 18:31:40,861 INFO L226 Difference]: Without dead ends: 631 [2022-11-25 18:31:40,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=220, Invalid=902, Unknown=0, NotChecked=0, Total=1122 [2022-11-25 18:31:40,862 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 880 mSDsluCounter, 2205 mSDsCounter, 0 mSdLazyCounter, 2080 mSolverCounterSat, 267 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 895 SdHoareTripleChecker+Valid, 2517 SdHoareTripleChecker+Invalid, 2349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 267 IncrementalHoareTripleChecker+Valid, 2080 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:31:40,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [895 Valid, 2517 Invalid, 2349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [267 Valid, 2080 Invalid, 2 Unknown, 0 Unchecked, 8.0s Time] [2022-11-25 18:31:40,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2022-11-25 18:31:40,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 324. [2022-11-25 18:31:40,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 272 states have (on average 1.1654411764705883) internal successors, (317), 274 states have internal predecessors, (317), 27 states have call successors, (27), 23 states have call predecessors, (27), 24 states have return successors, (28), 26 states have call predecessors, (28), 26 states have call successors, (28) [2022-11-25 18:31:40,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 372 transitions. [2022-11-25 18:31:40,918 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 372 transitions. Word has length 122 [2022-11-25 18:31:40,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:31:40,919 INFO L495 AbstractCegarLoop]: Abstraction has 324 states and 372 transitions. [2022-11-25 18:31:40,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.769230769230769) internal successors, (101), 6 states have internal predecessors, (101), 4 states have call successors, (11), 9 states have call predecessors, (11), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-25 18:31:40,919 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 372 transitions. [2022-11-25 18:31:40,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-11-25 18:31:40,920 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:31:40,920 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 18:31:40,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2022-11-25 18:31:40,920 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:31:40,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:31:40,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1025503595, now seen corresponding path program 1 times [2022-11-25 18:31:40,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:31:40,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623907677] [2022-11-25 18:31:40,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:31:40,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:31:41,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:41,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:31:41,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:41,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:31:41,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:41,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 18:31:41,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:41,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 18:31:41,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:41,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-25 18:31:41,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:41,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 18:31:41,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:41,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-25 18:31:41,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:41,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-25 18:31:41,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:41,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-25 18:31:41,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:41,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-25 18:31:41,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:41,829 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-25 18:31:41,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:31:41,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623907677] [2022-11-25 18:31:41,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623907677] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:31:41,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:31:41,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-25 18:31:41,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31107648] [2022-11-25 18:31:41,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:31:41,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 18:31:41,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:31:41,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 18:31:41,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-11-25 18:31:41,831 INFO L87 Difference]: Start difference. First operand 324 states and 372 transitions. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 6 states have internal predecessors, (93), 3 states have call successors, (11), 6 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-25 18:31:45,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:31:46,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:31:46,472 INFO L93 Difference]: Finished difference Result 361 states and 419 transitions. [2022-11-25 18:31:46,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 18:31:46,472 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 6 states have internal predecessors, (93), 3 states have call successors, (11), 6 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 125 [2022-11-25 18:31:46,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:31:46,473 INFO L225 Difference]: With dead ends: 361 [2022-11-25 18:31:46,474 INFO L226 Difference]: Without dead ends: 269 [2022-11-25 18:31:46,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2022-11-25 18:31:46,474 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 368 mSDsluCounter, 1303 mSDsCounter, 0 mSdLazyCounter, 865 mSolverCounterSat, 107 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 1511 SdHoareTripleChecker+Invalid, 973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 865 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-11-25 18:31:46,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 1511 Invalid, 973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 865 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2022-11-25 18:31:46,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-11-25 18:31:46,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 255. [2022-11-25 18:31:46,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 215 states have (on average 1.1813953488372093) internal successors, (254), 217 states have internal predecessors, (254), 19 states have call successors, (19), 19 states have call predecessors, (19), 20 states have return successors, (20), 18 states have call predecessors, (20), 18 states have call successors, (20) [2022-11-25 18:31:46,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 293 transitions. [2022-11-25 18:31:46,522 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 293 transitions. Word has length 125 [2022-11-25 18:31:46,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:31:46,523 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 293 transitions. [2022-11-25 18:31:46,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 6 states have internal predecessors, (93), 3 states have call successors, (11), 6 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-25 18:31:46,523 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 293 transitions. [2022-11-25 18:31:46,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-11-25 18:31:46,523 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:31:46,524 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 18:31:46,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2022-11-25 18:31:46,524 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:31:46,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:31:46,524 INFO L85 PathProgramCache]: Analyzing trace with hash 226053049, now seen corresponding path program 1 times [2022-11-25 18:31:46,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:31:46,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13981471] [2022-11-25 18:31:46,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:31:46,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:31:46,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:46,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:31:46,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:46,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:31:46,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:46,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 18:31:46,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:46,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-25 18:31:46,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:46,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-25 18:31:46,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:47,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:31:47,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:47,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:31:47,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:47,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-25 18:31:47,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:47,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-25 18:31:47,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:47,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-25 18:31:47,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:47,176 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-25 18:31:47,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:31:47,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13981471] [2022-11-25 18:31:47,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13981471] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:31:47,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:31:47,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-25 18:31:47,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019657444] [2022-11-25 18:31:47,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:31:47,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 18:31:47,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:31:47,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 18:31:47,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-11-25 18:31:47,178 INFO L87 Difference]: Start difference. First operand 255 states and 293 transitions. Second operand has 11 states, 11 states have (on average 10.0) internal successors, (110), 4 states have internal predecessors, (110), 2 states have call successors, (11), 9 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-25 18:31:51,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:31:53,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:31:55,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:31:57,319 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:31:57,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:31:57,732 INFO L93 Difference]: Finished difference Result 323 states and 371 transitions. [2022-11-25 18:31:57,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:31:57,732 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.0) internal successors, (110), 4 states have internal predecessors, (110), 2 states have call successors, (11), 9 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 131 [2022-11-25 18:31:57,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:31:57,734 INFO L225 Difference]: With dead ends: 323 [2022-11-25 18:31:57,735 INFO L226 Difference]: Without dead ends: 269 [2022-11-25 18:31:57,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2022-11-25 18:31:57,735 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 214 mSDsluCounter, 842 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 34 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 995 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:31:57,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 995 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 674 Invalid, 4 Unknown, 0 Unchecked, 10.2s Time] [2022-11-25 18:31:57,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-11-25 18:31:57,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 255. [2022-11-25 18:31:57,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 215 states have (on average 1.1767441860465115) internal successors, (253), 217 states have internal predecessors, (253), 19 states have call successors, (19), 19 states have call predecessors, (19), 20 states have return successors, (20), 18 states have call predecessors, (20), 18 states have call successors, (20) [2022-11-25 18:31:57,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 292 transitions. [2022-11-25 18:31:57,815 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 292 transitions. Word has length 131 [2022-11-25 18:31:57,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:31:57,815 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 292 transitions. [2022-11-25 18:31:57,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.0) internal successors, (110), 4 states have internal predecessors, (110), 2 states have call successors, (11), 9 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-25 18:31:57,816 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 292 transitions. [2022-11-25 18:31:57,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-11-25 18:31:57,817 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:31:57,817 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 18:31:57,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2022-11-25 18:31:57,817 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:31:57,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:31:57,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1225615896, now seen corresponding path program 1 times [2022-11-25 18:31:57,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:31:57,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6388148] [2022-11-25 18:31:57,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:31:57,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:31:57,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:58,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:31:58,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:58,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:31:58,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:58,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 18:31:58,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:58,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-25 18:31:58,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:58,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-25 18:31:58,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:58,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:31:58,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:58,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-25 18:31:58,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:58,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-25 18:31:58,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:58,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-25 18:31:58,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:58,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-25 18:31:58,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:31:58,421 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-25 18:31:58,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:31:58,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6388148] [2022-11-25 18:31:58,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6388148] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:31:58,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:31:58,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-25 18:31:58,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761313216] [2022-11-25 18:31:58,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:31:58,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 18:31:58,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:31:58,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 18:31:58,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-11-25 18:31:58,424 INFO L87 Difference]: Start difference. First operand 255 states and 292 transitions. Second operand has 10 states, 10 states have (on average 11.1) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (11), 9 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-25 18:32:01,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-25 18:32:01,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:32:01,788 INFO L93 Difference]: Finished difference Result 360 states and 416 transitions. [2022-11-25 18:32:01,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 18:32:01,789 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.1) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (11), 9 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 132 [2022-11-25 18:32:01,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:32:01,791 INFO L225 Difference]: With dead ends: 360 [2022-11-25 18:32:01,791 INFO L226 Difference]: Without dead ends: 308 [2022-11-25 18:32:01,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2022-11-25 18:32:01,792 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 396 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 84 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:32:01,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 869 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 385 Invalid, 1 Unknown, 0 Unchecked, 3.1s Time] [2022-11-25 18:32:01,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2022-11-25 18:32:01,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 253. [2022-11-25 18:32:01,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 213 states have (on average 1.1737089201877935) internal successors, (250), 215 states have internal predecessors, (250), 19 states have call successors, (19), 19 states have call predecessors, (19), 20 states have return successors, (20), 18 states have call predecessors, (20), 18 states have call successors, (20) [2022-11-25 18:32:01,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 289 transitions. [2022-11-25 18:32:01,836 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 289 transitions. Word has length 132 [2022-11-25 18:32:01,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:32:01,836 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 289 transitions. [2022-11-25 18:32:01,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.1) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (11), 9 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-25 18:32:01,837 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 289 transitions. [2022-11-25 18:32:01,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-11-25 18:32:01,837 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:32:01,838 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 18:32:01,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2022-11-25 18:32:01,838 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:32:01,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:32:01,838 INFO L85 PathProgramCache]: Analyzing trace with hash -271290531, now seen corresponding path program 1 times [2022-11-25 18:32:01,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:32:01,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372441652] [2022-11-25 18:32:01,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:32:01,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms