./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 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea0d9589-85e5-4690-b0ef-e5838d7576bb/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea0d9589-85e5-4690-b0ef-e5838d7576bb/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea0d9589-85e5-4690-b0ef-e5838d7576bb/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea0d9589-85e5-4690-b0ef-e5838d7576bb/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ntdrivers/floppy.i.cil-3.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea0d9589-85e5-4690-b0ef-e5838d7576bb/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea0d9589-85e5-4690-b0ef-e5838d7576bb/bin/uautomizer-uyxdKDjOR8 --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-2329fc7 [2022-12-13 11:43:25,092 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 11:43:25,094 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 11:43:25,113 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 11:43:25,113 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 11:43:25,114 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 11:43:25,115 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 11:43:25,117 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 11:43:25,119 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 11:43:25,120 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 11:43:25,120 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 11:43:25,122 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 11:43:25,122 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 11:43:25,123 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 11:43:25,124 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 11:43:25,125 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 11:43:25,126 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 11:43:25,127 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 11:43:25,129 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 11:43:25,131 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 11:43:25,132 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 11:43:25,133 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 11:43:25,135 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 11:43:25,135 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 11:43:25,139 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 11:43:25,139 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 11:43:25,140 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 11:43:25,141 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 11:43:25,141 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 11:43:25,142 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 11:43:25,142 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 11:43:25,143 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 11:43:25,144 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 11:43:25,145 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 11:43:25,146 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 11:43:25,146 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 11:43:25,147 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 11:43:25,147 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 11:43:25,147 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 11:43:25,148 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 11:43:25,148 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 11:43:25,149 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea0d9589-85e5-4690-b0ef-e5838d7576bb/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 11:43:25,170 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 11:43:25,170 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 11:43:25,171 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 11:43:25,171 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 11:43:25,171 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 11:43:25,172 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 11:43:25,172 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 11:43:25,173 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 11:43:25,173 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 11:43:25,173 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 11:43:25,173 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 11:43:25,173 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 11:43:25,174 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 11:43:25,174 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 11:43:25,174 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 11:43:25,174 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 11:43:25,174 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 11:43:25,174 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 11:43:25,175 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 11:43:25,175 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 11:43:25,175 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 11:43:25,175 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 11:43:25,175 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 11:43:25,176 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 11:43:25,176 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:43:25,176 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 11:43:25,176 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 11:43:25,176 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 11:43:25,176 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 11:43:25,177 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 11:43:25,177 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 11:43:25,177 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 11:43:25,177 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 11:43:25,177 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 11:43:25,178 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 11:43:25,178 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_ea0d9589-85e5-4690-b0ef-e5838d7576bb/bin/uautomizer-uyxdKDjOR8/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_ea0d9589-85e5-4690-b0ef-e5838d7576bb/bin/uautomizer-uyxdKDjOR8 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-12-13 11:43:25,367 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 11:43:25,387 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 11:43:25,389 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 11:43:25,390 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 11:43:25,391 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 11:43:25,392 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea0d9589-85e5-4690-b0ef-e5838d7576bb/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/ntdrivers/floppy.i.cil-3.c [2022-12-13 11:43:28,028 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 11:43:28,403 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 11:43:28,403 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea0d9589-85e5-4690-b0ef-e5838d7576bb/sv-benchmarks/c/ntdrivers/floppy.i.cil-3.c [2022-12-13 11:43:28,445 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea0d9589-85e5-4690-b0ef-e5838d7576bb/bin/uautomizer-uyxdKDjOR8/data/9eb374c95/578928a1e9f8492c841d8d06bee33f36/FLAGb1d1eacd4 [2022-12-13 11:43:28,457 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea0d9589-85e5-4690-b0ef-e5838d7576bb/bin/uautomizer-uyxdKDjOR8/data/9eb374c95/578928a1e9f8492c841d8d06bee33f36 [2022-12-13 11:43:28,459 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 11:43:28,460 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 11:43:28,461 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 11:43:28,461 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 11:43:28,464 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 11:43:28,465 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:43:28" (1/1) ... [2022-12-13 11:43:28,465 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76c0df4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:43:28, skipping insertion in model container [2022-12-13 11:43:28,466 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:43:28" (1/1) ... [2022-12-13 11:43:28,473 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 11:43:28,559 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 11:43:29,104 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_ea0d9589-85e5-4690-b0ef-e5838d7576bb/sv-benchmarks/c/ntdrivers/floppy.i.cil-3.c[77246,77259] [2022-12-13 11:43:29,122 WARN L623 FunctionHandler]: Unknown extern function swprintf [2022-12-13 11:43:29,126 WARN L623 FunctionHandler]: Unknown extern function sprintf [2022-12-13 11:43:29,329 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:43:29,364 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 11:43:29,402 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_ea0d9589-85e5-4690-b0ef-e5838d7576bb/sv-benchmarks/c/ntdrivers/floppy.i.cil-3.c[77246,77259] [2022-12-13 11:43:29,410 WARN L623 FunctionHandler]: Unknown extern function swprintf [2022-12-13 11:43:29,411 WARN L623 FunctionHandler]: Unknown extern function sprintf [2022-12-13 11:43:29,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:43:29,607 INFO L208 MainTranslator]: Completed translation [2022-12-13 11:43:29,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:43:29 WrapperNode [2022-12-13 11:43:29,608 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 11:43:29,608 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 11:43:29,608 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 11:43:29,608 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 11:43:29,614 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:43:29" (1/1) ... [2022-12-13 11:43:29,665 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:43:29" (1/1) ... [2022-12-13 11:43:29,732 INFO L138 Inliner]: procedures = 128, calls = 2895, calls flagged for inlining = 37, calls inlined = 26, statements flattened = 3094 [2022-12-13 11:43:29,732 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 11:43:29,733 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 11:43:29,733 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 11:43:29,733 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 11:43:29,741 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:43:29" (1/1) ... [2022-12-13 11:43:29,741 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:43:29" (1/1) ... [2022-12-13 11:43:29,754 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:43:29" (1/1) ... [2022-12-13 11:43:29,755 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:43:29" (1/1) ... [2022-12-13 11:43:29,808 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:43:29" (1/1) ... [2022-12-13 11:43:29,816 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:43:29" (1/1) ... [2022-12-13 11:43:29,824 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:43:29" (1/1) ... [2022-12-13 11:43:29,847 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:43:29" (1/1) ... [2022-12-13 11:43:29,861 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 11:43:29,862 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 11:43:29,862 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 11:43:29,862 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 11:43:29,863 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:43:29" (1/1) ... [2022-12-13 11:43:29,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:43:29,879 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea0d9589-85e5-4690-b0ef-e5838d7576bb/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:43:29,890 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea0d9589-85e5-4690-b0ef-e5838d7576bb/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 11:43:29,893 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea0d9589-85e5-4690-b0ef-e5838d7576bb/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 11:43:29,927 INFO L130 BoogieDeclarations]: Found specification of procedure IoGetConfigurationInformation [2022-12-13 11:43:29,927 INFO L138 BoogieDeclarations]: Found implementation of procedure IoGetConfigurationInformation [2022-12-13 11:43:29,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-12-13 11:43:29,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-12-13 11:43:29,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-12-13 11:43:29,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 11:43:29,928 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-12-13 11:43:29,928 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-12-13 11:43:29,928 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2022-12-13 11:43:29,928 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2022-12-13 11:43:29,928 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyCreateClose [2022-12-13 11:43:29,928 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyCreateClose [2022-12-13 11:43:29,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 11:43:29,928 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnpComplete [2022-12-13 11:43:29,928 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnpComplete [2022-12-13 11:43:29,928 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-12-13 11:43:29,928 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-12-13 11:43:29,928 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedExchange [2022-12-13 11:43:29,928 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedExchange [2022-12-13 11:43:29,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-12-13 11:43:29,929 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-12-13 11:43:29,929 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-12-13 11:43:29,929 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-12-13 11:43:29,929 INFO L130 BoogieDeclarations]: Found specification of procedure FlQueueIrpToThread [2022-12-13 11:43:29,929 INFO L138 BoogieDeclarations]: Found implementation of procedure FlQueueIrpToThread [2022-12-13 11:43:29,929 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyDeviceControl [2022-12-13 11:43:29,929 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyDeviceControl [2022-12-13 11:43:29,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 11:43:29,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 11:43:29,929 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyProcessQueuedRequests [2022-12-13 11:43:29,929 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyProcessQueuedRequests [2022-12-13 11:43:29,929 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedInsertTailList [2022-12-13 11:43:29,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedInsertTailList [2022-12-13 11:43:29,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 11:43:29,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 11:43:29,930 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-12-13 11:43:29,930 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-12-13 11:43:29,930 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-13 11:43:29,930 INFO L130 BoogieDeclarations]: Found specification of procedure FlFdcDeviceIo [2022-12-13 11:43:29,930 INFO L138 BoogieDeclarations]: Found implementation of procedure FlFdcDeviceIo [2022-12-13 11:43:29,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 11:43:29,930 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-12-13 11:43:29,930 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-12-13 11:43:29,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove [2022-12-13 11:43:29,930 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove [2022-12-13 11:43:29,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 11:43:29,930 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy_guard [2022-12-13 11:43:29,930 INFO L138 BoogieDeclarations]: Found implementation of procedure memcpy_guard [2022-12-13 11:43:29,930 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyQueueRequest [2022-12-13 11:43:29,931 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyQueueRequest [2022-12-13 11:43:29,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-12-13 11:43:29,931 INFO L130 BoogieDeclarations]: Found specification of procedure ExAllocatePoolWithTag [2022-12-13 11:43:29,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ExAllocatePoolWithTag [2022-12-13 11:43:29,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 11:43:29,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 11:43:30,249 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 11:43:30,251 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 11:43:30,283 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-12-13 11:43:30,294 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-12-13 11:43:30,294 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-12-13 11:43:30,297 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-12-13 11:43:30,428 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##24: assume !false; [2022-12-13 11:43:30,429 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##23: assume false; [2022-12-13 11:43:30,450 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-12-13 11:43:30,464 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-12-13 11:43:30,464 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-12-13 11:43:30,556 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-12-13 11:43:30,588 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2022-12-13 11:43:30,588 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2022-12-13 11:43:30,589 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-12-13 11:43:30,589 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-12-13 11:43:30,590 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-12-13 11:43:30,724 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume !false; [2022-12-13 11:43:30,724 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##24: assume !false; [2022-12-13 11:43:30,724 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##23: assume false; [2022-12-13 11:43:30,725 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume false; [2022-12-13 11:43:30,725 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume false; [2022-12-13 11:43:30,725 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !false; [2022-12-13 11:43:30,727 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-12-13 11:43:30,734 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-12-13 11:43:30,736 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-12-13 11:43:31,165 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##38: assume !false; [2022-12-13 11:43:31,165 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##37: assume false; [2022-12-13 11:43:31,165 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##139: assume false; [2022-12-13 11:43:31,166 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##140: assume !false; [2022-12-13 11:43:31,166 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##124: assume !false; [2022-12-13 11:43:31,166 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##123: assume false; [2022-12-13 11:43:31,199 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-12-13 11:43:31,231 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-12-13 11:43:31,232 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-12-13 11:43:31,238 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-12-13 11:43:31,239 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-12-13 11:43:31,240 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-12-13 11:43:31,241 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-12-13 11:43:31,242 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-12-13 11:43:31,244 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-12-13 11:43:31,245 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-12-13 11:43:31,246 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-12-13 11:43:34,558 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##97: assume !false; [2022-12-13 11:43:34,559 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##96: assume false; [2022-12-13 11:43:34,559 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##76: assume false; [2022-12-13 11:43:34,559 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##177: assume !false; [2022-12-13 11:43:34,559 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##176: assume false; [2022-12-13 11:43:34,559 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##77: assume !false; [2022-12-13 11:43:34,559 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##48: assume !false; [2022-12-13 11:43:34,559 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##47: assume false; [2022-12-13 11:43:34,559 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##27: assume !false; [2022-12-13 11:43:34,559 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume false; [2022-12-13 11:43:34,559 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##162: assume false; [2022-12-13 11:43:34,560 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##163: assume !false; [2022-12-13 11:43:34,560 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##210: assume false; [2022-12-13 11:43:34,560 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##211: assume !false; [2022-12-13 11:43:34,560 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##108: assume !false; [2022-12-13 11:43:34,560 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##107: assume false; [2022-12-13 11:43:34,573 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 11:43:34,583 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 11:43:34,584 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-13 11:43:34,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:43:34 BoogieIcfgContainer [2022-12-13 11:43:34,586 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 11:43:34,589 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 11:43:34,589 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 11:43:34,591 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 11:43:34,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 11:43:28" (1/3) ... [2022-12-13 11:43:34,592 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ae0ecfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:43:34, skipping insertion in model container [2022-12-13 11:43:34,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:43:29" (2/3) ... [2022-12-13 11:43:34,593 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ae0ecfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:43:34, skipping insertion in model container [2022-12-13 11:43:34,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:43:34" (3/3) ... [2022-12-13 11:43:34,594 INFO L112 eAbstractionObserver]: Analyzing ICFG floppy.i.cil-3.c [2022-12-13 11:43:34,607 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 11:43:34,607 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 11:43:34,662 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 11:43:34,667 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;@76adccdb, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 11:43:34,668 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 11:43:34,673 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-12-13 11:43:34,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-13 11:43:34,680 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:43:34,680 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-12-13 11:43:34,681 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:43:34,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:43:34,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1811520219, now seen corresponding path program 1 times [2022-12-13 11:43:34,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:43:34,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285656514] [2022-12-13 11:43:34,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:43:34,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:43:34,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:43:35,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:43:35,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:43:35,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:43:35,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:43:35,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:43:35,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:43:35,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285656514] [2022-12-13 11:43:35,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285656514] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:43:35,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:43:35,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 11:43:35,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010343448] [2022-12-13 11:43:35,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:43:35,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:43:35,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:43:35,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:43:35,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:43:35,353 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-12-13 11:43:39,817 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-12-13 11:43:40,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:43:40,049 INFO L93 Difference]: Finished difference Result 1174 states and 1848 transitions. [2022-12-13 11:43:40,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 11:43:40,052 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-12-13 11:43:40,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:43:40,065 INFO L225 Difference]: With dead ends: 1174 [2022-12-13 11:43:40,065 INFO L226 Difference]: Without dead ends: 657 [2022-12-13 11:43:40,071 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-12-13 11:43:40,074 INFO L413 NwaCegarLoop]: 669 mSDtfsCounter, 419 mSDsluCounter, 1385 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 219 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 2054 SdHoareTripleChecker+Invalid, 1107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 219 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-12-13 11:43:40,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 2054 Invalid, 1107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [219 Valid, 887 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2022-12-13 11:43:40,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2022-12-13 11:43:40,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 579. [2022-12-13 11:43:40,135 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-12-13 11:43:40,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 840 transitions. [2022-12-13 11:43:40,139 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 840 transitions. Word has length 26 [2022-12-13 11:43:40,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:43:40,139 INFO L495 AbstractCegarLoop]: Abstraction has 579 states and 840 transitions. [2022-12-13 11:43:40,140 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-12-13 11:43:40,140 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 840 transitions. [2022-12-13 11:43:40,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-13 11:43:40,141 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:43:40,141 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-12-13 11:43:40,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 11:43:40,141 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:43:40,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:43:40,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1723209200, now seen corresponding path program 1 times [2022-12-13 11:43:40,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:43:40,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103388686] [2022-12-13 11:43:40,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:43:40,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:43:40,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:43:40,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:43:40,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:43:40,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:43:40,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:43:40,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:43:40,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:43:40,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103388686] [2022-12-13 11:43:40,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103388686] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:43:40,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:43:40,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 11:43:40,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348759009] [2022-12-13 11:43:40,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:43:40,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:43:40,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:43:40,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:43:40,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:43:40,434 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-12-13 11:43:44,791 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-12-13 11:43:45,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:43:45,060 INFO L93 Difference]: Finished difference Result 1217 states and 1784 transitions. [2022-12-13 11:43:45,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 11:43:45,061 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-12-13 11:43:45,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:43:45,064 INFO L225 Difference]: With dead ends: 1217 [2022-12-13 11:43:45,064 INFO L226 Difference]: Without dead ends: 657 [2022-12-13 11:43:45,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 11:43:45,066 INFO L413 NwaCegarLoop]: 659 mSDtfsCounter, 381 mSDsluCounter, 2004 mSDsCounter, 0 mSdLazyCounter, 1088 mSolverCounterSat, 213 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s 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, 4.5s IncrementalHoareTripleChecker+Time [2022-12-13 11:43:45,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 2663 Invalid, 1302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 1088 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2022-12-13 11:43:45,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2022-12-13 11:43:45,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 579. [2022-12-13 11:43:45,086 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-12-13 11:43:45,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 839 transitions. [2022-12-13 11:43:45,089 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 839 transitions. Word has length 29 [2022-12-13 11:43:45,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:43:45,089 INFO L495 AbstractCegarLoop]: Abstraction has 579 states and 839 transitions. [2022-12-13 11:43:45,089 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-12-13 11:43:45,089 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 839 transitions. [2022-12-13 11:43:45,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-12-13 11:43:45,090 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:43:45,090 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-12-13 11:43:45,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 11:43:45,090 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:43:45,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:43:45,091 INFO L85 PathProgramCache]: Analyzing trace with hash 51194362, now seen corresponding path program 1 times [2022-12-13 11:43:45,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:43:45,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93322613] [2022-12-13 11:43:45,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:43:45,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:43:45,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:43:45,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:43:45,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:43:45,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:43:45,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:43:45,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-12-13 11:43:45,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:43:45,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93322613] [2022-12-13 11:43:45,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93322613] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:43:45,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:43:45,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 11:43:45,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085935452] [2022-12-13 11:43:45,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:43:45,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:43:45,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:43:45,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:43:45,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:43:45,445 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-12-13 11:43:49,231 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-12-13 11:43:50,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:43:50,413 INFO L93 Difference]: Finished difference Result 1542 states and 2294 transitions. [2022-12-13 11:43:50,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 11:43:50,414 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-12-13 11:43:50,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:43:50,419 INFO L225 Difference]: With dead ends: 1542 [2022-12-13 11:43:50,419 INFO L226 Difference]: Without dead ends: 1127 [2022-12-13 11:43:50,420 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-12-13 11:43:50,421 INFO L413 NwaCegarLoop]: 821 mSDtfsCounter, 1376 mSDsluCounter, 1487 mSDsCounter, 0 mSdLazyCounter, 1152 mSolverCounterSat, 380 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s 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, 4.8s IncrementalHoareTripleChecker+Time [2022-12-13 11:43:50,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1413 Valid, 2308 Invalid, 1533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [380 Valid, 1152 Invalid, 1 Unknown, 0 Unchecked, 4.8s Time] [2022-12-13 11:43:50,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1127 states. [2022-12-13 11:43:50,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1127 to 1008. [2022-12-13 11:43:50,455 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-12-13 11:43:50,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1485 transitions. [2022-12-13 11:43:50,459 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1485 transitions. Word has length 33 [2022-12-13 11:43:50,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:43:50,460 INFO L495 AbstractCegarLoop]: Abstraction has 1008 states and 1485 transitions. [2022-12-13 11:43:50,460 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-12-13 11:43:50,460 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1485 transitions. [2022-12-13 11:43:50,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-13 11:43:50,461 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:43:50,461 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:43:50,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 11:43:50,462 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:43:50,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:43:50,462 INFO L85 PathProgramCache]: Analyzing trace with hash -778149095, now seen corresponding path program 1 times [2022-12-13 11:43:50,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:43:50,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922990819] [2022-12-13 11:43:50,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:43:50,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:43:50,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:43:50,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:43:50,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:43:50,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:43:50,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:43:50,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 11:43:50,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:43:50,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:43:50,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:43:50,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922990819] [2022-12-13 11:43:50,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922990819] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:43:50,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:43:50,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 11:43:50,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305393744] [2022-12-13 11:43:50,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:43:50,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:43:50,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:43:50,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:43:50,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:43:50,846 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-12-13 11:43:54,635 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-12-13 11:43:55,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:43:55,628 INFO L93 Difference]: Finished difference Result 1879 states and 2849 transitions. [2022-12-13 11:43:55,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 11:43:55,628 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-12-13 11:43:55,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:43:55,635 INFO L225 Difference]: With dead ends: 1879 [2022-12-13 11:43:55,635 INFO L226 Difference]: Without dead ends: 1860 [2022-12-13 11:43:55,636 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-12-13 11:43:55,636 INFO L413 NwaCegarLoop]: 692 mSDtfsCounter, 1502 mSDsluCounter, 1255 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 364 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s 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, 4.6s IncrementalHoareTripleChecker+Time [2022-12-13 11:43:55,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1572 Valid, 1947 Invalid, 1291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [364 Valid, 926 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2022-12-13 11:43:55,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1860 states. [2022-12-13 11:43:55,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1860 to 1624. [2022-12-13 11:43:55,696 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-12-13 11:43:55,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 2437 transitions. [2022-12-13 11:43:55,702 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 2437 transitions. Word has length 45 [2022-12-13 11:43:55,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:43:55,702 INFO L495 AbstractCegarLoop]: Abstraction has 1624 states and 2437 transitions. [2022-12-13 11:43:55,703 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-12-13 11:43:55,703 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 2437 transitions. [2022-12-13 11:43:55,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-12-13 11:43:55,705 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:43:55,705 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-12-13 11:43:55,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 11:43:55,705 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:43:55,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:43:55,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1291674765, now seen corresponding path program 1 times [2022-12-13 11:43:55,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:43:55,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850407579] [2022-12-13 11:43:55,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:43:55,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:43:55,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:43:55,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:43:55,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:43:55,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:43:55,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:43:55,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:43:55,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:43:55,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850407579] [2022-12-13 11:43:55,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850407579] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:43:55,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:43:55,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 11:43:55,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864309005] [2022-12-13 11:43:55,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:43:55,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:43:55,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:43:55,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:43:55,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:43:55,935 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-12-13 11:43:59,743 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-12-13 11:44:00,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:44:00,083 INFO L93 Difference]: Finished difference Result 1856 states and 2829 transitions. [2022-12-13 11:44:00,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 11:44:00,084 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-12-13 11:44:00,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:44:00,089 INFO L225 Difference]: With dead ends: 1856 [2022-12-13 11:44:00,090 INFO L226 Difference]: Without dead ends: 1852 [2022-12-13 11:44:00,091 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-12-13 11:44:00,091 INFO L413 NwaCegarLoop]: 635 mSDtfsCounter, 492 mSDsluCounter, 1304 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 221 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s 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, 4.0s IncrementalHoareTripleChecker+Time [2022-12-13 11:44:00,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 1939 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 871 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2022-12-13 11:44:00,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1852 states. [2022-12-13 11:44:00,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1852 to 1657. [2022-12-13 11:44:00,136 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-12-13 11:44:00,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1657 states to 1657 states and 2484 transitions. [2022-12-13 11:44:00,141 INFO L78 Accepts]: Start accepts. Automaton has 1657 states and 2484 transitions. Word has length 43 [2022-12-13 11:44:00,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:44:00,142 INFO L495 AbstractCegarLoop]: Abstraction has 1657 states and 2484 transitions. [2022-12-13 11:44:00,142 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-12-13 11:44:00,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1657 states and 2484 transitions. [2022-12-13 11:44:00,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-13 11:44:00,143 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:44:00,143 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-12-13 11:44:00,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 11:44:00,143 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:44:00,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:44:00,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1850160334, now seen corresponding path program 1 times [2022-12-13 11:44:00,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:44:00,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075883270] [2022-12-13 11:44:00,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:44:00,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:44:00,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:00,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:44:00,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:00,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:44:00,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:00,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:44:00,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:44:00,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075883270] [2022-12-13 11:44:00,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075883270] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:44:00,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:44:00,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 11:44:00,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337682987] [2022-12-13 11:44:00,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:44:00,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:44:00,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:44:00,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:44:00,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:44:00,335 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-12-13 11:44:03,837 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-12-13 11:44:05,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:44:05,550 INFO L93 Difference]: Finished difference Result 3293 states and 5099 transitions. [2022-12-13 11:44:05,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 11:44:05,551 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-12-13 11:44:05,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:44:05,561 INFO L225 Difference]: With dead ends: 3293 [2022-12-13 11:44:05,561 INFO L226 Difference]: Without dead ends: 3290 [2022-12-13 11:44:05,563 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-12-13 11:44:05,563 INFO L413 NwaCegarLoop]: 1008 mSDtfsCounter, 958 mSDsluCounter, 1779 mSDsCounter, 0 mSdLazyCounter, 1355 mSolverCounterSat, 277 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s 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, 5.0s IncrementalHoareTripleChecker+Time [2022-12-13 11:44:05,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [987 Valid, 2787 Invalid, 1633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 1355 Invalid, 1 Unknown, 0 Unchecked, 5.0s Time] [2022-12-13 11:44:05,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3290 states. [2022-12-13 11:44:05,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3290 to 2657. [2022-12-13 11:44:05,648 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-12-13 11:44:05,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2657 states to 2657 states and 4022 transitions. [2022-12-13 11:44:05,660 INFO L78 Accepts]: Start accepts. Automaton has 2657 states and 4022 transitions. Word has length 45 [2022-12-13 11:44:05,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:44:05,660 INFO L495 AbstractCegarLoop]: Abstraction has 2657 states and 4022 transitions. [2022-12-13 11:44:05,660 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-12-13 11:44:05,660 INFO L276 IsEmpty]: Start isEmpty. Operand 2657 states and 4022 transitions. [2022-12-13 11:44:05,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-12-13 11:44:05,661 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:44:05,661 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-12-13 11:44:05,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 11:44:05,662 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:44:05,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:44:05,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1615003555, now seen corresponding path program 1 times [2022-12-13 11:44:05,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:44:05,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055991185] [2022-12-13 11:44:05,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:44:05,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:44:05,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:05,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:44:05,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:05,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:44:05,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:05,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 11:44:05,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:05,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:44:05,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:05,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:44:05,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:44:05,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055991185] [2022-12-13 11:44:05,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055991185] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:44:05,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:44:05,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 11:44:05,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539055486] [2022-12-13 11:44:05,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:44:05,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:44:05,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:44:05,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:44:05,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:44:05,914 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-12-13 11:44:09,722 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-12-13 11:44:12,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:44:12,483 INFO L93 Difference]: Finished difference Result 3942 states and 6165 transitions. [2022-12-13 11:44:12,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 11:44:12,484 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-12-13 11:44:12,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:44:12,495 INFO L225 Difference]: With dead ends: 3942 [2022-12-13 11:44:12,495 INFO L226 Difference]: Without dead ends: 3937 [2022-12-13 11:44:12,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2022-12-13 11:44:12,497 INFO L413 NwaCegarLoop]: 870 mSDtfsCounter, 1306 mSDsluCounter, 1824 mSDsCounter, 0 mSdLazyCounter, 1848 mSolverCounterSat, 545 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s 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, 6.3s IncrementalHoareTripleChecker+Time [2022-12-13 11:44:12,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1327 Valid, 2694 Invalid, 2394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [545 Valid, 1848 Invalid, 1 Unknown, 0 Unchecked, 6.3s Time] [2022-12-13 11:44:12,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3937 states. [2022-12-13 11:44:12,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3937 to 3272. [2022-12-13 11:44:12,669 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-12-13 11:44:12,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3272 states to 3272 states and 5005 transitions. [2022-12-13 11:44:12,680 INFO L78 Accepts]: Start accepts. Automaton has 3272 states and 5005 transitions. Word has length 48 [2022-12-13 11:44:12,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:44:12,681 INFO L495 AbstractCegarLoop]: Abstraction has 3272 states and 5005 transitions. [2022-12-13 11:44:12,681 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-12-13 11:44:12,681 INFO L276 IsEmpty]: Start isEmpty. Operand 3272 states and 5005 transitions. [2022-12-13 11:44:12,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-12-13 11:44:12,682 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:44:12,682 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-12-13 11:44:12,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 11:44:12,682 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:44:12,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:44:12,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1759276290, now seen corresponding path program 1 times [2022-12-13 11:44:12,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:44:12,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375481333] [2022-12-13 11:44:12,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:44:12,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:44:12,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:13,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:44:13,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:13,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:44:13,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:13,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:44:13,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:44:13,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375481333] [2022-12-13 11:44:13,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375481333] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:44:13,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:44:13,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 11:44:13,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458070480] [2022-12-13 11:44:13,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:44:13,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:44:13,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:44:13,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:44:13,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:44:13,098 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-12-13 11:44:16,712 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-12-13 11:44:18,815 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-12-13 11:44:20,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:44:20,092 INFO L93 Difference]: Finished difference Result 7046 states and 10914 transitions. [2022-12-13 11:44:20,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 11:44:20,093 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-12-13 11:44:20,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:44:20,104 INFO L225 Difference]: With dead ends: 7046 [2022-12-13 11:44:20,104 INFO L226 Difference]: Without dead ends: 4021 [2022-12-13 11:44:20,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-12-13 11:44:20,111 INFO L413 NwaCegarLoop]: 783 mSDtfsCounter, 2405 mSDsluCounter, 1376 mSDsCounter, 0 mSdLazyCounter, 1285 mSolverCounterSat, 681 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s 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, 6.6s IncrementalHoareTripleChecker+Time [2022-12-13 11:44:20,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2452 Valid, 2159 Invalid, 1968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [681 Valid, 1285 Invalid, 2 Unknown, 0 Unchecked, 6.6s Time] [2022-12-13 11:44:20,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4021 states. [2022-12-13 11:44:20,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4021 to 3266. [2022-12-13 11:44:20,242 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-12-13 11:44:20,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3266 states to 3266 states and 4991 transitions. [2022-12-13 11:44:20,253 INFO L78 Accepts]: Start accepts. Automaton has 3266 states and 4991 transitions. Word has length 46 [2022-12-13 11:44:20,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:44:20,254 INFO L495 AbstractCegarLoop]: Abstraction has 3266 states and 4991 transitions. [2022-12-13 11:44:20,254 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-12-13 11:44:20,254 INFO L276 IsEmpty]: Start isEmpty. Operand 3266 states and 4991 transitions. [2022-12-13 11:44:20,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-12-13 11:44:20,255 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:44:20,255 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-12-13 11:44:20,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 11:44:20,255 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:44:20,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:44:20,256 INFO L85 PathProgramCache]: Analyzing trace with hash 436509709, now seen corresponding path program 1 times [2022-12-13 11:44:20,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:44:20,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327438954] [2022-12-13 11:44:20,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:44:20,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:44:20,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:20,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:44:20,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:20,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:44:20,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:20,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 11:44:20,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:20,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:44:20,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:44:20,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327438954] [2022-12-13 11:44:20,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327438954] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:44:20,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:44:20,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 11:44:20,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433835226] [2022-12-13 11:44:20,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:44:20,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:44:20,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:44:20,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:44:20,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:44:20,487 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-12-13 11:44:24,466 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-12-13 11:44:26,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:44:26,465 INFO L93 Difference]: Finished difference Result 10834 states and 17245 transitions. [2022-12-13 11:44:26,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 11:44:26,466 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-12-13 11:44:26,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:44:26,489 INFO L225 Difference]: With dead ends: 10834 [2022-12-13 11:44:26,489 INFO L226 Difference]: Without dead ends: 7785 [2022-12-13 11:44:26,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2022-12-13 11:44:26,498 INFO L413 NwaCegarLoop]: 801 mSDtfsCounter, 2172 mSDsluCounter, 1768 mSDsCounter, 0 mSdLazyCounter, 1381 mSolverCounterSat, 628 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s 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, 5.4s IncrementalHoareTripleChecker+Time [2022-12-13 11:44:26,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2248 Valid, 2569 Invalid, 2010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [628 Valid, 1381 Invalid, 1 Unknown, 0 Unchecked, 5.4s Time] [2022-12-13 11:44:26,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7785 states. [2022-12-13 11:44:26,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7785 to 6900. [2022-12-13 11:44:26,822 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-12-13 11:44:26,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6900 states to 6900 states and 10848 transitions. [2022-12-13 11:44:26,857 INFO L78 Accepts]: Start accepts. Automaton has 6900 states and 10848 transitions. Word has length 47 [2022-12-13 11:44:26,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:44:26,857 INFO L495 AbstractCegarLoop]: Abstraction has 6900 states and 10848 transitions. [2022-12-13 11:44:26,857 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-12-13 11:44:26,858 INFO L276 IsEmpty]: Start isEmpty. Operand 6900 states and 10848 transitions. [2022-12-13 11:44:26,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-12-13 11:44:26,858 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:44:26,858 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] [2022-12-13 11:44:26,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 11:44:26,859 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:44:26,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:44:26,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1022322752, now seen corresponding path program 1 times [2022-12-13 11:44:26,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:44:26,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956670222] [2022-12-13 11:44:26,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:44:26,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:44:26,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:27,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:44:27,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:27,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:44:27,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:27,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 11:44:27,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:27,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:44:27,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:27,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:44:27,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:44:27,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956670222] [2022-12-13 11:44:27,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956670222] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:44:27,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:44:27,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 11:44:27,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721394296] [2022-12-13 11:44:27,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:44:27,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 11:44:27,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:44:27,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 11:44:27,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 11:44:27,263 INFO L87 Difference]: Start difference. First operand 6900 states and 10848 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 5 states have internal predecessors, (40), 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-12-13 11:44:31,940 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-12-13 11:44:35,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:44:35,349 INFO L93 Difference]: Finished difference Result 7819 states and 12472 transitions. [2022-12-13 11:44:35,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-13 11:44:35,350 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 5 states have internal predecessors, (40), 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 49 [2022-12-13 11:44:35,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:44:35,372 INFO L225 Difference]: With dead ends: 7819 [2022-12-13 11:44:35,372 INFO L226 Difference]: Without dead ends: 7813 [2022-12-13 11:44:35,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=191, Invalid=511, Unknown=0, NotChecked=0, Total=702 [2022-12-13 11:44:35,375 INFO L413 NwaCegarLoop]: 840 mSDtfsCounter, 2828 mSDsluCounter, 2145 mSDsCounter, 0 mSdLazyCounter, 2276 mSolverCounterSat, 998 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2891 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, 7.3s IncrementalHoareTripleChecker+Time [2022-12-13 11:44:35,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2891 Valid, 2985 Invalid, 3275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [998 Valid, 2276 Invalid, 1 Unknown, 0 Unchecked, 7.3s Time] [2022-12-13 11:44:35,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7813 states. [2022-12-13 11:44:35,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7813 to 6900. [2022-12-13 11:44:35,716 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-12-13 11:44:35,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6900 states to 6900 states and 10847 transitions. [2022-12-13 11:44:35,738 INFO L78 Accepts]: Start accepts. Automaton has 6900 states and 10847 transitions. Word has length 49 [2022-12-13 11:44:35,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:44:35,738 INFO L495 AbstractCegarLoop]: Abstraction has 6900 states and 10847 transitions. [2022-12-13 11:44:35,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 5 states have internal predecessors, (40), 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-12-13 11:44:35,739 INFO L276 IsEmpty]: Start isEmpty. Operand 6900 states and 10847 transitions. [2022-12-13 11:44:35,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-12-13 11:44:35,740 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:44:35,740 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] [2022-12-13 11:44:35,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 11:44:35,740 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:44:35,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:44:35,741 INFO L85 PathProgramCache]: Analyzing trace with hash 677869713, now seen corresponding path program 1 times [2022-12-13 11:44:35,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:44:35,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271029708] [2022-12-13 11:44:35,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:44:35,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:44:35,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:36,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:44:36,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:36,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:44:36,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:36,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 11:44:36,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:36,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:44:36,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:36,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:44:36,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:44:36,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271029708] [2022-12-13 11:44:36,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271029708] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:44:36,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:44:36,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 11:44:36,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048729419] [2022-12-13 11:44:36,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:44:36,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 11:44:36,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:44:36,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 11:44:36,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 11:44:36,158 INFO L87 Difference]: Start difference. First operand 6900 states and 10847 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 5 states have internal predecessors, (40), 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-12-13 11:44:41,333 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-12-13 11:44:43,340 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-12-13 11:44:46,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:44:46,650 INFO L93 Difference]: Finished difference Result 7815 states and 12466 transitions. [2022-12-13 11:44:46,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-13 11:44:46,651 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 5 states have internal predecessors, (40), 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 49 [2022-12-13 11:44:46,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:44:46,668 INFO L225 Difference]: With dead ends: 7815 [2022-12-13 11:44:46,668 INFO L226 Difference]: Without dead ends: 7809 [2022-12-13 11:44:46,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=191, Invalid=511, Unknown=0, NotChecked=0, Total=702 [2022-12-13 11:44:46,671 INFO L413 NwaCegarLoop]: 840 mSDtfsCounter, 2415 mSDsluCounter, 2490 mSDsCounter, 0 mSdLazyCounter, 2808 mSolverCounterSat, 754 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2476 SdHoareTripleChecker+Valid, 3330 SdHoareTripleChecker+Invalid, 3564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 754 IncrementalHoareTripleChecker+Valid, 2808 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2022-12-13 11:44:46,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2476 Valid, 3330 Invalid, 3564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [754 Valid, 2808 Invalid, 2 Unknown, 0 Unchecked, 9.6s Time] [2022-12-13 11:44:46,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7809 states. [2022-12-13 11:44:47,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7809 to 6900. [2022-12-13 11:44:47,022 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-12-13 11:44:47,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6900 states to 6900 states and 10846 transitions. [2022-12-13 11:44:47,045 INFO L78 Accepts]: Start accepts. Automaton has 6900 states and 10846 transitions. Word has length 49 [2022-12-13 11:44:47,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:44:47,045 INFO L495 AbstractCegarLoop]: Abstraction has 6900 states and 10846 transitions. [2022-12-13 11:44:47,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 5 states have internal predecessors, (40), 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-12-13 11:44:47,046 INFO L276 IsEmpty]: Start isEmpty. Operand 6900 states and 10846 transitions. [2022-12-13 11:44:47,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-12-13 11:44:47,047 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:44:47,047 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-12-13 11:44:47,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 11:44:47,047 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:44:47,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:44:47,047 INFO L85 PathProgramCache]: Analyzing trace with hash 286289769, now seen corresponding path program 1 times [2022-12-13 11:44:47,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:44:47,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994156103] [2022-12-13 11:44:47,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:44:47,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:44:47,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:47,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:44:47,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:47,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:44:47,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:47,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 11:44:47,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:47,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:44:47,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:47,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:44:47,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:44:47,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994156103] [2022-12-13 11:44:47,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994156103] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:44:47,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:44:47,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 11:44:47,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780995091] [2022-12-13 11:44:47,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:44:47,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 11:44:47,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:44:47,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 11:44:47,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 11:44:47,460 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-12-13 11:44:51,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 11:44:54,127 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-12-13 11:44:56,133 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-12-13 11:44:57,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:44:57,497 INFO L93 Difference]: Finished difference Result 7824 states and 12487 transitions. [2022-12-13 11:44:57,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 11:44:57,498 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-12-13 11:44:57,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:44:57,515 INFO L225 Difference]: With dead ends: 7824 [2022-12-13 11:44:57,515 INFO L226 Difference]: Without dead ends: 7807 [2022-12-13 11:44:57,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-12-13 11:44:57,520 INFO L413 NwaCegarLoop]: 590 mSDtfsCounter, 716 mSDsluCounter, 2880 mSDsCounter, 0 mSdLazyCounter, 2282 mSolverCounterSat, 240 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s 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, 9.5s IncrementalHoareTripleChecker+Time [2022-12-13 11:44:57,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [742 Valid, 3470 Invalid, 2524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 2282 Invalid, 2 Unknown, 0 Unchecked, 9.5s Time] [2022-12-13 11:44:57,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7807 states. [2022-12-13 11:44:57,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7807 to 6904. [2022-12-13 11:44:57,926 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-12-13 11:44:57,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6904 states to 6904 states and 10853 transitions. [2022-12-13 11:44:57,966 INFO L78 Accepts]: Start accepts. Automaton has 6904 states and 10853 transitions. Word has length 51 [2022-12-13 11:44:57,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:44:57,967 INFO L495 AbstractCegarLoop]: Abstraction has 6904 states and 10853 transitions. [2022-12-13 11:44:57,967 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-12-13 11:44:57,967 INFO L276 IsEmpty]: Start isEmpty. Operand 6904 states and 10853 transitions. [2022-12-13 11:44:57,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-12-13 11:44:57,969 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:44:57,969 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-12-13 11:44:57,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 11:44:57,969 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:44:57,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:44:57,969 INFO L85 PathProgramCache]: Analyzing trace with hash -376802648, now seen corresponding path program 1 times [2022-12-13 11:44:57,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:44:57,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805740773] [2022-12-13 11:44:57,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:44:57,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:44:58,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:58,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:44:58,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:58,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:44:58,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:58,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 11:44:58,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:58,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:44:58,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:44:58,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-12-13 11:44:58,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:44:58,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805740773] [2022-12-13 11:44:58,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805740773] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:44:58,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:44:58,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 11:44:58,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136187261] [2022-12-13 11:44:58,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:44:58,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 11:44:58,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:44:58,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 11:44:58,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 11:44:58,327 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-12-13 11:45:03,649 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-12-13 11:45:05,661 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-12-13 11:45:07,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:45:07,022 INFO L93 Difference]: Finished difference Result 7822 states and 12483 transitions. [2022-12-13 11:45:07,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 11:45:07,023 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-12-13 11:45:07,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:45:07,038 INFO L225 Difference]: With dead ends: 7822 [2022-12-13 11:45:07,038 INFO L226 Difference]: Without dead ends: 7800 [2022-12-13 11:45:07,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-12-13 11:45:07,042 INFO L413 NwaCegarLoop]: 574 mSDtfsCounter, 716 mSDsluCounter, 2802 mSDsCounter, 0 mSdLazyCounter, 2264 mSolverCounterSat, 238 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s 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, 8.2s IncrementalHoareTripleChecker+Time [2022-12-13 11:45:07,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [742 Valid, 3376 Invalid, 2504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 2264 Invalid, 2 Unknown, 0 Unchecked, 8.2s Time] [2022-12-13 11:45:07,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7800 states. [2022-12-13 11:45:07,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7800 to 6897. [2022-12-13 11:45:07,447 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-12-13 11:45:07,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6897 states to 6897 states and 10844 transitions. [2022-12-13 11:45:07,474 INFO L78 Accepts]: Start accepts. Automaton has 6897 states and 10844 transitions. Word has length 50 [2022-12-13 11:45:07,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:45:07,475 INFO L495 AbstractCegarLoop]: Abstraction has 6897 states and 10844 transitions. [2022-12-13 11:45:07,475 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-12-13 11:45:07,475 INFO L276 IsEmpty]: Start isEmpty. Operand 6897 states and 10844 transitions. [2022-12-13 11:45:07,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-12-13 11:45:07,477 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:45:07,477 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-12-13 11:45:07,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 11:45:07,477 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:45:07,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:45:07,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1945256571, now seen corresponding path program 1 times [2022-12-13 11:45:07,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:45:07,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911674492] [2022-12-13 11:45:07,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:45:07,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:45:07,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:45:07,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:45:07,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:45:07,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:45:07,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:45:07,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 11:45:07,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:45:07,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:45:07,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:45:07,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911674492] [2022-12-13 11:45:07,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911674492] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:45:07,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:45:07,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 11:45:07,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105745525] [2022-12-13 11:45:07,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:45:07,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:45:07,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:45:07,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:45:07,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:45:07,729 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-12-13 11:45:11,636 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-12-13 11:45:12,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:45:12,720 INFO L93 Difference]: Finished difference Result 13804 states and 22175 transitions. [2022-12-13 11:45:12,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 11:45:12,721 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-12-13 11:45:12,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:45:12,742 INFO L225 Difference]: With dead ends: 13804 [2022-12-13 11:45:12,742 INFO L226 Difference]: Without dead ends: 8064 [2022-12-13 11:45:12,764 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-12-13 11:45:12,765 INFO L413 NwaCegarLoop]: 625 mSDtfsCounter, 434 mSDsluCounter, 1356 mSDsCounter, 0 mSdLazyCounter, 1010 mSolverCounterSat, 211 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s 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, 4.4s IncrementalHoareTripleChecker+Time [2022-12-13 11:45:12,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 1981 Invalid, 1222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 1010 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2022-12-13 11:45:12,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8064 states. [2022-12-13 11:45:13,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8064 to 7053. [2022-12-13 11:45:13,212 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-12-13 11:45:13,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7053 states to 7053 states and 11024 transitions. [2022-12-13 11:45:13,248 INFO L78 Accepts]: Start accepts. Automaton has 7053 states and 11024 transitions. Word has length 52 [2022-12-13 11:45:13,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:45:13,248 INFO L495 AbstractCegarLoop]: Abstraction has 7053 states and 11024 transitions. [2022-12-13 11:45:13,249 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-12-13 11:45:13,249 INFO L276 IsEmpty]: Start isEmpty. Operand 7053 states and 11024 transitions. [2022-12-13 11:45:13,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-12-13 11:45:13,250 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:45:13,250 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-12-13 11:45:13,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 11:45:13,251 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:45:13,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:45:13,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1217127572, now seen corresponding path program 1 times [2022-12-13 11:45:13,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:45:13,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617169222] [2022-12-13 11:45:13,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:45:13,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:45:13,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:45:13,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:45:13,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:45:13,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:45:13,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:45:13,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 11:45:13,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:45:13,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-12-13 11:45:13,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:45:13,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617169222] [2022-12-13 11:45:13,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617169222] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:45:13,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:45:13,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 11:45:13,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103927213] [2022-12-13 11:45:13,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:45:13,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:45:13,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:45:13,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:45:13,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:45:13,546 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-12-13 11:45:18,312 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-12-13 11:45:19,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:45:19,664 INFO L93 Difference]: Finished difference Result 8020 states and 12715 transitions. [2022-12-13 11:45:19,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 11:45:19,665 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-12-13 11:45:19,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:45:19,686 INFO L225 Difference]: With dead ends: 8020 [2022-12-13 11:45:19,686 INFO L226 Difference]: Without dead ends: 8002 [2022-12-13 11:45:19,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-12-13 11:45:19,690 INFO L413 NwaCegarLoop]: 583 mSDtfsCounter, 907 mSDsluCounter, 2093 mSDsCounter, 0 mSdLazyCounter, 1532 mSolverCounterSat, 335 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s 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, 5.4s IncrementalHoareTripleChecker+Time [2022-12-13 11:45:19,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [930 Valid, 2676 Invalid, 1868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [335 Valid, 1532 Invalid, 1 Unknown, 0 Unchecked, 5.4s Time] [2022-12-13 11:45:19,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8002 states. [2022-12-13 11:45:20,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8002 to 7051. [2022-12-13 11:45:20,181 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-12-13 11:45:20,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7051 states to 7051 states and 11020 transitions. [2022-12-13 11:45:20,202 INFO L78 Accepts]: Start accepts. Automaton has 7051 states and 11020 transitions. Word has length 53 [2022-12-13 11:45:20,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:45:20,203 INFO L495 AbstractCegarLoop]: Abstraction has 7051 states and 11020 transitions. [2022-12-13 11:45:20,203 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-12-13 11:45:20,203 INFO L276 IsEmpty]: Start isEmpty. Operand 7051 states and 11020 transitions. [2022-12-13 11:45:20,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-12-13 11:45:20,204 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:45:20,204 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-12-13 11:45:20,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 11:45:20,204 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:45:20,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:45:20,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1937199149, now seen corresponding path program 1 times [2022-12-13 11:45:20,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:45:20,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449575237] [2022-12-13 11:45:20,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:45:20,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:45:20,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:45:20,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:45:20,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:45:20,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:45:20,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:45:20,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:45:20,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:45:20,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449575237] [2022-12-13 11:45:20,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449575237] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:45:20,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:45:20,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 11:45:20,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958437619] [2022-12-13 11:45:20,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:45:20,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:45:20,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:45:20,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:45:20,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:45:20,452 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-12-13 11:45:24,381 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-12-13 11:45:25,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:45:25,461 INFO L93 Difference]: Finished difference Result 11721 states and 18614 transitions. [2022-12-13 11:45:25,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 11:45:25,461 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-12-13 11:45:25,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:45:25,476 INFO L225 Difference]: With dead ends: 11721 [2022-12-13 11:45:25,477 INFO L226 Difference]: Without dead ends: 7953 [2022-12-13 11:45:25,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2022-12-13 11:45:25,490 INFO L413 NwaCegarLoop]: 591 mSDtfsCounter, 1226 mSDsluCounter, 1168 mSDsCounter, 0 mSdLazyCounter, 1005 mSolverCounterSat, 311 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s 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, 4.3s IncrementalHoareTripleChecker+Time [2022-12-13 11:45:25,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1277 Valid, 1759 Invalid, 1317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [311 Valid, 1005 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2022-12-13 11:45:25,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7953 states. [2022-12-13 11:45:25,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7953 to 7041. [2022-12-13 11:45:25,896 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-12-13 11:45:25,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7041 states to 7041 states and 10999 transitions. [2022-12-13 11:45:25,917 INFO L78 Accepts]: Start accepts. Automaton has 7041 states and 10999 transitions. Word has length 52 [2022-12-13 11:45:25,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:45:25,918 INFO L495 AbstractCegarLoop]: Abstraction has 7041 states and 10999 transitions. [2022-12-13 11:45:25,918 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-12-13 11:45:25,918 INFO L276 IsEmpty]: Start isEmpty. Operand 7041 states and 10999 transitions. [2022-12-13 11:45:25,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-12-13 11:45:25,919 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:45:25,919 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-12-13 11:45:25,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 11:45:25,919 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:45:25,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:45:25,919 INFO L85 PathProgramCache]: Analyzing trace with hash 872726643, now seen corresponding path program 1 times [2022-12-13 11:45:25,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:45:25,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556806835] [2022-12-13 11:45:25,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:45:25,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:45:25,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:45:26,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:45:26,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:45:26,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:45:26,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:45:26,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 11:45:26,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:45:26,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 11:45:26,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:45:26,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:45:26,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:45:26,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556806835] [2022-12-13 11:45:26,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556806835] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:45:26,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:45:26,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 11:45:26,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116734167] [2022-12-13 11:45:26,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:45:26,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 11:45:26,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:45:26,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 11:45:26,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 11:45:26,252 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-12-13 11:45:30,665 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-12-13 11:45:32,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:45:32,213 INFO L93 Difference]: Finished difference Result 8024 states and 12754 transitions. [2022-12-13 11:45:32,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 11:45:32,214 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-12-13 11:45:32,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:45:32,234 INFO L225 Difference]: With dead ends: 8024 [2022-12-13 11:45:32,234 INFO L226 Difference]: Without dead ends: 8008 [2022-12-13 11:45:32,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-12-13 11:45:32,238 INFO L413 NwaCegarLoop]: 579 mSDtfsCounter, 978 mSDsluCounter, 2603 mSDsCounter, 0 mSdLazyCounter, 1867 mSolverCounterSat, 430 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s 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, 5.2s IncrementalHoareTripleChecker+Time [2022-12-13 11:45:32,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1001 Valid, 3182 Invalid, 2298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [430 Valid, 1867 Invalid, 1 Unknown, 0 Unchecked, 5.2s Time] [2022-12-13 11:45:32,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8008 states. [2022-12-13 11:45:32,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8008 to 7047. [2022-12-13 11:45:32,657 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-12-13 11:45:32,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7047 states to 7047 states and 11024 transitions. [2022-12-13 11:45:32,680 INFO L78 Accepts]: Start accepts. Automaton has 7047 states and 11024 transitions. Word has length 55 [2022-12-13 11:45:32,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:45:32,681 INFO L495 AbstractCegarLoop]: Abstraction has 7047 states and 11024 transitions. [2022-12-13 11:45:32,681 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-12-13 11:45:32,681 INFO L276 IsEmpty]: Start isEmpty. Operand 7047 states and 11024 transitions. [2022-12-13 11:45:32,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-12-13 11:45:32,682 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:45:32,682 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-12-13 11:45:32,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 11:45:32,682 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:45:32,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:45:32,682 INFO L85 PathProgramCache]: Analyzing trace with hash 555700014, now seen corresponding path program 1 times [2022-12-13 11:45:32,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:45:32,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760612907] [2022-12-13 11:45:32,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:45:32,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:45:32,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:45:32,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:45:32,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:45:32,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:45:32,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:45:32,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:45:32,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:45:32,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760612907] [2022-12-13 11:45:32,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760612907] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:45:32,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:45:32,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 11:45:32,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409284511] [2022-12-13 11:45:32,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:45:32,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:45:32,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:45:32,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:45:32,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:45:32,822 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-12-13 11:45:36,821 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-12-13 11:45:38,919 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-12-13 11:45:41,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:45:41,492 INFO L93 Difference]: Finished difference Result 10992 states and 17757 transitions. [2022-12-13 11:45:41,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 11:45:41,493 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-12-13 11:45:41,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:45:41,514 INFO L225 Difference]: With dead ends: 10992 [2022-12-13 11:45:41,514 INFO L226 Difference]: Without dead ends: 10979 [2022-12-13 11:45:41,517 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-12-13 11:45:41,518 INFO L413 NwaCegarLoop]: 1030 mSDtfsCounter, 998 mSDsluCounter, 1801 mSDsCounter, 0 mSdLazyCounter, 1357 mSolverCounterSat, 276 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s 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, 7.8s IncrementalHoareTripleChecker+Time [2022-12-13 11:45:41,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1029 Valid, 2831 Invalid, 1635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 1357 Invalid, 2 Unknown, 0 Unchecked, 7.8s Time] [2022-12-13 11:45:41,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10979 states. [2022-12-13 11:45:42,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10979 to 8362. [2022-12-13 11:45:42,042 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-12-13 11:45:42,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8362 states to 8362 states and 13139 transitions. [2022-12-13 11:45:42,067 INFO L78 Accepts]: Start accepts. Automaton has 8362 states and 13139 transitions. Word has length 54 [2022-12-13 11:45:42,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:45:42,068 INFO L495 AbstractCegarLoop]: Abstraction has 8362 states and 13139 transitions. [2022-12-13 11:45:42,068 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-12-13 11:45:42,068 INFO L276 IsEmpty]: Start isEmpty. Operand 8362 states and 13139 transitions. [2022-12-13 11:45:42,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-12-13 11:45:42,069 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:45:42,069 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-12-13 11:45:42,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 11:45:42,070 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:45:42,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:45:42,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1129689134, now seen corresponding path program 1 times [2022-12-13 11:45:42,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:45:42,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852945302] [2022-12-13 11:45:42,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:45:42,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:45:42,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:45:42,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:45:42,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:45:42,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:45:42,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:45:42,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:45:42,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:45:42,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852945302] [2022-12-13 11:45:42,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852945302] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:45:42,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:45:42,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 11:45:42,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939124370] [2022-12-13 11:45:42,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:45:42,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:45:42,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:45:42,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:45:42,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:45:42,302 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-12-13 11:45:46,851 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-12-13 11:45:48,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:45:48,059 INFO L93 Difference]: Finished difference Result 13163 states and 20813 transitions. [2022-12-13 11:45:48,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 11:45:48,060 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-12-13 11:45:48,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:45:48,079 INFO L225 Difference]: With dead ends: 13163 [2022-12-13 11:45:48,079 INFO L226 Difference]: Without dead ends: 8839 [2022-12-13 11:45:48,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2022-12-13 11:45:48,101 INFO L413 NwaCegarLoop]: 590 mSDtfsCounter, 1208 mSDsluCounter, 1169 mSDsCounter, 0 mSdLazyCounter, 960 mSolverCounterSat, 296 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s 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, 4.9s IncrementalHoareTripleChecker+Time [2022-12-13 11:45:48,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1259 Valid, 1759 Invalid, 1257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [296 Valid, 960 Invalid, 1 Unknown, 0 Unchecked, 4.9s Time] [2022-12-13 11:45:48,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8839 states. [2022-12-13 11:45:48,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8839 to 6799. [2022-12-13 11:45:48,569 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-12-13 11:45:48,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6799 states to 6799 states and 10455 transitions. [2022-12-13 11:45:48,587 INFO L78 Accepts]: Start accepts. Automaton has 6799 states and 10455 transitions. Word has length 54 [2022-12-13 11:45:48,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:45:48,587 INFO L495 AbstractCegarLoop]: Abstraction has 6799 states and 10455 transitions. [2022-12-13 11:45:48,587 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-12-13 11:45:48,587 INFO L276 IsEmpty]: Start isEmpty. Operand 6799 states and 10455 transitions. [2022-12-13 11:45:48,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-12-13 11:45:48,588 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:45:48,588 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-12-13 11:45:48,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 11:45:48,589 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:45:48,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:45:48,589 INFO L85 PathProgramCache]: Analyzing trace with hash 238766756, now seen corresponding path program 1 times [2022-12-13 11:45:48,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:45:48,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234726237] [2022-12-13 11:45:48,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:45:48,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:45:48,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:45:48,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:45:48,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:45:48,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:45:48,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:45:48,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 11:45:48,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:45:48,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:45:48,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:45:48,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234726237] [2022-12-13 11:45:48,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234726237] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:45:48,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:45:48,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 11:45:48,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337253673] [2022-12-13 11:45:48,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:45:48,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:45:48,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:45:48,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:45:48,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:45:48,800 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-12-13 11:45:53,238 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-12-13 11:45:54,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:45:54,554 INFO L93 Difference]: Finished difference Result 7691 states and 11990 transitions. [2022-12-13 11:45:54,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 11:45:54,555 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-12-13 11:45:54,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:45:54,571 INFO L225 Difference]: With dead ends: 7691 [2022-12-13 11:45:54,571 INFO L226 Difference]: Without dead ends: 7673 [2022-12-13 11:45:54,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-12-13 11:45:54,574 INFO L413 NwaCegarLoop]: 586 mSDtfsCounter, 900 mSDsluCounter, 2096 mSDsCounter, 0 mSdLazyCounter, 1531 mSolverCounterSat, 332 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s 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, 5.0s IncrementalHoareTripleChecker+Time [2022-12-13 11:45:54,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [923 Valid, 2682 Invalid, 1864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [332 Valid, 1531 Invalid, 1 Unknown, 0 Unchecked, 5.0s Time] [2022-12-13 11:45:54,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7673 states. [2022-12-13 11:45:55,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7673 to 6796. [2022-12-13 11:45:55,039 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-12-13 11:45:55,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6796 states to 6796 states and 10450 transitions. [2022-12-13 11:45:55,057 INFO L78 Accepts]: Start accepts. Automaton has 6796 states and 10450 transitions. Word has length 55 [2022-12-13 11:45:55,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:45:55,057 INFO L495 AbstractCegarLoop]: Abstraction has 6796 states and 10450 transitions. [2022-12-13 11:45:55,057 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-12-13 11:45:55,057 INFO L276 IsEmpty]: Start isEmpty. Operand 6796 states and 10450 transitions. [2022-12-13 11:45:55,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-12-13 11:45:55,058 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:45:55,058 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-12-13 11:45:55,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 11:45:55,058 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:45:55,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:45:55,059 INFO L85 PathProgramCache]: Analyzing trace with hash 499005845, now seen corresponding path program 1 times [2022-12-13 11:45:55,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:45:55,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644968427] [2022-12-13 11:45:55,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:45:55,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:45:55,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:45:55,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:45:55,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:45:55,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:45:55,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:45:55,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:45:55,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:45:55,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644968427] [2022-12-13 11:45:55,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644968427] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:45:55,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:45:55,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 11:45:55,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814122362] [2022-12-13 11:45:55,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:45:55,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:45:55,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:45:55,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:45:55,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:45:55,298 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-12-13 11:45:59,418 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-12-13 11:46:02,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:46:02,611 INFO L93 Difference]: Finished difference Result 9126 states and 14313 transitions. [2022-12-13 11:46:02,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 11:46:02,612 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-12-13 11:46:02,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:46:02,629 INFO L225 Difference]: With dead ends: 9126 [2022-12-13 11:46:02,629 INFO L226 Difference]: Without dead ends: 9122 [2022-12-13 11:46:02,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-12-13 11:46:02,632 INFO L413 NwaCegarLoop]: 975 mSDtfsCounter, 1708 mSDsluCounter, 1641 mSDsCounter, 0 mSdLazyCounter, 1436 mSolverCounterSat, 486 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1765 SdHoareTripleChecker+Valid, 2616 SdHoareTripleChecker+Invalid, 1923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 486 IncrementalHoareTripleChecker+Valid, 1436 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-12-13 11:46:02,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1765 Valid, 2616 Invalid, 1923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [486 Valid, 1436 Invalid, 1 Unknown, 0 Unchecked, 6.2s Time] [2022-12-13 11:46:02,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9122 states. [2022-12-13 11:46:03,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9122 to 6807. [2022-12-13 11:46:03,140 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-12-13 11:46:03,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6807 states to 6807 states and 10467 transitions. [2022-12-13 11:46:03,157 INFO L78 Accepts]: Start accepts. Automaton has 6807 states and 10467 transitions. Word has length 55 [2022-12-13 11:46:03,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:46:03,157 INFO L495 AbstractCegarLoop]: Abstraction has 6807 states and 10467 transitions. [2022-12-13 11:46:03,157 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-12-13 11:46:03,157 INFO L276 IsEmpty]: Start isEmpty. Operand 6807 states and 10467 transitions. [2022-12-13 11:46:03,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-12-13 11:46:03,158 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:46:03,158 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-12-13 11:46:03,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 11:46:03,158 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:46:03,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:46:03,158 INFO L85 PathProgramCache]: Analyzing trace with hash 499282675, now seen corresponding path program 1 times [2022-12-13 11:46:03,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:46:03,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432133014] [2022-12-13 11:46:03,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:46:03,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:46:03,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:03,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:46:03,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:03,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:46:03,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:03,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:46:03,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:46:03,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432133014] [2022-12-13 11:46:03,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432133014] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:46:03,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:46:03,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 11:46:03,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092435615] [2022-12-13 11:46:03,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:46:03,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 11:46:03,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:46:03,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 11:46:03,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 11:46:03,412 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-12-13 11:46:08,399 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-12-13 11:46:09,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:46:09,703 INFO L93 Difference]: Finished difference Result 7650 states and 11920 transitions. [2022-12-13 11:46:09,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 11:46:09,703 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-12-13 11:46:09,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:46:09,719 INFO L225 Difference]: With dead ends: 7650 [2022-12-13 11:46:09,719 INFO L226 Difference]: Without dead ends: 7607 [2022-12-13 11:46:09,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-12-13 11:46:09,722 INFO L413 NwaCegarLoop]: 609 mSDtfsCounter, 423 mSDsluCounter, 2955 mSDsCounter, 0 mSdLazyCounter, 1539 mSolverCounterSat, 179 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.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, 5.5s IncrementalHoareTripleChecker+Time [2022-12-13 11:46:09,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 3564 Invalid, 1719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 1539 Invalid, 1 Unknown, 0 Unchecked, 5.5s Time] [2022-12-13 11:46:09,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7607 states. [2022-12-13 11:46:10,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7607 to 6777. [2022-12-13 11:46:10,221 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-12-13 11:46:10,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6777 states to 6777 states and 10424 transitions. [2022-12-13 11:46:10,238 INFO L78 Accepts]: Start accepts. Automaton has 6777 states and 10424 transitions. Word has length 55 [2022-12-13 11:46:10,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:46:10,238 INFO L495 AbstractCegarLoop]: Abstraction has 6777 states and 10424 transitions. [2022-12-13 11:46:10,238 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-12-13 11:46:10,238 INFO L276 IsEmpty]: Start isEmpty. Operand 6777 states and 10424 transitions. [2022-12-13 11:46:10,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-12-13 11:46:10,239 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:46:10,239 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-12-13 11:46:10,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 11:46:10,239 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:46:10,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:46:10,240 INFO L85 PathProgramCache]: Analyzing trace with hash 948026652, now seen corresponding path program 1 times [2022-12-13 11:46:10,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:46:10,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727688522] [2022-12-13 11:46:10,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:46:10,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:46:10,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:10,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:46:10,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:10,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:46:10,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:10,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 11:46:10,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:10,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 11:46:10,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:10,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:46:10,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:46:10,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727688522] [2022-12-13 11:46:10,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727688522] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:46:10,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:46:10,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 11:46:10,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503253687] [2022-12-13 11:46:10,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:46:10,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 11:46:10,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:46:10,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 11:46:10,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-12-13 11:46:10,594 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-12-13 11:46:16,456 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-12-13 11:46:18,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:46:18,041 INFO L93 Difference]: Finished difference Result 13421 states and 21123 transitions. [2022-12-13 11:46:18,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 11:46:18,042 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-12-13 11:46:18,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:46:18,056 INFO L225 Difference]: With dead ends: 13421 [2022-12-13 11:46:18,057 INFO L226 Difference]: Without dead ends: 7857 [2022-12-13 11:46:18,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-12-13 11:46:18,067 INFO L413 NwaCegarLoop]: 558 mSDtfsCounter, 401 mSDsluCounter, 2420 mSDsCounter, 0 mSdLazyCounter, 1791 mSolverCounterSat, 208 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s 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, 6.6s IncrementalHoareTripleChecker+Time [2022-12-13 11:46:18,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 2978 Invalid, 2000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 1791 Invalid, 1 Unknown, 0 Unchecked, 6.6s Time] [2022-12-13 11:46:18,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7857 states. [2022-12-13 11:46:18,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7857 to 6853. [2022-12-13 11:46:18,563 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-12-13 11:46:18,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6853 states to 6853 states and 10551 transitions. [2022-12-13 11:46:18,582 INFO L78 Accepts]: Start accepts. Automaton has 6853 states and 10551 transitions. Word has length 60 [2022-12-13 11:46:18,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:46:18,582 INFO L495 AbstractCegarLoop]: Abstraction has 6853 states and 10551 transitions. [2022-12-13 11:46:18,582 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-12-13 11:46:18,582 INFO L276 IsEmpty]: Start isEmpty. Operand 6853 states and 10551 transitions. [2022-12-13 11:46:18,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-12-13 11:46:18,583 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:46:18,583 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-12-13 11:46:18,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-13 11:46:18,584 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:46:18,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:46:18,584 INFO L85 PathProgramCache]: Analyzing trace with hash -749476623, now seen corresponding path program 1 times [2022-12-13 11:46:18,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:46:18,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294397123] [2022-12-13 11:46:18,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:46:18,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:46:18,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:18,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:46:18,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:18,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:46:18,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:18,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 11:46:18,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:18,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 11:46:18,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:18,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:46:18,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:46:18,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294397123] [2022-12-13 11:46:18,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294397123] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:46:18,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:46:18,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-13 11:46:18,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437058646] [2022-12-13 11:46:18,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:46:18,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 11:46:18,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:46:18,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 11:46:18,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-12-13 11:46:18,986 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-12-13 11:46:24,113 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-12-13 11:46:25,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:46:25,734 INFO L93 Difference]: Finished difference Result 7755 states and 12177 transitions. [2022-12-13 11:46:25,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 11:46:25,735 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-12-13 11:46:25,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:46:25,750 INFO L225 Difference]: With dead ends: 7755 [2022-12-13 11:46:25,750 INFO L226 Difference]: Without dead ends: 7741 [2022-12-13 11:46:25,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2022-12-13 11:46:25,753 INFO L413 NwaCegarLoop]: 524 mSDtfsCounter, 952 mSDsluCounter, 3500 mSDsCounter, 0 mSdLazyCounter, 3004 mSolverCounterSat, 426 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.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, 5.8s IncrementalHoareTripleChecker+Time [2022-12-13 11:46:25,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [976 Valid, 4024 Invalid, 3431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [426 Valid, 3004 Invalid, 1 Unknown, 0 Unchecked, 5.8s Time] [2022-12-13 11:46:25,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7741 states. [2022-12-13 11:46:26,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7741 to 6855. [2022-12-13 11:46:26,284 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-12-13 11:46:26,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6855 states to 6855 states and 10567 transitions. [2022-12-13 11:46:26,302 INFO L78 Accepts]: Start accepts. Automaton has 6855 states and 10567 transitions. Word has length 62 [2022-12-13 11:46:26,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:46:26,302 INFO L495 AbstractCegarLoop]: Abstraction has 6855 states and 10567 transitions. [2022-12-13 11:46:26,302 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-12-13 11:46:26,302 INFO L276 IsEmpty]: Start isEmpty. Operand 6855 states and 10567 transitions. [2022-12-13 11:46:26,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-12-13 11:46:26,303 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:46:26,303 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-12-13 11:46:26,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-13 11:46:26,304 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:46:26,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:46:26,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1416668636, now seen corresponding path program 1 times [2022-12-13 11:46:26,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:46:26,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215527342] [2022-12-13 11:46:26,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:46:26,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:46:26,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:26,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:46:26,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:26,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:46:26,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:26,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 11:46:26,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:26,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 11:46:26,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:26,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:46:26,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:26,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 11:46:26,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:26,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:46:26,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:46:26,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215527342] [2022-12-13 11:46:26,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215527342] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:46:26,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:46:26,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 11:46:26,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322940273] [2022-12-13 11:46:26,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:46:26,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:46:26,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:46:26,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:46:26,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:46:26,539 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-12-13 11:46:30,611 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-12-13 11:46:32,623 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-12-13 11:46:36,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:46:36,624 INFO L93 Difference]: Finished difference Result 10875 states and 17003 transitions. [2022-12-13 11:46:36,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 11:46:36,625 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-12-13 11:46:36,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:46:36,640 INFO L225 Difference]: With dead ends: 10875 [2022-12-13 11:46:36,640 INFO L226 Difference]: Without dead ends: 7624 [2022-12-13 11:46:36,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2022-12-13 11:46:36,648 INFO L413 NwaCegarLoop]: 948 mSDtfsCounter, 965 mSDsluCounter, 1881 mSDsCounter, 0 mSdLazyCounter, 1901 mSolverCounterSat, 347 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s 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, 8.8s IncrementalHoareTripleChecker+Time [2022-12-13 11:46:36,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1008 Valid, 2829 Invalid, 2250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [347 Valid, 1901 Invalid, 2 Unknown, 0 Unchecked, 8.8s Time] [2022-12-13 11:46:36,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7624 states. [2022-12-13 11:46:37,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7624 to 6723. [2022-12-13 11:46:37,204 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-12-13 11:46:37,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6723 states to 6723 states and 10334 transitions. [2022-12-13 11:46:37,220 INFO L78 Accepts]: Start accepts. Automaton has 6723 states and 10334 transitions. Word has length 65 [2022-12-13 11:46:37,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:46:37,221 INFO L495 AbstractCegarLoop]: Abstraction has 6723 states and 10334 transitions. [2022-12-13 11:46:37,221 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-12-13 11:46:37,221 INFO L276 IsEmpty]: Start isEmpty. Operand 6723 states and 10334 transitions. [2022-12-13 11:46:37,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-12-13 11:46:37,222 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:46:37,222 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-12-13 11:46:37,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-13 11:46:37,222 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:46:37,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:46:37,222 INFO L85 PathProgramCache]: Analyzing trace with hash -340114262, now seen corresponding path program 1 times [2022-12-13 11:46:37,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:46:37,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108622230] [2022-12-13 11:46:37,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:46:37,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:46:37,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:37,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:46:37,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:37,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:46:37,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:37,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 11:46:37,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:37,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:46:37,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:37,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-12-13 11:46:37,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:37,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:46:37,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:46:37,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108622230] [2022-12-13 11:46:37,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108622230] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:46:37,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:46:37,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 11:46:37,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963264902] [2022-12-13 11:46:37,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:46:37,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:46:37,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:46:37,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:46:37,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:46:37,467 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-12-13 11:46:41,568 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-12-13 11:46:42,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:46:42,970 INFO L93 Difference]: Finished difference Result 13105 states and 20530 transitions. [2022-12-13 11:46:42,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 11:46:42,971 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-12-13 11:46:42,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:46:42,987 INFO L225 Difference]: With dead ends: 13105 [2022-12-13 11:46:42,987 INFO L226 Difference]: Without dead ends: 7568 [2022-12-13 11:46:43,000 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-12-13 11:46:43,001 INFO L413 NwaCegarLoop]: 571 mSDtfsCounter, 466 mSDsluCounter, 1159 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 265 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s 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, 4.5s IncrementalHoareTripleChecker+Time [2022-12-13 11:46:43,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 1730 Invalid, 1172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 906 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2022-12-13 11:46:43,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7568 states. [2022-12-13 11:46:43,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7568 to 6629. [2022-12-13 11:46:43,608 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-12-13 11:46:43,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6629 states to 6629 states and 10199 transitions. [2022-12-13 11:46:43,626 INFO L78 Accepts]: Start accepts. Automaton has 6629 states and 10199 transitions. Word has length 66 [2022-12-13 11:46:43,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:46:43,626 INFO L495 AbstractCegarLoop]: Abstraction has 6629 states and 10199 transitions. [2022-12-13 11:46:43,626 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-12-13 11:46:43,626 INFO L276 IsEmpty]: Start isEmpty. Operand 6629 states and 10199 transitions. [2022-12-13 11:46:43,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-12-13 11:46:43,627 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:46:43,627 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-12-13 11:46:43,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-13 11:46:43,627 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:46:43,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:46:43,628 INFO L85 PathProgramCache]: Analyzing trace with hash 437037204, now seen corresponding path program 1 times [2022-12-13 11:46:43,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:46:43,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257232558] [2022-12-13 11:46:43,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:46:43,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:46:43,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:43,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:46:43,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:43,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:46:43,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:43,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 11:46:43,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:43,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:46:43,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:46:43,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257232558] [2022-12-13 11:46:43,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257232558] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:46:43,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:46:43,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 11:46:43,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922512941] [2022-12-13 11:46:43,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:46:43,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 11:46:43,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:46:43,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 11:46:43,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-12-13 11:46:43,954 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-12-13 11:46:49,787 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-12-13 11:46:51,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:46:51,798 INFO L93 Difference]: Finished difference Result 7477 states and 11670 transitions. [2022-12-13 11:46:51,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 11:46:51,799 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-12-13 11:46:51,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:46:51,812 INFO L225 Difference]: With dead ends: 7477 [2022-12-13 11:46:51,813 INFO L226 Difference]: Without dead ends: 7459 [2022-12-13 11:46:51,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2022-12-13 11:46:51,815 INFO L413 NwaCegarLoop]: 531 mSDtfsCounter, 902 mSDsluCounter, 3120 mSDsCounter, 0 mSdLazyCounter, 2630 mSolverCounterSat, 331 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s 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, 6.7s IncrementalHoareTripleChecker+Time [2022-12-13 11:46:51,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [926 Valid, 3651 Invalid, 2962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [331 Valid, 2630 Invalid, 1 Unknown, 0 Unchecked, 6.7s Time] [2022-12-13 11:46:51,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7459 states. [2022-12-13 11:46:52,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7459 to 6625. [2022-12-13 11:46:52,373 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-12-13 11:46:52,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6625 states to 6625 states and 10193 transitions. [2022-12-13 11:46:52,390 INFO L78 Accepts]: Start accepts. Automaton has 6625 states and 10193 transitions. Word has length 65 [2022-12-13 11:46:52,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:46:52,390 INFO L495 AbstractCegarLoop]: Abstraction has 6625 states and 10193 transitions. [2022-12-13 11:46:52,390 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-12-13 11:46:52,391 INFO L276 IsEmpty]: Start isEmpty. Operand 6625 states and 10193 transitions. [2022-12-13 11:46:52,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-12-13 11:46:52,391 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:46:52,392 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-12-13 11:46:52,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-13 11:46:52,392 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:46:52,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:46:52,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1869722635, now seen corresponding path program 1 times [2022-12-13 11:46:52,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:46:52,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544288571] [2022-12-13 11:46:52,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:46:52,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:46:52,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:52,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:46:52,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:52,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:46:52,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:52,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 11:46:52,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:52,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 11:46:52,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:52,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:46:52,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:46:52,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544288571] [2022-12-13 11:46:52,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544288571] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:46:52,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:46:52,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 11:46:52,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598656246] [2022-12-13 11:46:52,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:46:52,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:46:52,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:46:52,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:46:52,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:46:52,609 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-12-13 11:46:58,325 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-12-13 11:46:59,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:46:59,827 INFO L93 Difference]: Finished difference Result 10441 states and 16350 transitions. [2022-12-13 11:46:59,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 11:46:59,828 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-12-13 11:46:59,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:46:59,841 INFO L225 Difference]: With dead ends: 10441 [2022-12-13 11:46:59,841 INFO L226 Difference]: Without dead ends: 7793 [2022-12-13 11:46:59,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-12-13 11:46:59,849 INFO L413 NwaCegarLoop]: 520 mSDtfsCounter, 954 mSDsluCounter, 1322 mSDsCounter, 0 mSdLazyCounter, 1288 mSolverCounterSat, 358 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s 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.3s IncrementalHoareTripleChecker+Time [2022-12-13 11:46:59,849 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.3s Time] [2022-12-13 11:46:59,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7793 states. [2022-12-13 11:47:00,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7793 to 6847. [2022-12-13 11:47:00,438 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-12-13 11:47:00,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6847 states to 6847 states and 10500 transitions. [2022-12-13 11:47:00,455 INFO L78 Accepts]: Start accepts. Automaton has 6847 states and 10500 transitions. Word has length 67 [2022-12-13 11:47:00,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:47:00,455 INFO L495 AbstractCegarLoop]: Abstraction has 6847 states and 10500 transitions. [2022-12-13 11:47:00,455 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-12-13 11:47:00,455 INFO L276 IsEmpty]: Start isEmpty. Operand 6847 states and 10500 transitions. [2022-12-13 11:47:00,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-12-13 11:47:00,456 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:47:00,456 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-12-13 11:47:00,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-13 11:47:00,456 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:47:00,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:47:00,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1466440038, now seen corresponding path program 1 times [2022-12-13 11:47:00,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:47:00,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27947534] [2022-12-13 11:47:00,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:47:00,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:47:00,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:47:00,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:47:00,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:47:00,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:47:00,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:47:00,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 11:47:00,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:47:00,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 11:47:00,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:47:00,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 11:47:00,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:47:00,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:47:00,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:47:00,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27947534] [2022-12-13 11:47:00,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27947534] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:47:00,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:47:00,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 11:47:00,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785688704] [2022-12-13 11:47:00,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:47:00,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:47:00,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:47:00,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:47:00,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:47:00,699 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-12-13 11:47:04,817 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-12-13 11:47:08,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:47:08,455 INFO L93 Difference]: Finished difference Result 9490 states and 14566 transitions. [2022-12-13 11:47:08,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 11:47:08,456 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-12-13 11:47:08,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:47:08,471 INFO L225 Difference]: With dead ends: 9490 [2022-12-13 11:47:08,471 INFO L226 Difference]: Without dead ends: 5437 [2022-12-13 11:47:08,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2022-12-13 11:47:08,483 INFO L413 NwaCegarLoop]: 757 mSDtfsCounter, 2908 mSDsluCounter, 1946 mSDsCounter, 0 mSdLazyCounter, 2165 mSolverCounterSat, 796 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2968 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, 6.8s IncrementalHoareTripleChecker+Time [2022-12-13 11:47:08,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2968 Valid, 2703 Invalid, 2962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [796 Valid, 2165 Invalid, 1 Unknown, 0 Unchecked, 6.8s Time] [2022-12-13 11:47:08,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5437 states. [2022-12-13 11:47:08,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5437 to 4456. [2022-12-13 11:47:08,908 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-12-13 11:47:08,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4456 states to 4456 states and 6623 transitions. [2022-12-13 11:47:08,916 INFO L78 Accepts]: Start accepts. Automaton has 4456 states and 6623 transitions. Word has length 69 [2022-12-13 11:47:08,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:47:08,917 INFO L495 AbstractCegarLoop]: Abstraction has 4456 states and 6623 transitions. [2022-12-13 11:47:08,917 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-12-13 11:47:08,917 INFO L276 IsEmpty]: Start isEmpty. Operand 4456 states and 6623 transitions. [2022-12-13 11:47:08,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-12-13 11:47:08,918 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:47:08,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:47:08,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-13 11:47:08,918 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:47:08,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:47:08,918 INFO L85 PathProgramCache]: Analyzing trace with hash -677342089, now seen corresponding path program 1 times [2022-12-13 11:47:08,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:47:08,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152833731] [2022-12-13 11:47:08,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:47:08,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:47:08,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:47:09,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:47:09,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:47:09,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:47:09,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:47:09,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 11:47:09,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:47:09,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 11:47:09,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:47:09,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:47:09,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:47:09,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152833731] [2022-12-13 11:47:09,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152833731] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:47:09,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:47:09,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 11:47:09,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549715627] [2022-12-13 11:47:09,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:47:09,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:47:09,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:47:09,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:47:09,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:47:09,185 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-12-13 11:47:13,700 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-12-13 11:47:15,709 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-12-13 11:47:17,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:47:17,466 INFO L93 Difference]: Finished difference Result 7882 states and 11879 transitions. [2022-12-13 11:47:17,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 11:47:17,467 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-12-13 11:47:17,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:47:17,476 INFO L225 Difference]: With dead ends: 7882 [2022-12-13 11:47:17,476 INFO L226 Difference]: Without dead ends: 5395 [2022-12-13 11:47:17,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-12-13 11:47:17,482 INFO L413 NwaCegarLoop]: 529 mSDtfsCounter, 837 mSDsluCounter, 1604 mSDsCounter, 0 mSdLazyCounter, 1694 mSolverCounterSat, 140 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s 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, 7.4s IncrementalHoareTripleChecker+Time [2022-12-13 11:47:17,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [860 Valid, 2133 Invalid, 1836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 1694 Invalid, 2 Unknown, 0 Unchecked, 7.4s Time] [2022-12-13 11:47:17,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5395 states. [2022-12-13 11:47:17,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5395 to 4432. [2022-12-13 11:47:17,922 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-12-13 11:47:17,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4432 states to 4432 states and 6593 transitions. [2022-12-13 11:47:17,931 INFO L78 Accepts]: Start accepts. Automaton has 4432 states and 6593 transitions. Word has length 68 [2022-12-13 11:47:17,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:47:17,931 INFO L495 AbstractCegarLoop]: Abstraction has 4432 states and 6593 transitions. [2022-12-13 11:47:17,931 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-12-13 11:47:17,931 INFO L276 IsEmpty]: Start isEmpty. Operand 4432 states and 6593 transitions. [2022-12-13 11:47:17,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-12-13 11:47:17,932 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:47:17,932 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-12-13 11:47:17,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-13 11:47:17,932 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:47:17,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:47:17,933 INFO L85 PathProgramCache]: Analyzing trace with hash -554272668, now seen corresponding path program 1 times [2022-12-13 11:47:17,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:47:17,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014554836] [2022-12-13 11:47:17,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:47:17,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:47:17,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:47:18,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:47:18,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:47:18,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:47:18,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:47:18,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 11:47:18,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:47:18,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 11:47:18,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:47:18,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 11:47:18,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:47:18,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-12-13 11:47:18,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:47:18,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:47:18,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:47:18,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014554836] [2022-12-13 11:47:18,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014554836] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:47:18,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:47:18,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 11:47:18,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055492472] [2022-12-13 11:47:18,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:47:18,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:47:18,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:47:18,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:47:18,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:47:18,145 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-12-13 11:47:22,601 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-12-13 11:47:24,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:47:24,328 INFO L93 Difference]: Finished difference Result 7928 states and 11993 transitions. [2022-12-13 11:47:24,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 11:47:24,329 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-12-13 11:47:24,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:47:24,340 INFO L225 Difference]: With dead ends: 7928 [2022-12-13 11:47:24,341 INFO L226 Difference]: Without dead ends: 5377 [2022-12-13 11:47:24,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2022-12-13 11:47:24,346 INFO L413 NwaCegarLoop]: 507 mSDtfsCounter, 1469 mSDsluCounter, 1585 mSDsCounter, 0 mSdLazyCounter, 1394 mSolverCounterSat, 539 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s 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, 5.1s IncrementalHoareTripleChecker+Time [2022-12-13 11:47:24,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1479 Valid, 2092 Invalid, 1934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [539 Valid, 1394 Invalid, 1 Unknown, 0 Unchecked, 5.1s Time] [2022-12-13 11:47:24,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5377 states. [2022-12-13 11:47:24,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5377 to 4423. [2022-12-13 11:47:24,774 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-12-13 11:47:24,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4423 states to 4423 states and 6570 transitions. [2022-12-13 11:47:24,782 INFO L78 Accepts]: Start accepts. Automaton has 4423 states and 6570 transitions. Word has length 71 [2022-12-13 11:47:24,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:47:24,783 INFO L495 AbstractCegarLoop]: Abstraction has 4423 states and 6570 transitions. [2022-12-13 11:47:24,783 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-12-13 11:47:24,783 INFO L276 IsEmpty]: Start isEmpty. Operand 4423 states and 6570 transitions. [2022-12-13 11:47:24,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-12-13 11:47:24,784 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:47:24,784 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-12-13 11:47:24,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-13 11:47:24,784 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:47:24,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:47:24,784 INFO L85 PathProgramCache]: Analyzing trace with hash 827121083, now seen corresponding path program 1 times [2022-12-13 11:47:24,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:47:24,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266305395] [2022-12-13 11:47:24,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:47:24,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:47:24,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:47:25,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:47:25,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:47:25,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:47:25,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:47:25,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 11:47:25,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:47:25,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-12-13 11:47:25,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:47:25,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:47:25,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:47:25,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266305395] [2022-12-13 11:47:25,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266305395] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:47:25,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:47:25,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 11:47:25,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586843518] [2022-12-13 11:47:25,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:47:25,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 11:47:25,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:47:25,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 11:47:25,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 11:47:25,148 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-12-13 11:47:29,630 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-12-13 11:47:31,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:47:31,116 INFO L93 Difference]: Finished difference Result 5300 states and 8024 transitions. [2022-12-13 11:47:31,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 11:47:31,117 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-12-13 11:47:31,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:47:31,126 INFO L225 Difference]: With dead ends: 5300 [2022-12-13 11:47:31,126 INFO L226 Difference]: Without dead ends: 5280 [2022-12-13 11:47:31,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-12-13 11:47:31,128 INFO L413 NwaCegarLoop]: 533 mSDtfsCounter, 993 mSDsluCounter, 2337 mSDsCounter, 0 mSdLazyCounter, 1818 mSolverCounterSat, 419 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s 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, 5.2s IncrementalHoareTripleChecker+Time [2022-12-13 11:47:31,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1016 Valid, 2870 Invalid, 2238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [419 Valid, 1818 Invalid, 1 Unknown, 0 Unchecked, 5.2s Time] [2022-12-13 11:47:31,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5280 states. [2022-12-13 11:47:31,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5280 to 4422. [2022-12-13 11:47:31,554 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-12-13 11:47:31,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4422 states to 4422 states and 6567 transitions. [2022-12-13 11:47:31,562 INFO L78 Accepts]: Start accepts. Automaton has 4422 states and 6567 transitions. Word has length 68 [2022-12-13 11:47:31,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:47:31,562 INFO L495 AbstractCegarLoop]: Abstraction has 4422 states and 6567 transitions. [2022-12-13 11:47:31,562 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-12-13 11:47:31,563 INFO L276 IsEmpty]: Start isEmpty. Operand 4422 states and 6567 transitions. [2022-12-13 11:47:31,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-12-13 11:47:31,564 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:47:31,564 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-12-13 11:47:31,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-13 11:47:31,564 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:47:31,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:47:31,565 INFO L85 PathProgramCache]: Analyzing trace with hash 463590116, now seen corresponding path program 1 times [2022-12-13 11:47:31,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:47:31,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255716705] [2022-12-13 11:47:31,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:47:31,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:47:31,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:47:31,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:47:31,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:47:31,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:47:31,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:47:31,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 11:47:31,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:47:31,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 11:47:31,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:47:31,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:47:31,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:47:31,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255716705] [2022-12-13 11:47:31,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255716705] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:47:31,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:47:31,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 11:47:31,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264693011] [2022-12-13 11:47:31,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:47:31,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 11:47:31,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:47:31,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 11:47:31,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-13 11:47:31,947 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-12-13 11:47:37,020 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-12-13 11:47:38,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:47:38,697 INFO L93 Difference]: Finished difference Result 5362 states and 8158 transitions. [2022-12-13 11:47:38,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 11:47:38,698 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-12-13 11:47:38,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:47:38,706 INFO L225 Difference]: With dead ends: 5362 [2022-12-13 11:47:38,706 INFO L226 Difference]: Without dead ends: 5346 [2022-12-13 11:47:38,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2022-12-13 11:47:38,707 INFO L413 NwaCegarLoop]: 526 mSDtfsCounter, 998 mSDsluCounter, 2763 mSDsCounter, 0 mSdLazyCounter, 2228 mSolverCounterSat, 427 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s 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, 5.9s IncrementalHoareTripleChecker+Time [2022-12-13 11:47:38,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1021 Valid, 3289 Invalid, 2656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [427 Valid, 2228 Invalid, 1 Unknown, 0 Unchecked, 5.9s Time] [2022-12-13 11:47:38,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5346 states. [2022-12-13 11:47:39,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5346 to 4427. [2022-12-13 11:47:39,130 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-12-13 11:47:39,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4427 states to 4427 states and 6576 transitions. [2022-12-13 11:47:39,138 INFO L78 Accepts]: Start accepts. Automaton has 4427 states and 6576 transitions. Word has length 69 [2022-12-13 11:47:39,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:47:39,138 INFO L495 AbstractCegarLoop]: Abstraction has 4427 states and 6576 transitions. [2022-12-13 11:47:39,138 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-12-13 11:47:39,138 INFO L276 IsEmpty]: Start isEmpty. Operand 4427 states and 6576 transitions. [2022-12-13 11:47:39,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-12-13 11:47:39,139 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:47:39,139 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-12-13 11:47:39,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-13 11:47:39,139 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:47:39,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:47:39,140 INFO L85 PathProgramCache]: Analyzing trace with hash -669900528, now seen corresponding path program 1 times [2022-12-13 11:47:39,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:47:39,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878067001] [2022-12-13 11:47:39,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:47:39,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:47:39,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:47:39,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:47:39,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:47:39,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:47:39,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:47:39,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 11:47:39,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:47:39,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 11:47:39,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:47:39,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:47:39,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:47:39,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878067001] [2022-12-13 11:47:39,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878067001] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:47:39,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:47:39,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 11:47:39,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340675733] [2022-12-13 11:47:39,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:47:39,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 11:47:39,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:47:39,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 11:47:39,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-13 11:47:39,620 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-12-13 11:47:44,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-12-13 11:47:46,659 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-12-13 11:47:48,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:47:48,160 INFO L93 Difference]: Finished difference Result 9525 states and 14480 transitions. [2022-12-13 11:47:48,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 11:47:48,161 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-12-13 11:47:48,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:47:48,170 INFO L225 Difference]: With dead ends: 9525 [2022-12-13 11:47:48,170 INFO L226 Difference]: Without dead ends: 5473 [2022-12-13 11:47:48,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-12-13 11:47:48,177 INFO L413 NwaCegarLoop]: 567 mSDtfsCounter, 405 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 1453 mSolverCounterSat, 94 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s 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, 7.7s IncrementalHoareTripleChecker+Time [2022-12-13 11:47:48,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 2523 Invalid, 1549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1453 Invalid, 2 Unknown, 0 Unchecked, 7.7s Time] [2022-12-13 11:47:48,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5473 states. [2022-12-13 11:47:48,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5473 to 4455. [2022-12-13 11:47:48,650 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-12-13 11:47:48,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4455 states to 4455 states and 6604 transitions. [2022-12-13 11:47:48,658 INFO L78 Accepts]: Start accepts. Automaton has 4455 states and 6604 transitions. Word has length 69 [2022-12-13 11:47:48,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:47:48,658 INFO L495 AbstractCegarLoop]: Abstraction has 4455 states and 6604 transitions. [2022-12-13 11:47:48,658 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-12-13 11:47:48,658 INFO L276 IsEmpty]: Start isEmpty. Operand 4455 states and 6604 transitions. [2022-12-13 11:47:48,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-12-13 11:47:48,659 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:47:48,659 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-12-13 11:47:48,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-12-13 11:47:48,659 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:47:48,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:47:48,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1685614928, now seen corresponding path program 1 times [2022-12-13 11:47:48,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:47:48,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643311477] [2022-12-13 11:47:48,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:47:48,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:47:48,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:47:48,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:47:48,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:47:48,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:47:48,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:47:48,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 11:47:48,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:47:49,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 11:47:49,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:47:49,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:47:49,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:47:49,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643311477] [2022-12-13 11:47:49,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643311477] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:47:49,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:47:49,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 11:47:49,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635323939] [2022-12-13 11:47:49,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:47:49,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 11:47:49,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:47:49,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 11:47:49,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-12-13 11:47:49,095 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-12-13 11:47:53,906 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-12-13 11:47:55,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:47:55,396 INFO L93 Difference]: Finished difference Result 9445 states and 14286 transitions. [2022-12-13 11:47:55,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 11:47:55,397 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-12-13 11:47:55,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:47:55,409 INFO L225 Difference]: With dead ends: 9445 [2022-12-13 11:47:55,410 INFO L226 Difference]: Without dead ends: 5384 [2022-12-13 11:47:55,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-12-13 11:47:55,417 INFO L413 NwaCegarLoop]: 550 mSDtfsCounter, 570 mSDsluCounter, 2601 mSDsCounter, 0 mSdLazyCounter, 1678 mSolverCounterSat, 366 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s 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, 5.3s IncrementalHoareTripleChecker+Time [2022-12-13 11:47:55,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [584 Valid, 3151 Invalid, 2045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [366 Valid, 1678 Invalid, 1 Unknown, 0 Unchecked, 5.3s Time] [2022-12-13 11:47:55,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5384 states. [2022-12-13 11:47:55,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5384 to 4434. [2022-12-13 11:47:55,900 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-12-13 11:47:55,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4434 states to 4434 states and 6545 transitions. [2022-12-13 11:47:55,909 INFO L78 Accepts]: Start accepts. Automaton has 4434 states and 6545 transitions. Word has length 69 [2022-12-13 11:47:55,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:47:55,909 INFO L495 AbstractCegarLoop]: Abstraction has 4434 states and 6545 transitions. [2022-12-13 11:47:55,909 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-12-13 11:47:55,909 INFO L276 IsEmpty]: Start isEmpty. Operand 4434 states and 6545 transitions. [2022-12-13 11:47:55,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-12-13 11:47:55,910 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:47:55,910 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-12-13 11:47:55,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-12-13 11:47:55,910 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:47:55,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:47:55,911 INFO L85 PathProgramCache]: Analyzing trace with hash 277949588, now seen corresponding path program 1 times [2022-12-13 11:47:55,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:47:55,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953794] [2022-12-13 11:47:55,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:47:55,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:47:55,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:47:56,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:47:56,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:47:56,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:47:56,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:47:56,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 11:47:56,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:47:56,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 11:47:56,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:47:56,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 11:47:56,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:47:56,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:47:56,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:47:56,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953794] [2022-12-13 11:47:56,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953794] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:47:56,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:47:56,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-13 11:47:56,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081419000] [2022-12-13 11:47:56,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:47:56,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 11:47:56,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:47:56,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 11:47:56,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-12-13 11:47:56,330 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-12-13 11:48:03,121 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-12-13 11:48:05,135 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-12-13 11:48:07,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:48:07,390 INFO L93 Difference]: Finished difference Result 8059 states and 12189 transitions. [2022-12-13 11:48:07,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 11:48:07,391 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-12-13 11:48:07,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:48:07,399 INFO L225 Difference]: With dead ends: 8059 [2022-12-13 11:48:07,400 INFO L226 Difference]: Without dead ends: 5579 [2022-12-13 11:48:07,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2022-12-13 11:48:07,404 INFO L413 NwaCegarLoop]: 527 mSDtfsCounter, 863 mSDsluCounter, 3644 mSDsCounter, 0 mSdLazyCounter, 3169 mSolverCounterSat, 244 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 886 SdHoareTripleChecker+Valid, 4171 SdHoareTripleChecker+Invalid, 3415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 3169 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.0s IncrementalHoareTripleChecker+Time [2022-12-13 11:48:07,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [886 Valid, 4171 Invalid, 3415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 3169 Invalid, 2 Unknown, 0 Unchecked, 10.0s Time] [2022-12-13 11:48:07,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5579 states. [2022-12-13 11:48:07,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5579 to 4492. [2022-12-13 11:48:07,858 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-12-13 11:48:07,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4492 states to 4492 states and 6634 transitions. [2022-12-13 11:48:07,866 INFO L78 Accepts]: Start accepts. Automaton has 4492 states and 6634 transitions. Word has length 71 [2022-12-13 11:48:07,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:48:07,866 INFO L495 AbstractCegarLoop]: Abstraction has 4492 states and 6634 transitions. [2022-12-13 11:48:07,866 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-12-13 11:48:07,867 INFO L276 IsEmpty]: Start isEmpty. Operand 4492 states and 6634 transitions. [2022-12-13 11:48:07,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-12-13 11:48:07,867 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:48:07,868 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-12-13 11:48:07,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-12-13 11:48:07,868 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:48:07,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:48:07,868 INFO L85 PathProgramCache]: Analyzing trace with hash 302497870, now seen corresponding path program 1 times [2022-12-13 11:48:07,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:48:07,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911696616] [2022-12-13 11:48:07,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:48:07,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:48:07,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:48:08,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:48:08,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:48:08,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:48:08,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:48:08,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 11:48:08,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:48:08,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 11:48:08,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:48:08,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:48:08,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:48:08,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911696616] [2022-12-13 11:48:08,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911696616] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:48:08,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:48:08,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 11:48:08,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163645437] [2022-12-13 11:48:08,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:48:08,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 11:48:08,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:48:08,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 11:48:08,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-12-13 11:48:08,253 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-12-13 11:48:13,907 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-12-13 11:48:15,912 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-12-13 11:48:17,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:48:17,693 INFO L93 Difference]: Finished difference Result 9698 states and 14628 transitions. [2022-12-13 11:48:17,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 11:48:17,694 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-12-13 11:48:17,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:48:17,706 INFO L225 Difference]: With dead ends: 9698 [2022-12-13 11:48:17,706 INFO L226 Difference]: Without dead ends: 5600 [2022-12-13 11:48:17,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-12-13 11:48:17,713 INFO L413 NwaCegarLoop]: 543 mSDtfsCounter, 413 mSDsluCounter, 2316 mSDsCounter, 0 mSdLazyCounter, 1794 mSolverCounterSat, 125 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s 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, 8.4s IncrementalHoareTripleChecker+Time [2022-12-13 11:48:17,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 2859 Invalid, 1921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 1794 Invalid, 2 Unknown, 0 Unchecked, 8.4s Time] [2022-12-13 11:48:17,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5600 states. [2022-12-13 11:48:18,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5600 to 4504. [2022-12-13 11:48:18,396 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-12-13 11:48:18,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4504 states to 4504 states and 6646 transitions. [2022-12-13 11:48:18,404 INFO L78 Accepts]: Start accepts. Automaton has 4504 states and 6646 transitions. Word has length 70 [2022-12-13 11:48:18,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:48:18,404 INFO L495 AbstractCegarLoop]: Abstraction has 4504 states and 6646 transitions. [2022-12-13 11:48:18,404 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-12-13 11:48:18,404 INFO L276 IsEmpty]: Start isEmpty. Operand 4504 states and 6646 transitions. [2022-12-13 11:48:18,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-12-13 11:48:18,405 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:48:18,405 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-12-13 11:48:18,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-12-13 11:48:18,406 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:48:18,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:48:18,406 INFO L85 PathProgramCache]: Analyzing trace with hash 965591191, now seen corresponding path program 1 times [2022-12-13 11:48:18,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:48:18,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794354758] [2022-12-13 11:48:18,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:48:18,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:48:18,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:48:18,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:48:18,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:48:18,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:48:18,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:48:18,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 11:48:18,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:48:18,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-12-13 11:48:18,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:48:18,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794354758] [2022-12-13 11:48:18,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794354758] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:48:18,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:48:18,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 11:48:18,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18345086] [2022-12-13 11:48:18,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:48:18,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 11:48:18,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:48:18,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 11:48:18,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-12-13 11:48:18,727 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-12-13 11:48:24,937 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-12-13 11:48:26,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:48:26,740 INFO L93 Difference]: Finished difference Result 5384 states and 8102 transitions. [2022-12-13 11:48:26,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 11:48:26,741 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-12-13 11:48:26,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:48:26,750 INFO L225 Difference]: With dead ends: 5384 [2022-12-13 11:48:26,750 INFO L226 Difference]: Without dead ends: 5362 [2022-12-13 11:48:26,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2022-12-13 11:48:26,753 INFO L413 NwaCegarLoop]: 527 mSDtfsCounter, 911 mSDsluCounter, 3519 mSDsCounter, 0 mSdLazyCounter, 2954 mSolverCounterSat, 324 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s 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, 7.1s IncrementalHoareTripleChecker+Time [2022-12-13 11:48:26,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [935 Valid, 4046 Invalid, 3279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [324 Valid, 2954 Invalid, 1 Unknown, 0 Unchecked, 7.1s Time] [2022-12-13 11:48:26,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5362 states. [2022-12-13 11:48:27,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5362 to 4499. [2022-12-13 11:48:27,232 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-12-13 11:48:27,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4499 states to 4499 states and 6639 transitions. [2022-12-13 11:48:27,240 INFO L78 Accepts]: Start accepts. Automaton has 4499 states and 6639 transitions. Word has length 69 [2022-12-13 11:48:27,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:48:27,240 INFO L495 AbstractCegarLoop]: Abstraction has 4499 states and 6639 transitions. [2022-12-13 11:48:27,240 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-12-13 11:48:27,240 INFO L276 IsEmpty]: Start isEmpty. Operand 4499 states and 6639 transitions. [2022-12-13 11:48:27,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-12-13 11:48:27,241 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:48:27,242 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-12-13 11:48:27,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-12-13 11:48:27,242 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:48:27,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:48:27,242 INFO L85 PathProgramCache]: Analyzing trace with hash 2005419428, now seen corresponding path program 1 times [2022-12-13 11:48:27,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:48:27,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737809229] [2022-12-13 11:48:27,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:48:27,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:48:27,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:48:27,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:48:27,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:48:27,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:48:27,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:48:27,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 11:48:27,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:48:27,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 11:48:27,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:48:27,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 11:48:27,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:48:27,553 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:48:27,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:48:27,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737809229] [2022-12-13 11:48:27,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737809229] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:48:27,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:48:27,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 11:48:27,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606587064] [2022-12-13 11:48:27,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:48:27,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:48:27,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:48:27,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:48:27,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:48:27,555 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-12-13 11:48:31,744 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-12-13 11:48:33,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:48:33,627 INFO L93 Difference]: Finished difference Result 9671 states and 14461 transitions. [2022-12-13 11:48:33,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 11:48:33,628 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-12-13 11:48:33,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:48:33,637 INFO L225 Difference]: With dead ends: 9671 [2022-12-13 11:48:33,637 INFO L226 Difference]: Without dead ends: 5575 [2022-12-13 11:48:33,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2022-12-13 11:48:33,643 INFO L413 NwaCegarLoop]: 519 mSDtfsCounter, 1016 mSDsluCounter, 1453 mSDsCounter, 0 mSdLazyCounter, 1370 mSolverCounterSat, 254 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s 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, 5.0s IncrementalHoareTripleChecker+Time [2022-12-13 11:48:33,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1038 Valid, 1972 Invalid, 1625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 1370 Invalid, 1 Unknown, 0 Unchecked, 5.0s Time] [2022-12-13 11:48:33,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5575 states. [2022-12-13 11:48:34,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5575 to 4515. [2022-12-13 11:48:34,149 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-12-13 11:48:34,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4515 states to 4515 states and 6655 transitions. [2022-12-13 11:48:34,157 INFO L78 Accepts]: Start accepts. Automaton has 4515 states and 6655 transitions. Word has length 71 [2022-12-13 11:48:34,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:48:34,157 INFO L495 AbstractCegarLoop]: Abstraction has 4515 states and 6655 transitions. [2022-12-13 11:48:34,158 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-12-13 11:48:34,158 INFO L276 IsEmpty]: Start isEmpty. Operand 4515 states and 6655 transitions. [2022-12-13 11:48:34,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-12-13 11:48:34,159 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:48:34,159 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-12-13 11:48:34,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-12-13 11:48:34,159 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:48:34,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:48:34,159 INFO L85 PathProgramCache]: Analyzing trace with hash 885604175, now seen corresponding path program 1 times [2022-12-13 11:48:34,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:48:34,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299539986] [2022-12-13 11:48:34,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:48:34,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:48:34,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:48:34,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:48:34,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:48:34,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:48:34,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:48:34,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 11:48:34,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:48:34,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:48:34,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:48:34,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299539986] [2022-12-13 11:48:34,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299539986] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:48:34,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:48:34,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 11:48:34,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709043633] [2022-12-13 11:48:34,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:48:34,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 11:48:34,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:48:34,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 11:48:34,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-12-13 11:48:34,507 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-12-13 11:48:40,187 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-12-13 11:48:42,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:48:42,166 INFO L93 Difference]: Finished difference Result 5407 states and 8123 transitions. [2022-12-13 11:48:42,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 11:48:42,166 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-12-13 11:48:42,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:48:42,176 INFO L225 Difference]: With dead ends: 5407 [2022-12-13 11:48:42,176 INFO L226 Difference]: Without dead ends: 5386 [2022-12-13 11:48:42,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2022-12-13 11:48:42,178 INFO L413 NwaCegarLoop]: 522 mSDtfsCounter, 910 mSDsluCounter, 3479 mSDsCounter, 0 mSdLazyCounter, 2947 mSolverCounterSat, 318 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s 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, 6.6s IncrementalHoareTripleChecker+Time [2022-12-13 11:48:42,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [934 Valid, 4001 Invalid, 3266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [318 Valid, 2947 Invalid, 1 Unknown, 0 Unchecked, 6.6s Time] [2022-12-13 11:48:42,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5386 states. [2022-12-13 11:48:42,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5386 to 4511. [2022-12-13 11:48:42,683 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-12-13 11:48:42,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4511 states to 4511 states and 6649 transitions. [2022-12-13 11:48:42,691 INFO L78 Accepts]: Start accepts. Automaton has 4511 states and 6649 transitions. Word has length 69 [2022-12-13 11:48:42,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:48:42,691 INFO L495 AbstractCegarLoop]: Abstraction has 4511 states and 6649 transitions. [2022-12-13 11:48:42,691 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-12-13 11:48:42,691 INFO L276 IsEmpty]: Start isEmpty. Operand 4511 states and 6649 transitions. [2022-12-13 11:48:42,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-12-13 11:48:42,692 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:48:42,692 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-12-13 11:48:42,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-12-13 11:48:42,692 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:48:42,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:48:42,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1081372361, now seen corresponding path program 1 times [2022-12-13 11:48:42,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:48:42,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625253550] [2022-12-13 11:48:42,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:48:42,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:48:42,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:48:42,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:48:42,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:48:42,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:48:42,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:48:42,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 11:48:42,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:48:42,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 11:48:42,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:48:42,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:48:42,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:48:42,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625253550] [2022-12-13 11:48:42,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625253550] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:48:42,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:48:42,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 11:48:42,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806333998] [2022-12-13 11:48:42,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:48:42,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:48:42,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:48:42,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:48:42,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:48:42,908 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-12-13 11:48:47,895 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-12-13 11:48:49,905 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-12-13 11:48:51,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:48:51,772 INFO L93 Difference]: Finished difference Result 8174 states and 12226 transitions. [2022-12-13 11:48:51,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 11:48:51,773 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-12-13 11:48:51,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:48:51,782 INFO L225 Difference]: With dead ends: 8174 [2022-12-13 11:48:51,782 INFO L226 Difference]: Without dead ends: 5647 [2022-12-13 11:48:51,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-12-13 11:48:51,786 INFO L413 NwaCegarLoop]: 500 mSDtfsCounter, 856 mSDsluCounter, 1525 mSDsCounter, 0 mSdLazyCounter, 1650 mSolverCounterSat, 156 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s 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, 7.7s IncrementalHoareTripleChecker+Time [2022-12-13 11:48:51,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [879 Valid, 2025 Invalid, 1808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 1650 Invalid, 2 Unknown, 0 Unchecked, 7.7s Time] [2022-12-13 11:48:51,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5647 states. [2022-12-13 11:48:52,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5647 to 4571. [2022-12-13 11:48:52,496 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-12-13 11:48:52,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4571 states to 4571 states and 6709 transitions. [2022-12-13 11:48:52,504 INFO L78 Accepts]: Start accepts. Automaton has 4571 states and 6709 transitions. Word has length 71 [2022-12-13 11:48:52,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:48:52,504 INFO L495 AbstractCegarLoop]: Abstraction has 4571 states and 6709 transitions. [2022-12-13 11:48:52,505 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-12-13 11:48:52,505 INFO L276 IsEmpty]: Start isEmpty. Operand 4571 states and 6709 transitions. [2022-12-13 11:48:52,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-12-13 11:48:52,505 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:48:52,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, 1] [2022-12-13 11:48:52,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-12-13 11:48:52,506 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:48:52,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:48:52,506 INFO L85 PathProgramCache]: Analyzing trace with hash -100745951, now seen corresponding path program 1 times [2022-12-13 11:48:52,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:48:52,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115758320] [2022-12-13 11:48:52,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:48:52,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:48:52,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:48:52,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:48:52,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:48:52,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:48:52,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:48:52,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 11:48:52,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:48:52,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:48:52,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:48:52,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115758320] [2022-12-13 11:48:52,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115758320] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:48:52,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:48:52,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 11:48:52,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588325574] [2022-12-13 11:48:52,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:48:52,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 11:48:52,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:48:52,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 11:48:52,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-12-13 11:48:52,816 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-12-13 11:48:59,022 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-12-13 11:49:00,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:49:00,982 INFO L93 Difference]: Finished difference Result 5463 states and 8177 transitions. [2022-12-13 11:49:00,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 11:49:00,982 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-12-13 11:49:00,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:49:00,992 INFO L225 Difference]: With dead ends: 5463 [2022-12-13 11:49:00,992 INFO L226 Difference]: Without dead ends: 5442 [2022-12-13 11:49:00,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2022-12-13 11:49:00,994 INFO L413 NwaCegarLoop]: 516 mSDtfsCounter, 910 mSDsluCounter, 3440 mSDsCounter, 0 mSdLazyCounter, 2935 mSolverCounterSat, 315 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s 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, 7.1s IncrementalHoareTripleChecker+Time [2022-12-13 11:49:00,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [934 Valid, 3956 Invalid, 3251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [315 Valid, 2935 Invalid, 1 Unknown, 0 Unchecked, 7.1s Time] [2022-12-13 11:49:00,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5442 states. [2022-12-13 11:49:01,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5442 to 4567. [2022-12-13 11:49:01,521 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-12-13 11:49:01,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4567 states to 4567 states and 6703 transitions. [2022-12-13 11:49:01,529 INFO L78 Accepts]: Start accepts. Automaton has 4567 states and 6703 transitions. Word has length 70 [2022-12-13 11:49:01,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:49:01,529 INFO L495 AbstractCegarLoop]: Abstraction has 4567 states and 6703 transitions. [2022-12-13 11:49:01,530 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-12-13 11:49:01,530 INFO L276 IsEmpty]: Start isEmpty. Operand 4567 states and 6703 transitions. [2022-12-13 11:49:01,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-12-13 11:49:01,530 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:49:01,531 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-12-13 11:49:01,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-12-13 11:49:01,531 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:49:01,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:49:01,531 INFO L85 PathProgramCache]: Analyzing trace with hash 2023695595, now seen corresponding path program 1 times [2022-12-13 11:49:01,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:49:01,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165595106] [2022-12-13 11:49:01,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:49:01,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:49:01,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:02,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:49:02,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:02,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:49:02,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:02,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 11:49:02,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:02,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 11:49:02,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:02,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 11:49:02,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:02,239 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:49:02,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:49:02,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165595106] [2022-12-13 11:49:02,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165595106] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:49:02,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:49:02,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 11:49:02,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034243845] [2022-12-13 11:49:02,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:49:02,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 11:49:02,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:49:02,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 11:49:02,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 11:49:02,242 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-12-13 11:49:07,841 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-12-13 11:49:08,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:49:08,606 INFO L93 Difference]: Finished difference Result 5020 states and 7305 transitions. [2022-12-13 11:49:08,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 11:49:08,606 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-12-13 11:49:08,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:49:08,608 INFO L225 Difference]: With dead ends: 5020 [2022-12-13 11:49:08,608 INFO L226 Difference]: Without dead ends: 766 [2022-12-13 11:49:08,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2022-12-13 11:49:08,614 INFO L413 NwaCegarLoop]: 410 mSDtfsCounter, 590 mSDsluCounter, 1628 mSDsCounter, 0 mSdLazyCounter, 1549 mSolverCounterSat, 83 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s 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, 6.0s IncrementalHoareTripleChecker+Time [2022-12-13 11:49:08,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 2038 Invalid, 1633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1549 Invalid, 1 Unknown, 0 Unchecked, 6.0s Time] [2022-12-13 11:49:08,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2022-12-13 11:49:08,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 733. [2022-12-13 11:49:08,693 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-12-13 11:49:08,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 966 transitions. [2022-12-13 11:49:08,695 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 966 transitions. Word has length 72 [2022-12-13 11:49:08,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:49:08,695 INFO L495 AbstractCegarLoop]: Abstraction has 733 states and 966 transitions. [2022-12-13 11:49:08,695 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-12-13 11:49:08,695 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 966 transitions. [2022-12-13 11:49:08,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-12-13 11:49:08,696 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:49:08,696 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-12-13 11:49:08,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-12-13 11:49:08,696 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:49:08,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:49:08,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1623584585, now seen corresponding path program 1 times [2022-12-13 11:49:08,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:49:08,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123894965] [2022-12-13 11:49:08,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:49:08,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:49:08,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:08,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:49:08,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:09,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:49:09,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:09,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 11:49:09,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:09,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 11:49:09,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:09,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:49:09,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:09,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-12-13 11:49:09,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:09,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 11:49:09,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:09,220 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 11:49:09,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:49:09,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123894965] [2022-12-13 11:49:09,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123894965] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:49:09,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:49:09,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 11:49:09,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117783370] [2022-12-13 11:49:09,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:49:09,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 11:49:09,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:49:09,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 11:49:09,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-12-13 11:49:09,223 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-12-13 11:49:15,153 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-12-13 11:49:16,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:49:16,016 INFO L93 Difference]: Finished difference Result 777 states and 1025 transitions. [2022-12-13 11:49:16,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 11:49:16,017 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-12-13 11:49:16,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:49:16,018 INFO L225 Difference]: With dead ends: 777 [2022-12-13 11:49:16,018 INFO L226 Difference]: Without dead ends: 739 [2022-12-13 11:49:16,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2022-12-13 11:49:16,019 INFO L413 NwaCegarLoop]: 397 mSDtfsCounter, 453 mSDsluCounter, 3055 mSDsCounter, 0 mSdLazyCounter, 2490 mSolverCounterSat, 122 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.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, 6.5s IncrementalHoareTripleChecker+Time [2022-12-13 11:49:16,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 3452 Invalid, 2613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 2490 Invalid, 1 Unknown, 0 Unchecked, 6.5s Time] [2022-12-13 11:49:16,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2022-12-13 11:49:16,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 713. [2022-12-13 11:49:16,094 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-12-13 11:49:16,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 941 transitions. [2022-12-13 11:49:16,095 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 941 transitions. Word has length 75 [2022-12-13 11:49:16,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:49:16,095 INFO L495 AbstractCegarLoop]: Abstraction has 713 states and 941 transitions. [2022-12-13 11:49:16,095 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-12-13 11:49:16,095 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 941 transitions. [2022-12-13 11:49:16,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-12-13 11:49:16,096 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:49:16,096 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-12-13 11:49:16,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-12-13 11:49:16,096 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:49:16,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:49:16,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1736062830, now seen corresponding path program 1 times [2022-12-13 11:49:16,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:49:16,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351238041] [2022-12-13 11:49:16,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:49:16,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:49:16,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:16,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:49:16,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:16,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:49:16,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:16,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 11:49:16,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:16,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:49:16,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:16,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-12-13 11:49:16,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:16,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 11:49:16,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:16,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:49:16,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:49:16,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351238041] [2022-12-13 11:49:16,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351238041] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:49:16,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:49:16,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 11:49:16,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533541696] [2022-12-13 11:49:16,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:49:16,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 11:49:16,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:49:16,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 11:49:16,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-13 11:49:16,598 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-12-13 11:49:21,769 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-12-13 11:49:22,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:49:22,243 INFO L93 Difference]: Finished difference Result 759 states and 1003 transitions. [2022-12-13 11:49:22,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 11:49:22,244 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-12-13 11:49:22,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:49:22,245 INFO L225 Difference]: With dead ends: 759 [2022-12-13 11:49:22,245 INFO L226 Difference]: Without dead ends: 713 [2022-12-13 11:49:22,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2022-12-13 11:49:22,246 INFO L413 NwaCegarLoop]: 400 mSDtfsCounter, 665 mSDsluCounter, 2088 mSDsCounter, 0 mSdLazyCounter, 1544 mSolverCounterSat, 220 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s 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, 5.4s IncrementalHoareTripleChecker+Time [2022-12-13 11:49:22,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 2488 Invalid, 1765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 1544 Invalid, 1 Unknown, 0 Unchecked, 5.4s Time] [2022-12-13 11:49:22,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2022-12-13 11:49:22,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 691. [2022-12-13 11:49:22,322 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-12-13 11:49:22,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 911 transitions. [2022-12-13 11:49:22,323 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 911 transitions. Word has length 75 [2022-12-13 11:49:22,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:49:22,323 INFO L495 AbstractCegarLoop]: Abstraction has 691 states and 911 transitions. [2022-12-13 11:49:22,323 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-12-13 11:49:22,323 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 911 transitions. [2022-12-13 11:49:22,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-12-13 11:49:22,324 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:49:22,324 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-12-13 11:49:22,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-12-13 11:49:22,324 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:49:22,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:49:22,324 INFO L85 PathProgramCache]: Analyzing trace with hash -496016635, now seen corresponding path program 1 times [2022-12-13 11:49:22,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:49:22,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568928659] [2022-12-13 11:49:22,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:49:22,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:49:22,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:22,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:49:22,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:22,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:49:22,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:22,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 11:49:22,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:22,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 11:49:22,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:22,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 11:49:22,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:22,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:49:22,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:22,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:49:22,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:49:22,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568928659] [2022-12-13 11:49:22,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568928659] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:49:22,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:49:22,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 11:49:22,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500161389] [2022-12-13 11:49:22,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:49:22,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 11:49:22,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:49:22,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 11:49:22,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-12-13 11:49:22,710 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-12-13 11:49:26,866 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-12-13 11:49:27,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:49:27,269 INFO L93 Difference]: Finished difference Result 979 states and 1303 transitions. [2022-12-13 11:49:27,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 11:49:27,269 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-12-13 11:49:27,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:49:27,272 INFO L225 Difference]: With dead ends: 979 [2022-12-13 11:49:27,273 INFO L226 Difference]: Without dead ends: 634 [2022-12-13 11:49:27,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2022-12-13 11:49:27,274 INFO L413 NwaCegarLoop]: 370 mSDtfsCounter, 801 mSDsluCounter, 2349 mSDsCounter, 0 mSdLazyCounter, 1587 mSolverCounterSat, 207 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.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, 4.3s IncrementalHoareTripleChecker+Time [2022-12-13 11:49:27,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [807 Valid, 2719 Invalid, 1795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 1587 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2022-12-13 11:49:27,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2022-12-13 11:49:27,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 613. [2022-12-13 11:49:27,378 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-12-13 11:49:27,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 804 transitions. [2022-12-13 11:49:27,380 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 804 transitions. Word has length 76 [2022-12-13 11:49:27,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:49:27,380 INFO L495 AbstractCegarLoop]: Abstraction has 613 states and 804 transitions. [2022-12-13 11:49:27,380 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-12-13 11:49:27,380 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 804 transitions. [2022-12-13 11:49:27,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-12-13 11:49:27,382 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:49:27,382 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 11:49:27,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-12-13 11:49:27,382 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:49:27,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:49:27,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1257721170, now seen corresponding path program 1 times [2022-12-13 11:49:27,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:49:27,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897070895] [2022-12-13 11:49:27,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:49:27,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:49:27,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:27,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:49:27,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:27,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:49:27,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:27,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 11:49:27,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:27,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 11:49:27,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:27,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:49:27,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:49:27,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897070895] [2022-12-13 11:49:27,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897070895] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:49:27,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:49:27,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 11:49:27,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286887222] [2022-12-13 11:49:27,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:49:27,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:49:27,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:49:27,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:49:27,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:49:27,636 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-12-13 11:49:31,001 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-12-13 11:49:31,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:49:31,339 INFO L93 Difference]: Finished difference Result 680 states and 891 transitions. [2022-12-13 11:49:31,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 11:49:31,339 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-12-13 11:49:31,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:49:31,341 INFO L225 Difference]: With dead ends: 680 [2022-12-13 11:49:31,341 INFO L226 Difference]: Without dead ends: 655 [2022-12-13 11:49:31,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-12-13 11:49:31,342 INFO L413 NwaCegarLoop]: 369 mSDtfsCounter, 600 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 212 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s 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, 3.5s IncrementalHoareTripleChecker+Time [2022-12-13 11:49:31,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [605 Valid, 1288 Invalid, 1017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 804 Invalid, 1 Unknown, 0 Unchecked, 3.5s Time] [2022-12-13 11:49:31,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2022-12-13 11:49:31,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 613. [2022-12-13 11:49:31,405 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-12-13 11:49:31,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 807 transitions. [2022-12-13 11:49:31,406 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 807 transitions. Word has length 74 [2022-12-13 11:49:31,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:49:31,406 INFO L495 AbstractCegarLoop]: Abstraction has 613 states and 807 transitions. [2022-12-13 11:49:31,406 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-12-13 11:49:31,406 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 807 transitions. [2022-12-13 11:49:31,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-12-13 11:49:31,407 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:49:31,407 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-12-13 11:49:31,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-12-13 11:49:31,407 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:49:31,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:49:31,407 INFO L85 PathProgramCache]: Analyzing trace with hash -280765008, now seen corresponding path program 1 times [2022-12-13 11:49:31,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:49:31,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638691675] [2022-12-13 11:49:31,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:49:31,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:49:31,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:31,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:49:31,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:31,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:49:31,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:31,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 11:49:31,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:31,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-12-13 11:49:31,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:31,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:49:31,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:49:31,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638691675] [2022-12-13 11:49:31,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638691675] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:49:31,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:49:31,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-13 11:49:31,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145896863] [2022-12-13 11:49:31,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:49:31,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 11:49:31,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:49:31,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 11:49:31,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-12-13 11:49:31,821 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-12-13 11:49:36,494 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-12-13 11:49:38,503 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-12-13 11:49:39,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:49:39,090 INFO L93 Difference]: Finished difference Result 648 states and 853 transitions. [2022-12-13 11:49:39,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 11:49:39,091 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-12-13 11:49:39,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:49:39,092 INFO L225 Difference]: With dead ends: 648 [2022-12-13 11:49:39,092 INFO L226 Difference]: Without dead ends: 628 [2022-12-13 11:49:39,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2022-12-13 11:49:39,093 INFO L413 NwaCegarLoop]: 379 mSDtfsCounter, 436 mSDsluCounter, 2788 mSDsCounter, 0 mSdLazyCounter, 2184 mSolverCounterSat, 64 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s 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, 7.0s IncrementalHoareTripleChecker+Time [2022-12-13 11:49:39,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 3167 Invalid, 2250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 2184 Invalid, 2 Unknown, 0 Unchecked, 7.0s Time] [2022-12-13 11:49:39,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2022-12-13 11:49:39,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 606. [2022-12-13 11:49:39,154 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-12-13 11:49:39,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 797 transitions. [2022-12-13 11:49:39,155 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 797 transitions. Word has length 74 [2022-12-13 11:49:39,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:49:39,155 INFO L495 AbstractCegarLoop]: Abstraction has 606 states and 797 transitions. [2022-12-13 11:49:39,155 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-12-13 11:49:39,155 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 797 transitions. [2022-12-13 11:49:39,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-12-13 11:49:39,156 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:49:39,156 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-12-13 11:49:39,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-12-13 11:49:39,156 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:49:39,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:49:39,156 INFO L85 PathProgramCache]: Analyzing trace with hash 480971669, now seen corresponding path program 1 times [2022-12-13 11:49:39,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:49:39,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976558618] [2022-12-13 11:49:39,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:49:39,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:49:39,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:39,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:49:39,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:39,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:49:39,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:39,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 11:49:39,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:39,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 11:49:39,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:39,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:49:39,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:49:39,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976558618] [2022-12-13 11:49:39,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976558618] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:49:39,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:49:39,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 11:49:39,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437765791] [2022-12-13 11:49:39,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:49:39,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:49:39,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:49:39,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:49:39,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:49:39,369 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-12-13 11:49:42,898 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-12-13 11:49:43,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:49:43,214 INFO L93 Difference]: Finished difference Result 670 states and 878 transitions. [2022-12-13 11:49:43,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 11:49:43,215 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-12-13 11:49:43,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:49:43,216 INFO L225 Difference]: With dead ends: 670 [2022-12-13 11:49:43,216 INFO L226 Difference]: Without dead ends: 645 [2022-12-13 11:49:43,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-12-13 11:49:43,217 INFO L413 NwaCegarLoop]: 371 mSDtfsCounter, 541 mSDsluCounter, 929 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 159 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s 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, 3.7s IncrementalHoareTripleChecker+Time [2022-12-13 11:49:43,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 1300 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 817 Invalid, 1 Unknown, 0 Unchecked, 3.7s Time] [2022-12-13 11:49:43,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2022-12-13 11:49:43,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 606. [2022-12-13 11:49:43,284 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-12-13 11:49:43,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 797 transitions. [2022-12-13 11:49:43,285 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 797 transitions. Word has length 74 [2022-12-13 11:49:43,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:49:43,285 INFO L495 AbstractCegarLoop]: Abstraction has 606 states and 797 transitions. [2022-12-13 11:49:43,285 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-12-13 11:49:43,285 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 797 transitions. [2022-12-13 11:49:43,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-12-13 11:49:43,286 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:49:43,286 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-12-13 11:49:43,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-12-13 11:49:43,286 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:49:43,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:49:43,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1282723427, now seen corresponding path program 1 times [2022-12-13 11:49:43,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:49:43,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213731827] [2022-12-13 11:49:43,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:49:43,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:49:43,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:43,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:49:43,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:43,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:49:43,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:43,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 11:49:43,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:43,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 11:49:43,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:43,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 11:49:43,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:43,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:49:43,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:49:43,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213731827] [2022-12-13 11:49:43,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213731827] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:49:43,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:49:43,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 11:49:43,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156799334] [2022-12-13 11:49:43,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:49:43,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 11:49:43,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:49:43,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 11:49:43,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-12-13 11:49:43,694 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-12-13 11:49:48,569 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-12-13 11:49:50,575 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-12-13 11:49:51,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:49:51,061 INFO L93 Difference]: Finished difference Result 651 states and 854 transitions. [2022-12-13 11:49:51,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 11:49:51,061 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-12-13 11:49:51,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:49:51,062 INFO L225 Difference]: With dead ends: 651 [2022-12-13 11:49:51,062 INFO L226 Difference]: Without dead ends: 567 [2022-12-13 11:49:51,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2022-12-13 11:49:51,063 INFO L413 NwaCegarLoop]: 352 mSDtfsCounter, 468 mSDsluCounter, 2023 mSDsCounter, 0 mSdLazyCounter, 1726 mSolverCounterSat, 71 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s 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.1s IncrementalHoareTripleChecker+Time [2022-12-13 11:49:51,063 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.1s Time] [2022-12-13 11:49:51,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2022-12-13 11:49:51,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 545. [2022-12-13 11:49:51,123 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-12-13 11:49:51,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 690 transitions. [2022-12-13 11:49:51,123 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 690 transitions. Word has length 77 [2022-12-13 11:49:51,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:49:51,124 INFO L495 AbstractCegarLoop]: Abstraction has 545 states and 690 transitions. [2022-12-13 11:49:51,124 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-12-13 11:49:51,124 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 690 transitions. [2022-12-13 11:49:51,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-12-13 11:49:51,124 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:49:51,124 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-12-13 11:49:51,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-12-13 11:49:51,125 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:49:51,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:49:51,125 INFO L85 PathProgramCache]: Analyzing trace with hash 947563230, now seen corresponding path program 1 times [2022-12-13 11:49:51,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:49:51,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336545722] [2022-12-13 11:49:51,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:49:51,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:49:51,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:51,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:49:51,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:51,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:49:51,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:51,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 11:49:51,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:51,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 11:49:51,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:51,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 11:49:51,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:51,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:49:51,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:51,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:49:51,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:51,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:49:51,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:49:51,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336545722] [2022-12-13 11:49:51,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336545722] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:49:51,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:49:51,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 11:49:51,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847488272] [2022-12-13 11:49:51,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:49:51,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 11:49:51,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:49:51,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 11:49:51,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-13 11:49:51,454 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-12-13 11:49:55,190 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-12-13 11:49:55,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:49:55,595 INFO L93 Difference]: Finished difference Result 832 states and 1076 transitions. [2022-12-13 11:49:55,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 11:49:55,595 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-12-13 11:49:55,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:49:55,599 INFO L225 Difference]: With dead ends: 832 [2022-12-13 11:49:55,599 INFO L226 Difference]: Without dead ends: 565 [2022-12-13 11:49:55,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=381, Unknown=0, NotChecked=0, Total=506 [2022-12-13 11:49:55,600 INFO L413 NwaCegarLoop]: 297 mSDtfsCounter, 833 mSDsluCounter, 1331 mSDsCounter, 0 mSdLazyCounter, 1107 mSolverCounterSat, 193 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s 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, 3.8s IncrementalHoareTripleChecker+Time [2022-12-13 11:49:55,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [859 Valid, 1628 Invalid, 1301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 1107 Invalid, 1 Unknown, 0 Unchecked, 3.8s Time] [2022-12-13 11:49:55,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2022-12-13 11:49:55,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 545. [2022-12-13 11:49:55,672 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-12-13 11:49:55,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 689 transitions. [2022-12-13 11:49:55,673 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 689 transitions. Word has length 80 [2022-12-13 11:49:55,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:49:55,673 INFO L495 AbstractCegarLoop]: Abstraction has 545 states and 689 transitions. [2022-12-13 11:49:55,673 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-12-13 11:49:55,673 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 689 transitions. [2022-12-13 11:49:55,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-12-13 11:49:55,674 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:49:55,674 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-12-13 11:49:55,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-12-13 11:49:55,674 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:49:55,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:49:55,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1912417017, now seen corresponding path program 1 times [2022-12-13 11:49:55,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:49:55,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239573559] [2022-12-13 11:49:55,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:49:55,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:49:55,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:55,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:49:55,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:55,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:49:55,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:55,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 11:49:55,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:55,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 11:49:55,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:55,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 11:49:55,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:55,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:49:55,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:55,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:49:55,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:55,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:49:55,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:49:55,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239573559] [2022-12-13 11:49:55,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239573559] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:49:55,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:49:55,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 11:49:55,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214256910] [2022-12-13 11:49:55,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:49:55,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 11:49:55,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:49:55,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 11:49:55,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 11:49:55,915 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-12-13 11:49:59,159 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-12-13 11:49:59,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:49:59,506 INFO L93 Difference]: Finished difference Result 844 states and 1091 transitions. [2022-12-13 11:49:59,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 11:49:59,507 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-12-13 11:49:59,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:49:59,509 INFO L225 Difference]: With dead ends: 844 [2022-12-13 11:49:59,509 INFO L226 Difference]: Without dead ends: 577 [2022-12-13 11:49:59,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2022-12-13 11:49:59,510 INFO L413 NwaCegarLoop]: 305 mSDtfsCounter, 439 mSDsluCounter, 1176 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 147 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s 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, 3.3s IncrementalHoareTripleChecker+Time [2022-12-13 11:49:59,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 1481 Invalid, 931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 783 Invalid, 1 Unknown, 0 Unchecked, 3.3s Time] [2022-12-13 11:49:59,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2022-12-13 11:49:59,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 548. [2022-12-13 11:49:59,570 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-12-13 11:49:59,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 692 transitions. [2022-12-13 11:49:59,571 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 692 transitions. Word has length 82 [2022-12-13 11:49:59,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:49:59,571 INFO L495 AbstractCegarLoop]: Abstraction has 548 states and 692 transitions. [2022-12-13 11:49:59,571 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-12-13 11:49:59,571 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 692 transitions. [2022-12-13 11:49:59,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-12-13 11:49:59,571 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:49:59,572 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-12-13 11:49:59,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-12-13 11:49:59,572 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:49:59,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:49:59,572 INFO L85 PathProgramCache]: Analyzing trace with hash 900956810, now seen corresponding path program 1 times [2022-12-13 11:49:59,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:49:59,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155389738] [2022-12-13 11:49:59,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:49:59,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:49:59,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:59,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:49:59,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:59,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:49:59,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:59,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 11:49:59,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:59,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 11:49:59,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:59,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:49:59,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:49:59,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155389738] [2022-12-13 11:49:59,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155389738] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:49:59,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:49:59,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 11:49:59,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652733384] [2022-12-13 11:49:59,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:49:59,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 11:49:59,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:49:59,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 11:49:59,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-12-13 11:49:59,957 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-12-13 11:50:03,523 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-12-13 11:50:05,531 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-12-13 11:50:05,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:50:05,937 INFO L93 Difference]: Finished difference Result 614 states and 775 transitions. [2022-12-13 11:50:05,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 11:50:05,938 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-12-13 11:50:05,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:50:05,939 INFO L225 Difference]: With dead ends: 614 [2022-12-13 11:50:05,939 INFO L226 Difference]: Without dead ends: 562 [2022-12-13 11:50:05,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-12-13 11:50:05,939 INFO L413 NwaCegarLoop]: 338 mSDtfsCounter, 186 mSDsluCounter, 1788 mSDsCounter, 0 mSdLazyCounter, 1134 mSolverCounterSat, 89 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s 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, 5.8s IncrementalHoareTripleChecker+Time [2022-12-13 11:50:05,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 2126 Invalid, 1225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1134 Invalid, 2 Unknown, 0 Unchecked, 5.8s Time] [2022-12-13 11:50:05,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2022-12-13 11:50:05,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 540. [2022-12-13 11:50:05,999 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-12-13 11:50:05,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 681 transitions. [2022-12-13 11:50:06,000 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 681 transitions. Word has length 79 [2022-12-13 11:50:06,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:50:06,000 INFO L495 AbstractCegarLoop]: Abstraction has 540 states and 681 transitions. [2022-12-13 11:50:06,000 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-12-13 11:50:06,000 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 681 transitions. [2022-12-13 11:50:06,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-12-13 11:50:06,000 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:50:06,000 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-12-13 11:50:06,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-12-13 11:50:06,001 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:50:06,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:50:06,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1500515065, now seen corresponding path program 1 times [2022-12-13 11:50:06,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:50:06,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933678166] [2022-12-13 11:50:06,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:50:06,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:50:06,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:06,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:50:06,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:06,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:50:06,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:06,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 11:50:06,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:06,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 11:50:06,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:06,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 11:50:06,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:06,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:50:06,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:06,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:50:06,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:06,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:50:06,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:50:06,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933678166] [2022-12-13 11:50:06,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933678166] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:50:06,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:50:06,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 11:50:06,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550818186] [2022-12-13 11:50:06,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:50:06,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 11:50:06,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:50:06,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 11:50:06,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 11:50:06,286 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-12-13 11:50:09,619 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-12-13 11:50:10,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:50:10,067 INFO L93 Difference]: Finished difference Result 965 states and 1237 transitions. [2022-12-13 11:50:10,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 11:50:10,068 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-12-13 11:50:10,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:50:10,071 INFO L225 Difference]: With dead ends: 965 [2022-12-13 11:50:10,072 INFO L226 Difference]: Without dead ends: 701 [2022-12-13 11:50:10,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2022-12-13 11:50:10,072 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 925 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 311 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s 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, 3.5s IncrementalHoareTripleChecker+Time [2022-12-13 11:50:10,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [934 Valid, 1338 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [311 Valid, 809 Invalid, 1 Unknown, 0 Unchecked, 3.5s Time] [2022-12-13 11:50:10,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2022-12-13 11:50:10,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 660. [2022-12-13 11:50:10,147 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-12-13 11:50:10,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 834 transitions. [2022-12-13 11:50:10,148 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 834 transitions. Word has length 83 [2022-12-13 11:50:10,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:50:10,149 INFO L495 AbstractCegarLoop]: Abstraction has 660 states and 834 transitions. [2022-12-13 11:50:10,149 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-12-13 11:50:10,149 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 834 transitions. [2022-12-13 11:50:10,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-12-13 11:50:10,149 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:50:10,149 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-12-13 11:50:10,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-12-13 11:50:10,150 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:50:10,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:50:10,150 INFO L85 PathProgramCache]: Analyzing trace with hash 868554885, now seen corresponding path program 1 times [2022-12-13 11:50:10,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:50:10,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879262068] [2022-12-13 11:50:10,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:50:10,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:50:10,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:10,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:50:10,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:10,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:50:10,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:10,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 11:50:10,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:10,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 11:50:10,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:10,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-12-13 11:50:10,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:10,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:50:10,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:50:10,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879262068] [2022-12-13 11:50:10,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879262068] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:50:10,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:50:10,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-13 11:50:10,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424706092] [2022-12-13 11:50:10,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:50:10,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 11:50:10,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:50:10,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 11:50:10,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-12-13 11:50:10,512 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-12-13 11:50:14,363 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-12-13 11:50:14,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:50:14,826 INFO L93 Difference]: Finished difference Result 697 states and 883 transitions. [2022-12-13 11:50:14,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 11:50:14,827 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-12-13 11:50:14,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:50:14,828 INFO L225 Difference]: With dead ends: 697 [2022-12-13 11:50:14,828 INFO L226 Difference]: Without dead ends: 645 [2022-12-13 11:50:14,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2022-12-13 11:50:14,829 INFO L413 NwaCegarLoop]: 296 mSDtfsCounter, 446 mSDsluCounter, 1998 mSDsCounter, 0 mSdLazyCounter, 1620 mSolverCounterSat, 173 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s 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, 4.1s IncrementalHoareTripleChecker+Time [2022-12-13 11:50:14,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 2294 Invalid, 1794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 1620 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2022-12-13 11:50:14,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2022-12-13 11:50:14,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 625. [2022-12-13 11:50:14,896 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-12-13 11:50:14,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 793 transitions. [2022-12-13 11:50:14,897 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 793 transitions. Word has length 86 [2022-12-13 11:50:14,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:50:14,898 INFO L495 AbstractCegarLoop]: Abstraction has 625 states and 793 transitions. [2022-12-13 11:50:14,898 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-12-13 11:50:14,898 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 793 transitions. [2022-12-13 11:50:14,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-12-13 11:50:14,898 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:50:14,898 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-12-13 11:50:14,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-12-13 11:50:14,899 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:50:14,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:50:14,899 INFO L85 PathProgramCache]: Analyzing trace with hash 773093388, now seen corresponding path program 1 times [2022-12-13 11:50:14,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:50:14,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691583015] [2022-12-13 11:50:14,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:50:14,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:50:14,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:15,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:50:15,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:15,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:50:15,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:15,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 11:50:15,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:15,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-12-13 11:50:15,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:15,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-12-13 11:50:15,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:15,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:50:15,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:50:15,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691583015] [2022-12-13 11:50:15,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691583015] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:50:15,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:50:15,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 11:50:15,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646406677] [2022-12-13 11:50:15,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:50:15,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 11:50:15,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:50:15,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 11:50:15,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-13 11:50:15,239 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-12-13 11:50:18,699 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-12-13 11:50:21,005 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-12-13 11:50:21,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:50:21,507 INFO L93 Difference]: Finished difference Result 1142 states and 1426 transitions. [2022-12-13 11:50:21,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 11:50:21,507 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-12-13 11:50:21,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:50:21,510 INFO L225 Difference]: With dead ends: 1142 [2022-12-13 11:50:21,511 INFO L226 Difference]: Without dead ends: 805 [2022-12-13 11:50:21,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2022-12-13 11:50:21,511 INFO L413 NwaCegarLoop]: 279 mSDtfsCounter, 1151 mSDsluCounter, 1415 mSDsCounter, 0 mSdLazyCounter, 1068 mSolverCounterSat, 271 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s 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, 5.9s IncrementalHoareTripleChecker+Time [2022-12-13 11:50:21,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1170 Valid, 1694 Invalid, 1341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [271 Valid, 1068 Invalid, 2 Unknown, 0 Unchecked, 5.9s Time] [2022-12-13 11:50:21,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2022-12-13 11:50:21,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 768. [2022-12-13 11:50:21,605 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-12-13 11:50:21,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 951 transitions. [2022-12-13 11:50:21,606 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 951 transitions. Word has length 86 [2022-12-13 11:50:21,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:50:21,606 INFO L495 AbstractCegarLoop]: Abstraction has 768 states and 951 transitions. [2022-12-13 11:50:21,607 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-12-13 11:50:21,607 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 951 transitions. [2022-12-13 11:50:21,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-12-13 11:50:21,607 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:50:21,607 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-12-13 11:50:21,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-12-13 11:50:21,607 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:50:21,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:50:21,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1759913001, now seen corresponding path program 1 times [2022-12-13 11:50:21,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:50:21,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502959671] [2022-12-13 11:50:21,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:50:21,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:50:21,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:21,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:50:21,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:21,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:50:21,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:21,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 11:50:21,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:21,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-12-13 11:50:21,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:21,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-12-13 11:50:21,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:22,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:50:22,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:22,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:50:22,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:22,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-12-13 11:50:22,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:22,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:50:22,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:50:22,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502959671] [2022-12-13 11:50:22,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502959671] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:50:22,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:50:22,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-13 11:50:22,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140336795] [2022-12-13 11:50:22,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:50:22,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 11:50:22,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:50:22,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 11:50:22,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-12-13 11:50:22,072 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-12-13 11:50:25,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-12-13 11:50:26,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:50:26,360 INFO L93 Difference]: Finished difference Result 1196 states and 1501 transitions. [2022-12-13 11:50:26,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 11:50:26,361 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-12-13 11:50:26,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:50:26,365 INFO L225 Difference]: With dead ends: 1196 [2022-12-13 11:50:26,365 INFO L226 Difference]: Without dead ends: 789 [2022-12-13 11:50:26,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2022-12-13 11:50:26,366 INFO L413 NwaCegarLoop]: 274 mSDtfsCounter, 600 mSDsluCounter, 1639 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 215 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s 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, 3.9s IncrementalHoareTripleChecker+Time [2022-12-13 11:50:26,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 1913 Invalid, 1398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 1182 Invalid, 1 Unknown, 0 Unchecked, 3.9s Time] [2022-12-13 11:50:26,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2022-12-13 11:50:26,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 768. [2022-12-13 11:50:26,460 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-12-13 11:50:26,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 947 transitions. [2022-12-13 11:50:26,461 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 947 transitions. Word has length 96 [2022-12-13 11:50:26,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:50:26,461 INFO L495 AbstractCegarLoop]: Abstraction has 768 states and 947 transitions. [2022-12-13 11:50:26,461 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-12-13 11:50:26,461 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 947 transitions. [2022-12-13 11:50:26,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-12-13 11:50:26,462 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:50:26,462 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-12-13 11:50:26,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-12-13 11:50:26,462 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:50:26,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:50:26,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1920923923, now seen corresponding path program 1 times [2022-12-13 11:50:26,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:50:26,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111616985] [2022-12-13 11:50:26,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:50:26,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:50:26,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:26,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:50:26,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:26,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:50:26,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:26,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 11:50:26,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:26,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-12-13 11:50:26,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:26,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-12-13 11:50:26,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:26,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-12-13 11:50:26,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:50:26,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111616985] [2022-12-13 11:50:26,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111616985] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:50:26,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:50:26,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 11:50:26,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184683135] [2022-12-13 11:50:26,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:50:26,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 11:50:26,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:50:26,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 11:50:26,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-12-13 11:50:26,873 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-12-13 11:50:31,069 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-12-13 11:50:33,076 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-12-13 11:50:34,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:50:34,115 INFO L93 Difference]: Finished difference Result 789 states and 977 transitions. [2022-12-13 11:50:34,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 11:50:34,116 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-12-13 11:50:34,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:50:34,117 INFO L225 Difference]: With dead ends: 789 [2022-12-13 11:50:34,117 INFO L226 Difference]: Without dead ends: 710 [2022-12-13 11:50:34,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2022-12-13 11:50:34,118 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 467 mSDsluCounter, 1775 mSDsCounter, 0 mSdLazyCounter, 2123 mSolverCounterSat, 139 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s 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, 6.9s IncrementalHoareTripleChecker+Time [2022-12-13 11:50:34,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 1993 Invalid, 2264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 2123 Invalid, 2 Unknown, 0 Unchecked, 6.9s Time] [2022-12-13 11:50:34,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2022-12-13 11:50:34,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 695. [2022-12-13 11:50:34,218 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-12-13 11:50:34,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 858 transitions. [2022-12-13 11:50:34,219 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 858 transitions. Word has length 87 [2022-12-13 11:50:34,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:50:34,219 INFO L495 AbstractCegarLoop]: Abstraction has 695 states and 858 transitions. [2022-12-13 11:50:34,219 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-12-13 11:50:34,219 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 858 transitions. [2022-12-13 11:50:34,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-12-13 11:50:34,219 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:50:34,219 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-12-13 11:50:34,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-12-13 11:50:34,220 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:50:34,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:50:34,220 INFO L85 PathProgramCache]: Analyzing trace with hash 985884663, now seen corresponding path program 1 times [2022-12-13 11:50:34,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:50:34,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745175945] [2022-12-13 11:50:34,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:50:34,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:50:34,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:34,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:50:34,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:34,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:50:34,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:34,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 11:50:34,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:34,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 11:50:34,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:34,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 11:50:34,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:34,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:50:34,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:34,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:50:34,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:34,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-12-13 11:50:34,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:34,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:50:34,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:50:34,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745175945] [2022-12-13 11:50:34,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745175945] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:50:34,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:50:34,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-13 11:50:34,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082807518] [2022-12-13 11:50:34,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:50:34,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 11:50:34,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:50:34,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 11:50:34,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-12-13 11:50:34,695 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-12-13 11:50:37,796 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-12-13 11:50:38,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:50:38,308 INFO L93 Difference]: Finished difference Result 1067 states and 1334 transitions. [2022-12-13 11:50:38,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 11:50:38,309 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-12-13 11:50:38,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:50:38,311 INFO L225 Difference]: With dead ends: 1067 [2022-12-13 11:50:38,312 INFO L226 Difference]: Without dead ends: 710 [2022-12-13 11:50:38,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2022-12-13 11:50:38,312 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 432 mSDsluCounter, 1488 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 160 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s 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, 3.3s IncrementalHoareTripleChecker+Time [2022-12-13 11:50:38,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 1735 Invalid, 1147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 986 Invalid, 1 Unknown, 0 Unchecked, 3.3s Time] [2022-12-13 11:50:38,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2022-12-13 11:50:38,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 695. [2022-12-13 11:50:38,400 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-12-13 11:50:38,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 857 transitions. [2022-12-13 11:50:38,401 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 857 transitions. Word has length 92 [2022-12-13 11:50:38,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:50:38,401 INFO L495 AbstractCegarLoop]: Abstraction has 695 states and 857 transitions. [2022-12-13 11:50:38,402 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-12-13 11:50:38,402 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 857 transitions. [2022-12-13 11:50:38,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-12-13 11:50:38,402 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:50:38,402 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-12-13 11:50:38,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-12-13 11:50:38,403 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:50:38,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:50:38,403 INFO L85 PathProgramCache]: Analyzing trace with hash -751551231, now seen corresponding path program 1 times [2022-12-13 11:50:38,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:50:38,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568463907] [2022-12-13 11:50:38,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:50:38,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:50:38,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:38,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:50:38,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:38,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:50:38,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:38,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 11:50:38,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:38,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-12-13 11:50:38,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:38,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-12-13 11:50:38,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:38,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:50:38,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:38,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:50:38,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:38,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-12-13 11:50:38,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:38,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-12-13 11:50:38,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:38,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:50:38,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:50:38,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568463907] [2022-12-13 11:50:38,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568463907] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:50:38,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:50:38,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 11:50:38,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620674895] [2022-12-13 11:50:38,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:50:38,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 11:50:38,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:50:38,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 11:50:38,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-12-13 11:50:38,765 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-12-13 11:50:41,841 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-12-13 11:50:44,097 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-12-13 11:50:44,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:50:44,835 INFO L93 Difference]: Finished difference Result 1045 states and 1301 transitions. [2022-12-13 11:50:44,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 11:50:44,836 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-12-13 11:50:44,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:50:44,839 INFO L225 Difference]: With dead ends: 1045 [2022-12-13 11:50:44,839 INFO L226 Difference]: Without dead ends: 658 [2022-12-13 11:50:44,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=156, Invalid=396, Unknown=0, NotChecked=0, Total=552 [2022-12-13 11:50:44,840 INFO L413 NwaCegarLoop]: 281 mSDtfsCounter, 592 mSDsluCounter, 1190 mSDsCounter, 0 mSdLazyCounter, 1050 mSolverCounterSat, 152 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s 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, 5.7s IncrementalHoareTripleChecker+Time [2022-12-13 11:50:44,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [595 Valid, 1471 Invalid, 1204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 1050 Invalid, 2 Unknown, 0 Unchecked, 5.7s Time] [2022-12-13 11:50:44,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2022-12-13 11:50:44,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 638. [2022-12-13 11:50:44,918 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-12-13 11:50:44,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 778 transitions. [2022-12-13 11:50:44,919 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 778 transitions. Word has length 106 [2022-12-13 11:50:44,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:50:44,919 INFO L495 AbstractCegarLoop]: Abstraction has 638 states and 778 transitions. [2022-12-13 11:50:44,919 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-12-13 11:50:44,919 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 778 transitions. [2022-12-13 11:50:44,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-12-13 11:50:44,920 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:50:44,920 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-12-13 11:50:44,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-12-13 11:50:44,920 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:50:44,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:50:44,920 INFO L85 PathProgramCache]: Analyzing trace with hash -708697275, now seen corresponding path program 1 times [2022-12-13 11:50:44,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:50:44,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173317395] [2022-12-13 11:50:44,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:50:44,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:50:44,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:45,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:50:45,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:45,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:50:45,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:45,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 11:50:45,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:45,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-12-13 11:50:45,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:45,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-12-13 11:50:45,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:45,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:50:45,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:45,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:50:45,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:45,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-12-13 11:50:45,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:45,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 11:50:45,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:45,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:50:45,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:50:45,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173317395] [2022-12-13 11:50:45,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173317395] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:50:45,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:50:45,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-13 11:50:45,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576057892] [2022-12-13 11:50:45,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:50:45,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 11:50:45,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:50:45,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 11:50:45,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-12-13 11:50:45,469 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-12-13 11:50:48,627 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-12-13 11:50:49,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:50:49,186 INFO L93 Difference]: Finished difference Result 740 states and 898 transitions. [2022-12-13 11:50:49,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 11:50:49,187 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-12-13 11:50:49,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:50:49,189 INFO L225 Difference]: With dead ends: 740 [2022-12-13 11:50:49,189 INFO L226 Difference]: Without dead ends: 673 [2022-12-13 11:50:49,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2022-12-13 11:50:49,189 INFO L413 NwaCegarLoop]: 264 mSDtfsCounter, 604 mSDsluCounter, 1958 mSDsCounter, 0 mSdLazyCounter, 1150 mSolverCounterSat, 195 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s 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, 3.4s IncrementalHoareTripleChecker+Time [2022-12-13 11:50:49,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [628 Valid, 2222 Invalid, 1346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 1150 Invalid, 1 Unknown, 0 Unchecked, 3.4s Time] [2022-12-13 11:50:49,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2022-12-13 11:50:49,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 644. [2022-12-13 11:50:49,269 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-12-13 11:50:49,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 784 transitions. [2022-12-13 11:50:49,269 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 784 transitions. Word has length 112 [2022-12-13 11:50:49,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:50:49,270 INFO L495 AbstractCegarLoop]: Abstraction has 644 states and 784 transitions. [2022-12-13 11:50:49,270 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-12-13 11:50:49,270 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 784 transitions. [2022-12-13 11:50:49,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-12-13 11:50:49,270 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:50:49,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 11:50:49,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-12-13 11:50:49,271 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:50:49,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:50:49,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1557650297, now seen corresponding path program 1 times [2022-12-13 11:50:49,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:50:49,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277675806] [2022-12-13 11:50:49,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:50:49,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:50:49,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:49,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:50:49,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:49,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:50:49,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:49,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 11:50:49,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:49,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-12-13 11:50:49,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:49,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-12-13 11:50:49,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:49,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:50:49,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:49,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:50:49,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:49,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-12-13 11:50:49,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:49,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-12-13 11:50:49,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:49,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:50:49,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:50:49,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277675806] [2022-12-13 11:50:49,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277675806] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:50:49,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:50:49,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-13 11:50:49,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183717586] [2022-12-13 11:50:49,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:50:49,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 11:50:49,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:50:49,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 11:50:49,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-12-13 11:50:49,793 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-12-13 11:50:53,335 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-12-13 11:50:54,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:50:54,027 INFO L93 Difference]: Finished difference Result 732 states and 885 transitions. [2022-12-13 11:50:54,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 11:50:54,027 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-12-13 11:50:54,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:50:54,029 INFO L225 Difference]: With dead ends: 732 [2022-12-13 11:50:54,029 INFO L226 Difference]: Without dead ends: 665 [2022-12-13 11:50:54,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2022-12-13 11:50:54,030 INFO L413 NwaCegarLoop]: 264 mSDtfsCounter, 386 mSDsluCounter, 2056 mSDsCounter, 0 mSdLazyCounter, 1278 mSolverCounterSat, 95 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s 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, 3.9s IncrementalHoareTripleChecker+Time [2022-12-13 11:50:54,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 2320 Invalid, 1374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1278 Invalid, 1 Unknown, 0 Unchecked, 3.9s Time] [2022-12-13 11:50:54,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2022-12-13 11:50:54,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 567. [2022-12-13 11:50:54,102 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-12-13 11:50:54,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 683 transitions. [2022-12-13 11:50:54,103 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 683 transitions. Word has length 113 [2022-12-13 11:50:54,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:50:54,103 INFO L495 AbstractCegarLoop]: Abstraction has 567 states and 683 transitions. [2022-12-13 11:50:54,103 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-12-13 11:50:54,103 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 683 transitions. [2022-12-13 11:50:54,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-12-13 11:50:54,104 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:50:54,104 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-12-13 11:50:54,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-12-13 11:50:54,104 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:50:54,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:50:54,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1717048505, now seen corresponding path program 1 times [2022-12-13 11:50:54,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:50:54,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984684255] [2022-12-13 11:50:54,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:50:54,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:50:54,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:54,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:50:54,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:54,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:50:54,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:54,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 11:50:54,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:54,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 11:50:54,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:54,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 11:50:54,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:54,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:50:54,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:54,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:50:54,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:54,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-12-13 11:50:54,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:54,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 11:50:54,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:54,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:50:54,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:50:54,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984684255] [2022-12-13 11:50:54,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984684255] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:50:54,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:50:54,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 11:50:54,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227414584] [2022-12-13 11:50:54,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:50:54,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 11:50:54,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:50:54,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 11:50:54,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-12-13 11:50:54,603 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-12-13 11:50:57,982 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-12-13 11:50:58,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:50:58,780 INFO L93 Difference]: Finished difference Result 744 states and 899 transitions. [2022-12-13 11:50:58,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 11:50:58,780 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-12-13 11:50:58,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:50:58,783 INFO L225 Difference]: With dead ends: 744 [2022-12-13 11:50:58,783 INFO L226 Difference]: Without dead ends: 610 [2022-12-13 11:50:58,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462 [2022-12-13 11:50:58,784 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 431 mSDsluCounter, 1707 mSDsCounter, 0 mSdLazyCounter, 1161 mSolverCounterSat, 96 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s 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, 3.8s IncrementalHoareTripleChecker+Time [2022-12-13 11:50:58,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 1951 Invalid, 1258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 1161 Invalid, 1 Unknown, 0 Unchecked, 3.8s Time] [2022-12-13 11:50:58,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2022-12-13 11:50:58,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 576. [2022-12-13 11:50:58,870 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-12-13 11:50:58,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 689 transitions. [2022-12-13 11:50:58,871 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 689 transitions. Word has length 110 [2022-12-13 11:50:58,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:50:58,871 INFO L495 AbstractCegarLoop]: Abstraction has 576 states and 689 transitions. [2022-12-13 11:50:58,871 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-12-13 11:50:58,871 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 689 transitions. [2022-12-13 11:50:58,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-12-13 11:50:58,872 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:50:58,872 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-12-13 11:50:58,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-12-13 11:50:58,872 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:50:58,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:50:58,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1277151609, now seen corresponding path program 1 times [2022-12-13 11:50:58,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:50:58,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123563615] [2022-12-13 11:50:58,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:50:58,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:50:58,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:59,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:50:59,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:59,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:50:59,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:59,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 11:50:59,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:59,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 11:50:59,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:59,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 11:50:59,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:59,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:50:59,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:59,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:50:59,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:59,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-12-13 11:50:59,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:59,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 11:50:59,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:59,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:50:59,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:59,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:50:59,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:59,328 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-13 11:50:59,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:50:59,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123563615] [2022-12-13 11:50:59,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123563615] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:50:59,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:50:59,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-13 11:50:59,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415243100] [2022-12-13 11:50:59,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:50:59,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 11:50:59,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:50:59,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 11:50:59,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-12-13 11:50:59,330 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-12-13 11:51:02,564 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-12-13 11:51:04,573 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-12-13 11:51:05,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:51:05,163 INFO L93 Difference]: Finished difference Result 618 states and 741 transitions. [2022-12-13 11:51:05,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 11:51:05,164 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-12-13 11:51:05,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:51:05,165 INFO L225 Difference]: With dead ends: 618 [2022-12-13 11:51:05,165 INFO L226 Difference]: Without dead ends: 524 [2022-12-13 11:51:05,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2022-12-13 11:51:05,165 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 316 mSDsluCounter, 1563 mSDsCounter, 0 mSdLazyCounter, 1121 mSolverCounterSat, 60 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s 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, 5.6s IncrementalHoareTripleChecker+Time [2022-12-13 11:51:05,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 1806 Invalid, 1183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1121 Invalid, 2 Unknown, 0 Unchecked, 5.6s Time] [2022-12-13 11:51:05,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2022-12-13 11:51:05,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 379. [2022-12-13 11:51:05,215 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-12-13 11:51:05,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 441 transitions. [2022-12-13 11:51:05,216 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 441 transitions. Word has length 117 [2022-12-13 11:51:05,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:51:05,216 INFO L495 AbstractCegarLoop]: Abstraction has 379 states and 441 transitions. [2022-12-13 11:51:05,216 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-12-13 11:51:05,217 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 441 transitions. [2022-12-13 11:51:05,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-12-13 11:51:05,217 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:51:05,217 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-12-13 11:51:05,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-12-13 11:51:05,218 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:51:05,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:51:05,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1546029661, now seen corresponding path program 1 times [2022-12-13 11:51:05,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:51:05,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979229126] [2022-12-13 11:51:05,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:51:05,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:51:05,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:51:05,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:51:05,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:51:05,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:51:05,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:51:05,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 11:51:05,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:51:05,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 11:51:05,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:51:05,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 11:51:05,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:51:05,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 11:51:05,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:51:05,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-12-13 11:51:05,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:51:05,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-12-13 11:51:05,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:51:05,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-12-13 11:51:05,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:51:05,599 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-12-13 11:51:05,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:51:05,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979229126] [2022-12-13 11:51:05,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979229126] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:51:05,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:51:05,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 11:51:05,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003080856] [2022-12-13 11:51:05,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:51:05,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:51:05,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:51:05,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:51:05,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:51:05,600 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-12-13 11:51:08,712 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-12-13 11:51:09,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:51:09,154 INFO L93 Difference]: Finished difference Result 449 states and 532 transitions. [2022-12-13 11:51:09,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 11:51:09,154 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-12-13 11:51:09,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:51:09,155 INFO L225 Difference]: With dead ends: 449 [2022-12-13 11:51:09,155 INFO L226 Difference]: Without dead ends: 423 [2022-12-13 11:51:09,155 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-12-13 11:51:09,156 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 171 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s 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.4s IncrementalHoareTripleChecker+Time [2022-12-13 11:51:09,156 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.4s Time] [2022-12-13 11:51:09,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2022-12-13 11:51:09,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 396. [2022-12-13 11:51:09,207 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-12-13 11:51:09,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 462 transitions. [2022-12-13 11:51:09,207 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 462 transitions. Word has length 116 [2022-12-13 11:51:09,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:51:09,208 INFO L495 AbstractCegarLoop]: Abstraction has 396 states and 462 transitions. [2022-12-13 11:51:09,208 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-12-13 11:51:09,208 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 462 transitions. [2022-12-13 11:51:09,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-12-13 11:51:09,208 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:51:09,209 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-12-13 11:51:09,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-12-13 11:51:09,209 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:51:09,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:51:09,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1510565347, now seen corresponding path program 1 times [2022-12-13 11:51:09,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:51:09,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707904714] [2022-12-13 11:51:09,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:51:09,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:51:09,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:51:09,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:51:09,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:51:09,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:51:09,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:51:09,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 11:51:09,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:51:09,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 11:51:09,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:51:09,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 11:51:09,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:51:09,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 11:51:09,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:51:09,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-12-13 11:51:09,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:51:09,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-12-13 11:51:09,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:51:09,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-12-13 11:51:09,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:51:09,558 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-12-13 11:51:09,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:51:09,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707904714] [2022-12-13 11:51:09,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707904714] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:51:09,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:51:09,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 11:51:09,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060396292] [2022-12-13 11:51:09,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:51:09,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:51:09,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:51:09,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:51:09,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:51:09,559 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-12-13 11:51:12,191 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-12-13 11:51:12,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:51:12,511 INFO L93 Difference]: Finished difference Result 447 states and 523 transitions. [2022-12-13 11:51:12,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 11:51:12,512 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-12-13 11:51:12,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:51:12,513 INFO L225 Difference]: With dead ends: 447 [2022-12-13 11:51:12,513 INFO L226 Difference]: Without dead ends: 380 [2022-12-13 11:51:12,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 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-12-13 11:51:12,513 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 214 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 89 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s 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, 2.8s IncrementalHoareTripleChecker+Time [2022-12-13 11:51:12,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 966 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 511 Invalid, 1 Unknown, 0 Unchecked, 2.8s Time] [2022-12-13 11:51:12,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2022-12-13 11:51:12,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 358. [2022-12-13 11:51:12,562 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-12-13 11:51:12,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 413 transitions. [2022-12-13 11:51:12,562 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 413 transitions. Word has length 116 [2022-12-13 11:51:12,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:51:12,563 INFO L495 AbstractCegarLoop]: Abstraction has 358 states and 413 transitions. [2022-12-13 11:51:12,563 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-12-13 11:51:12,563 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 413 transitions. [2022-12-13 11:51:12,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-12-13 11:51:12,563 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:51:12,564 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-12-13 11:51:12,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-12-13 11:51:12,564 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:51:12,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:51:12,564 INFO L85 PathProgramCache]: Analyzing trace with hash 2088850613, now seen corresponding path program 1 times [2022-12-13 11:51:12,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:51:12,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158419049] [2022-12-13 11:51:12,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:51:12,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:51:12,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:51:12,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:51:12,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:51:12,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:51:12,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:51:12,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 11:51:12,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:51:12,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-12-13 11:51:12,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:51:12,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-12-13 11:51:12,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:51:12,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:51:12,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:51:12,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:51:12,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:51:12,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-12-13 11:51:12,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:51:13,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-12-13 11:51:13,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:51:13,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-12-13 11:51:13,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:51:13,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:51:13,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:51:13,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158419049] [2022-12-13 11:51:13,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158419049] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:51:13,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:51:13,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 11:51:13,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753108318] [2022-12-13 11:51:13,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:51:13,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 11:51:13,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:51:13,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 11:51:13,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-12-13 11:51:13,038 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-12-13 11:51:17,636 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-12-13 11:51:19,658 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-12-13 11:51:20,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:51:20,777 INFO L93 Difference]: Finished difference Result 692 states and 815 transitions. [2022-12-13 11:51:20,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-13 11:51:20,777 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-12-13 11:51:20,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:51:20,779 INFO L225 Difference]: With dead ends: 692 [2022-12-13 11:51:20,780 INFO L226 Difference]: Without dead ends: 631 [2022-12-13 11:51:20,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=220, Invalid=902, Unknown=0, NotChecked=0, Total=1122 [2022-12-13 11:51:20,780 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 880 mSDsluCounter, 2205 mSDsCounter, 0 mSdLazyCounter, 2080 mSolverCounterSat, 267 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s 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, 7.1s IncrementalHoareTripleChecker+Time [2022-12-13 11:51:20,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [895 Valid, 2517 Invalid, 2349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [267 Valid, 2080 Invalid, 2 Unknown, 0 Unchecked, 7.1s Time] [2022-12-13 11:51:20,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2022-12-13 11:51:20,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 324. [2022-12-13 11:51:20,830 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-12-13 11:51:20,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 372 transitions. [2022-12-13 11:51:20,830 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 372 transitions. Word has length 122 [2022-12-13 11:51:20,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:51:20,831 INFO L495 AbstractCegarLoop]: Abstraction has 324 states and 372 transitions. [2022-12-13 11:51:20,831 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-12-13 11:51:20,831 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 372 transitions. [2022-12-13 11:51:20,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-12-13 11:51:20,831 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:51:20,832 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-12-13 11:51:20,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2022-12-13 11:51:20,832 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:51:20,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:51:20,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1025503595, now seen corresponding path program 1 times [2022-12-13 11:51:20,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:51:20,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196730180] [2022-12-13 11:51:20,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:51:20,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:51:20,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:51:21,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:51:21,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:51:21,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:51:21,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:51:21,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 11:51:21,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:51:21,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 11:51:21,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:51:21,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 11:51:21,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:51:21,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 11:51:21,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:51:21,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-12-13 11:51:21,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:51:21,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-12-13 11:51:21,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:51:21,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-12-13 11:51:21,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:51:21,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-12-13 11:51:21,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:51:21,412 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-12-13 11:51:21,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:51:21,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196730180] [2022-12-13 11:51:21,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196730180] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:51:21,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:51:21,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 11:51:21,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359482265] [2022-12-13 11:51:21,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:51:21,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 11:51:21,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:51:21,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 11:51:21,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-12-13 11:51:21,414 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-12-13 11:51:24,633 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-12-13 11:51:25,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:51:25,015 INFO L93 Difference]: Finished difference Result 361 states and 419 transitions. [2022-12-13 11:51:25,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 11:51:25,016 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-12-13 11:51:25,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:51:25,016 INFO L225 Difference]: With dead ends: 361 [2022-12-13 11:51:25,016 INFO L226 Difference]: Without dead ends: 269 [2022-12-13 11:51:25,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2022-12-13 11:51:25,017 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 368 mSDsluCounter, 1303 mSDsCounter, 0 mSdLazyCounter, 865 mSolverCounterSat, 107 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s 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, 3.4s IncrementalHoareTripleChecker+Time [2022-12-13 11:51:25,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 1511 Invalid, 973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 865 Invalid, 1 Unknown, 0 Unchecked, 3.4s Time] [2022-12-13 11:51:25,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-12-13 11:51:25,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 255. [2022-12-13 11:51:25,054 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-12-13 11:51:25,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 293 transitions. [2022-12-13 11:51:25,055 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 293 transitions. Word has length 125 [2022-12-13 11:51:25,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:51:25,055 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 293 transitions. [2022-12-13 11:51:25,055 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-12-13 11:51:25,055 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 293 transitions. [2022-12-13 11:51:25,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-12-13 11:51:25,056 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:51:25,056 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-12-13 11:51:25,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2022-12-13 11:51:25,056 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:51:25,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:51:25,056 INFO L85 PathProgramCache]: Analyzing trace with hash 226053049, now seen corresponding path program 1 times [2022-12-13 11:51:25,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:51:25,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733691399] [2022-12-13 11:51:25,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:51:25,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:51:25,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:51:25,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:51:25,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:51:25,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:51:25,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:51:25,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 11:51:25,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:51:25,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 11:51:25,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:51:25,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 11:51:25,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:51:25,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:51:25,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:51:25,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:51:25,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:51:25,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-12-13 11:51:25,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:51:25,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 11:51:25,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:51:25,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-12-13 11:51:25,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:51:25,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:51:25,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:51:25,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733691399] [2022-12-13 11:51:25,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733691399] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:51:25,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:51:25,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 11:51:25,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351196142] [2022-12-13 11:51:25,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:51:25,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 11:51:25,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:51:25,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 11:51:25,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-12-13 11:51:25,424 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-12-13 11:51:28,743 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-12-13 11:51:30,754 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-12-13 11:51:32,760 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-12-13 11:51:34,768 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-12-13 11:51:34,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:51:34,988 INFO L93 Difference]: Finished difference Result 323 states and 371 transitions. [2022-12-13 11:51:34,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 11:51:34,988 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-12-13 11:51:34,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:51:34,989 INFO L225 Difference]: With dead ends: 323 [2022-12-13 11:51:34,989 INFO L226 Difference]: Without dead ends: 269 [2022-12-13 11:51:34,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2022-12-13 11:51:34,990 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 214 mSDsluCounter, 842 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 34 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s 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, 9.4s IncrementalHoareTripleChecker+Time [2022-12-13 11:51:34,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 995 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 674 Invalid, 4 Unknown, 0 Unchecked, 9.4s Time] [2022-12-13 11:51:34,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-12-13 11:51:35,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 255. [2022-12-13 11:51:35,029 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-12-13 11:51:35,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 292 transitions. [2022-12-13 11:51:35,029 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 292 transitions. Word has length 131 [2022-12-13 11:51:35,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:51:35,030 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 292 transitions. [2022-12-13 11:51:35,030 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-12-13 11:51:35,030 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 292 transitions. [2022-12-13 11:51:35,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-12-13 11:51:35,030 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:51:35,030 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-12-13 11:51:35,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2022-12-13 11:51:35,031 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:51:35,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:51:35,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1225615896, now seen corresponding path program 1 times [2022-12-13 11:51:35,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:51:35,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192963128] [2022-12-13 11:51:35,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:51:35,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:51:35,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:51:35,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:51:35,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:51:35,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:51:35,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:51:35,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 11:51:35,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:51:35,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 11:51:35,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:51:35,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 11:51:35,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:51:35,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:51:35,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:51:35,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 11:51:35,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:51:35,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-12-13 11:51:35,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:51:35,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-12-13 11:51:35,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:51:35,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-12-13 11:51:35,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:51:35,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:51:35,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:51:35,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192963128] [2022-12-13 11:51:35,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192963128] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:51:35,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:51:35,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 11:51:35,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239925219] [2022-12-13 11:51:35,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:51:35,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 11:51:35,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:51:35,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 11:51:35,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-12-13 11:51:35,396 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-12-13 11:51:38,163 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-12-13 11:51:38,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:51:38,425 INFO L93 Difference]: Finished difference Result 360 states and 416 transitions. [2022-12-13 11:51:38,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 11:51:38,425 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-12-13 11:51:38,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:51:38,427 INFO L225 Difference]: With dead ends: 360 [2022-12-13 11:51:38,427 INFO L226 Difference]: Without dead ends: 308 [2022-12-13 11:51:38,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2022-12-13 11:51:38,428 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 396 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 84 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s 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, 2.8s IncrementalHoareTripleChecker+Time [2022-12-13 11:51:38,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 869 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 385 Invalid, 1 Unknown, 0 Unchecked, 2.8s Time] [2022-12-13 11:51:38,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2022-12-13 11:51:38,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 253. [2022-12-13 11:51:38,466 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-12-13 11:51:38,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 289 transitions. [2022-12-13 11:51:38,466 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 289 transitions. Word has length 132 [2022-12-13 11:51:38,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:51:38,467 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 289 transitions. [2022-12-13 11:51:38,467 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-12-13 11:51:38,467 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 289 transitions. [2022-12-13 11:51:38,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-12-13 11:51:38,467 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:51:38,467 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-12-13 11:51:38,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2022-12-13 11:51:38,467 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:51:38,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:51:38,468 INFO L85 PathProgramCache]: Analyzing trace with hash -271290531, now seen corresponding path program 1 times [2022-12-13 11:51:38,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:51:38,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435116466] [2022-12-13 11:51:38,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:51:38,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms