./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.10.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8bfe40-91a3-4f41-a178-aab45ecf7871/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8bfe40-91a3-4f41-a178-aab45ecf7871/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8bfe40-91a3-4f41-a178-aab45ecf7871/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8bfe40-91a3-4f41-a178-aab45ecf7871/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.10.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8bfe40-91a3-4f41-a178-aab45ecf7871/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8bfe40-91a3-4f41-a178-aab45ecf7871/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f9db8f562e00e8e2c77bd4109a87025a2d9cfdc1d504bc43872dc3be0602b46a --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:21:29,030 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:21:29,032 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:21:29,082 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:21:29,083 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:21:29,086 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:21:29,088 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:21:29,089 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:21:29,095 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:21:29,098 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:21:29,099 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:21:29,102 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:21:29,103 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:21:29,107 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:21:29,109 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:21:29,110 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:21:29,113 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:21:29,120 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:21:29,121 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:21:29,124 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:21:29,129 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:21:29,131 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:21:29,132 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:21:29,134 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:21:29,138 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:21:29,142 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:21:29,142 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:21:29,144 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:21:29,145 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:21:29,146 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:21:29,146 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:21:29,147 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:21:29,149 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:21:29,150 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:21:29,151 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:21:29,152 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:21:29,153 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:21:29,153 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:21:29,153 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:21:29,154 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:21:29,155 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:21:29,156 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8bfe40-91a3-4f41-a178-aab45ecf7871/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:21:29,197 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:21:29,197 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:21:29,198 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:21:29,198 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:21:29,199 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:21:29,199 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:21:29,200 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:21:29,200 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:21:29,201 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:21:29,201 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:21:29,202 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:21:29,203 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:21:29,203 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:21:29,203 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:21:29,203 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:21:29,203 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:21:29,204 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:21:29,204 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:21:29,204 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:21:29,204 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:21:29,205 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:21:29,205 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:21:29,205 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:21:29,205 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:21:29,206 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:21:29,206 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:21:29,206 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:21:29,207 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:21:29,207 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:21:29,207 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:21:29,207 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:21:29,207 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:21:29,208 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:21:29,208 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8bfe40-91a3-4f41-a178-aab45ecf7871/bin/uautomizer-Dbtcem3rbc/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8bfe40-91a3-4f41-a178-aab45ecf7871/bin/uautomizer-Dbtcem3rbc Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f9db8f562e00e8e2c77bd4109a87025a2d9cfdc1d504bc43872dc3be0602b46a [2022-11-02 20:21:29,557 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:21:29,583 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:21:29,586 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:21:29,587 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:21:29,588 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:21:29,590 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8bfe40-91a3-4f41-a178-aab45ecf7871/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.10.cil-2.c [2022-11-02 20:21:29,668 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8bfe40-91a3-4f41-a178-aab45ecf7871/bin/uautomizer-Dbtcem3rbc/data/26c9bd502/93c797709a934868ae064026e496b0cf/FLAG9c8ea21f4 [2022-11-02 20:21:30,219 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:21:30,219 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8bfe40-91a3-4f41-a178-aab45ecf7871/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.10.cil-2.c [2022-11-02 20:21:30,243 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8bfe40-91a3-4f41-a178-aab45ecf7871/bin/uautomizer-Dbtcem3rbc/data/26c9bd502/93c797709a934868ae064026e496b0cf/FLAG9c8ea21f4 [2022-11-02 20:21:30,564 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8bfe40-91a3-4f41-a178-aab45ecf7871/bin/uautomizer-Dbtcem3rbc/data/26c9bd502/93c797709a934868ae064026e496b0cf [2022-11-02 20:21:30,566 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:21:30,568 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:21:30,570 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:21:30,570 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:21:30,574 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:21:30,574 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:21:30" (1/1) ... [2022-11-02 20:21:30,577 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1149e576 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:21:30, skipping insertion in model container [2022-11-02 20:21:30,578 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:21:30" (1/1) ... [2022-11-02 20:21:30,585 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:21:30,649 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:21:30,855 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8bfe40-91a3-4f41-a178-aab45ecf7871/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.10.cil-2.c[911,924] [2022-11-02 20:21:30,929 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8bfe40-91a3-4f41-a178-aab45ecf7871/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.10.cil-2.c[8416,8429] [2022-11-02 20:21:31,073 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:21:31,084 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:21:31,097 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8bfe40-91a3-4f41-a178-aab45ecf7871/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.10.cil-2.c[911,924] [2022-11-02 20:21:31,119 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8bfe40-91a3-4f41-a178-aab45ecf7871/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.10.cil-2.c[8416,8429] [2022-11-02 20:21:31,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:21:31,200 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:21:31,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:21:31 WrapperNode [2022-11-02 20:21:31,201 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:21:31,202 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:21:31,202 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:21:31,202 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:21:31,214 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:21:31" (1/1) ... [2022-11-02 20:21:31,233 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:21:31" (1/1) ... [2022-11-02 20:21:31,308 INFO L138 Inliner]: procedures = 75, calls = 91, calls flagged for inlining = 44, calls inlined = 44, statements flattened = 962 [2022-11-02 20:21:31,322 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:21:31,323 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:21:31,323 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:21:31,323 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:21:31,339 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:21:31" (1/1) ... [2022-11-02 20:21:31,339 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:21:31" (1/1) ... [2022-11-02 20:21:31,343 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:21:31" (1/1) ... [2022-11-02 20:21:31,344 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:21:31" (1/1) ... [2022-11-02 20:21:31,357 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:21:31" (1/1) ... [2022-11-02 20:21:31,372 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:21:31" (1/1) ... [2022-11-02 20:21:31,375 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:21:31" (1/1) ... [2022-11-02 20:21:31,379 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:21:31" (1/1) ... [2022-11-02 20:21:31,384 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:21:31,385 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:21:31,385 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:21:31,385 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:21:31,386 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:21:31" (1/1) ... [2022-11-02 20:21:31,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:21:31,405 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8bfe40-91a3-4f41-a178-aab45ecf7871/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:21:31,420 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8bfe40-91a3-4f41-a178-aab45ecf7871/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:21:31,474 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8bfe40-91a3-4f41-a178-aab45ecf7871/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:21:31,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:21:31,497 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-11-02 20:21:31,497 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-11-02 20:21:31,497 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-11-02 20:21:31,497 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-11-02 20:21:31,498 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-11-02 20:21:31,498 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-11-02 20:21:31,498 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-11-02 20:21:31,498 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-11-02 20:21:31,498 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-11-02 20:21:31,498 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-11-02 20:21:31,499 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-11-02 20:21:31,499 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-11-02 20:21:31,499 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-11-02 20:21:31,499 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-11-02 20:21:31,499 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-11-02 20:21:31,500 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-11-02 20:21:31,500 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-11-02 20:21:31,500 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-11-02 20:21:31,500 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-11-02 20:21:31,500 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-11-02 20:21:31,501 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-11-02 20:21:31,501 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-11-02 20:21:31,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:21:31,501 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-11-02 20:21:31,501 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-11-02 20:21:31,501 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-11-02 20:21:31,502 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-11-02 20:21:31,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:21:31,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:21:31,512 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-11-02 20:21:31,512 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-11-02 20:21:31,727 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:21:31,729 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:21:32,606 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2022-11-02 20:21:32,607 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2022-11-02 20:21:32,702 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:21:32,721 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:21:32,721 INFO L300 CfgBuilder]: Removed 17 assume(true) statements. [2022-11-02 20:21:32,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:21:32 BoogieIcfgContainer [2022-11-02 20:21:32,725 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:21:32,728 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:21:32,728 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:21:32,733 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:21:32,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:21:30" (1/3) ... [2022-11-02 20:21:32,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4552d1fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:21:32, skipping insertion in model container [2022-11-02 20:21:32,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:21:31" (2/3) ... [2022-11-02 20:21:32,735 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4552d1fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:21:32, skipping insertion in model container [2022-11-02 20:21:32,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:21:32" (3/3) ... [2022-11-02 20:21:32,736 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.10.cil-2.c [2022-11-02 20:21:32,756 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:21:32,756 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-02 20:21:32,862 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:21:32,869 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;@5b1df48e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:21:32,870 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-02 20:21:32,876 INFO L276 IsEmpty]: Start isEmpty. Operand has 449 states, 392 states have (on average 1.6301020408163265) internal successors, (639), 398 states have internal predecessors, (639), 40 states have call successors, (40), 14 states have call predecessors, (40), 14 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2022-11-02 20:21:32,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-02 20:21:32,889 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:32,890 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:21:32,890 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:21:32,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:32,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1246254058, now seen corresponding path program 1 times [2022-11-02 20:21:32,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:32,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269950335] [2022-11-02 20:21:32,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:32,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:33,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:33,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:21:33,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:33,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:21:33,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:33,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:21:33,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:33,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:21:33,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:33,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:21:33,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:33,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-02 20:21:33,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:33,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:21:33,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:33,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:21:33,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:33,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269950335] [2022-11-02 20:21:33,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269950335] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:33,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:33,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:21:33,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797932351] [2022-11-02 20:21:33,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:33,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:21:33,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:33,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:21:33,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:21:33,666 INFO L87 Difference]: Start difference. First operand has 449 states, 392 states have (on average 1.6301020408163265) internal successors, (639), 398 states have internal predecessors, (639), 40 states have call successors, (40), 14 states have call predecessors, (40), 14 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-02 20:21:35,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:35,175 INFO L93 Difference]: Finished difference Result 1023 states and 1629 transitions. [2022-11-02 20:21:35,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:21:35,178 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-11-02 20:21:35,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:35,193 INFO L225 Difference]: With dead ends: 1023 [2022-11-02 20:21:35,194 INFO L226 Difference]: Without dead ends: 590 [2022-11-02 20:21:35,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:21:35,208 INFO L413 NwaCegarLoop]: 688 mSDtfsCounter, 1142 mSDsluCounter, 1276 mSDsCounter, 0 mSdLazyCounter, 999 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1149 SdHoareTripleChecker+Valid, 1964 SdHoareTripleChecker+Invalid, 1202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 999 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:35,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1149 Valid, 1964 Invalid, 1202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 999 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-02 20:21:35,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2022-11-02 20:21:35,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 551. [2022-11-02 20:21:35,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 474 states have (on average 1.518987341772152) internal successors, (720), 480 states have internal predecessors, (720), 53 states have call successors, (53), 21 states have call predecessors, (53), 22 states have return successors, (56), 52 states have call predecessors, (56), 51 states have call successors, (56) [2022-11-02 20:21:35,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 829 transitions. [2022-11-02 20:21:35,323 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 829 transitions. Word has length 65 [2022-11-02 20:21:35,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:35,323 INFO L495 AbstractCegarLoop]: Abstraction has 551 states and 829 transitions. [2022-11-02 20:21:35,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-02 20:21:35,324 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 829 transitions. [2022-11-02 20:21:35,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-02 20:21:35,327 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:35,327 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:21:35,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:21:35,328 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:21:35,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:35,329 INFO L85 PathProgramCache]: Analyzing trace with hash 432634582, now seen corresponding path program 1 times [2022-11-02 20:21:35,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:35,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622334574] [2022-11-02 20:21:35,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:35,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:35,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:35,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:21:35,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:35,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:21:35,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:35,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:21:35,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:35,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:21:35,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:35,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:21:35,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:35,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-02 20:21:35,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:35,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:21:35,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:35,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-11-02 20:21:35,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:35,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622334574] [2022-11-02 20:21:35,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622334574] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:35,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:35,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:21:35,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003801546] [2022-11-02 20:21:35,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:35,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:21:35,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:35,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:21:35,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:21:35,607 INFO L87 Difference]: Start difference. First operand 551 states and 829 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-02 20:21:37,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:37,127 INFO L93 Difference]: Finished difference Result 948 states and 1395 transitions. [2022-11-02 20:21:37,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 20:21:37,128 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), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-11-02 20:21:37,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:37,134 INFO L225 Difference]: With dead ends: 948 [2022-11-02 20:21:37,134 INFO L226 Difference]: Without dead ends: 739 [2022-11-02 20:21:37,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-11-02 20:21:37,137 INFO L413 NwaCegarLoop]: 750 mSDtfsCounter, 1309 mSDsluCounter, 1876 mSDsCounter, 0 mSdLazyCounter, 1413 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1340 SdHoareTripleChecker+Valid, 2626 SdHoareTripleChecker+Invalid, 1546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 1413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:37,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1340 Valid, 2626 Invalid, 1546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 1413 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-02 20:21:37,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2022-11-02 20:21:37,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 663. [2022-11-02 20:21:37,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 564 states have (on average 1.5) internal successors, (846), 572 states have internal predecessors, (846), 66 states have call successors, (66), 28 states have call predecessors, (66), 31 states have return successors, (77), 66 states have call predecessors, (77), 64 states have call successors, (77) [2022-11-02 20:21:37,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 989 transitions. [2022-11-02 20:21:37,265 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 989 transitions. Word has length 65 [2022-11-02 20:21:37,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:37,266 INFO L495 AbstractCegarLoop]: Abstraction has 663 states and 989 transitions. [2022-11-02 20:21:37,266 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), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-02 20:21:37,266 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 989 transitions. [2022-11-02 20:21:37,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-02 20:21:37,276 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:37,276 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:21:37,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:21:37,276 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:21:37,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:37,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1595951528, now seen corresponding path program 1 times [2022-11-02 20:21:37,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:37,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776972195] [2022-11-02 20:21:37,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:37,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:37,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:37,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:21:37,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:37,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:21:37,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:37,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:21:37,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:37,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:21:37,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:37,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:21:37,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:37,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-02 20:21:37,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:37,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:21:37,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:37,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-11-02 20:21:37,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:37,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776972195] [2022-11-02 20:21:37,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776972195] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:37,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:37,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:21:37,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075894387] [2022-11-02 20:21:37,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:37,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:21:37,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:37,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:21:37,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:21:37,541 INFO L87 Difference]: Start difference. First operand 663 states and 989 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-11-02 20:21:39,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:39,939 INFO L93 Difference]: Finished difference Result 2209 states and 3187 transitions. [2022-11-02 20:21:39,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-02 20:21:39,941 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 65 [2022-11-02 20:21:39,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:39,952 INFO L225 Difference]: With dead ends: 2209 [2022-11-02 20:21:39,953 INFO L226 Difference]: Without dead ends: 1876 [2022-11-02 20:21:39,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-11-02 20:21:39,962 INFO L413 NwaCegarLoop]: 806 mSDtfsCounter, 3910 mSDsluCounter, 1780 mSDsCounter, 0 mSdLazyCounter, 1730 mSolverCounterSat, 739 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3928 SdHoareTripleChecker+Valid, 2586 SdHoareTripleChecker+Invalid, 2469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 739 IncrementalHoareTripleChecker+Valid, 1730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:39,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3928 Valid, 2586 Invalid, 2469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [739 Valid, 1730 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-02 20:21:39,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1876 states. [2022-11-02 20:21:40,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1876 to 1716. [2022-11-02 20:21:40,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1716 states, 1412 states have (on average 1.4093484419263456) internal successors, (1990), 1435 states have internal predecessors, (1990), 176 states have call successors, (176), 111 states have call predecessors, (176), 126 states have return successors, (210), 172 states have call predecessors, (210), 174 states have call successors, (210) [2022-11-02 20:21:40,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1716 states to 1716 states and 2376 transitions. [2022-11-02 20:21:40,150 INFO L78 Accepts]: Start accepts. Automaton has 1716 states and 2376 transitions. Word has length 65 [2022-11-02 20:21:40,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:40,150 INFO L495 AbstractCegarLoop]: Abstraction has 1716 states and 2376 transitions. [2022-11-02 20:21:40,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-11-02 20:21:40,151 INFO L276 IsEmpty]: Start isEmpty. Operand 1716 states and 2376 transitions. [2022-11-02 20:21:40,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-02 20:21:40,152 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:40,152 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:21:40,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:21:40,153 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:21:40,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:40,153 INFO L85 PathProgramCache]: Analyzing trace with hash -31119566, now seen corresponding path program 1 times [2022-11-02 20:21:40,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:40,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300865851] [2022-11-02 20:21:40,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:40,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:40,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:40,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:21:40,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:40,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:21:40,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:40,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:21:40,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:40,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:21:40,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:40,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 20:21:40,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:40,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-02 20:21:40,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:40,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-02 20:21:40,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:40,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:21:40,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:40,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300865851] [2022-11-02 20:21:40,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300865851] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:40,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:40,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:21:40,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661329802] [2022-11-02 20:21:40,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:40,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:21:40,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:40,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:21:40,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:21:40,352 INFO L87 Difference]: Start difference. First operand 1716 states and 2376 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-02 20:21:41,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:41,892 INFO L93 Difference]: Finished difference Result 3244 states and 4455 transitions. [2022-11-02 20:21:41,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:21:41,893 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-11-02 20:21:41,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:41,903 INFO L225 Difference]: With dead ends: 3244 [2022-11-02 20:21:41,903 INFO L226 Difference]: Without dead ends: 1864 [2022-11-02 20:21:41,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:21:41,913 INFO L413 NwaCegarLoop]: 659 mSDtfsCounter, 586 mSDsluCounter, 2270 mSDsCounter, 0 mSdLazyCounter, 1567 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 587 SdHoareTripleChecker+Valid, 2929 SdHoareTripleChecker+Invalid, 1664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:41,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [587 Valid, 2929 Invalid, 1664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1567 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-02 20:21:41,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1864 states. [2022-11-02 20:21:42,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1864 to 1756. [2022-11-02 20:21:42,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1756 states, 1444 states have (on average 1.3961218836565097) internal successors, (2016), 1467 states have internal predecessors, (2016), 176 states have call successors, (176), 111 states have call predecessors, (176), 134 states have return successors, (218), 180 states have call predecessors, (218), 174 states have call successors, (218) [2022-11-02 20:21:42,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1756 states to 1756 states and 2410 transitions. [2022-11-02 20:21:42,046 INFO L78 Accepts]: Start accepts. Automaton has 1756 states and 2410 transitions. Word has length 66 [2022-11-02 20:21:42,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:42,047 INFO L495 AbstractCegarLoop]: Abstraction has 1756 states and 2410 transitions. [2022-11-02 20:21:42,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-02 20:21:42,047 INFO L276 IsEmpty]: Start isEmpty. Operand 1756 states and 2410 transitions. [2022-11-02 20:21:42,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-02 20:21:42,049 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:42,049 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:21:42,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:21:42,049 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:21:42,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:42,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1060478864, now seen corresponding path program 1 times [2022-11-02 20:21:42,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:42,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876606803] [2022-11-02 20:21:42,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:42,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:42,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:42,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:21:42,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:42,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:21:42,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:42,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:21:42,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:42,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:21:42,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:42,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 20:21:42,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:42,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-02 20:21:42,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:42,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-02 20:21:42,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:42,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:21:42,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:42,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876606803] [2022-11-02 20:21:42,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876606803] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:42,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:42,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:21:42,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409106464] [2022-11-02 20:21:42,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:42,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:21:42,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:42,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:21:42,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:21:42,278 INFO L87 Difference]: Start difference. First operand 1756 states and 2410 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-02 20:21:44,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:44,739 INFO L93 Difference]: Finished difference Result 5328 states and 7284 transitions. [2022-11-02 20:21:44,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-02 20:21:44,739 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 66 [2022-11-02 20:21:44,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:44,749 INFO L225 Difference]: With dead ends: 5328 [2022-11-02 20:21:44,750 INFO L226 Difference]: Without dead ends: 2147 [2022-11-02 20:21:44,757 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-11-02 20:21:44,758 INFO L413 NwaCegarLoop]: 797 mSDtfsCounter, 4055 mSDsluCounter, 1806 mSDsCounter, 0 mSdLazyCounter, 1651 mSolverCounterSat, 761 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4073 SdHoareTripleChecker+Valid, 2603 SdHoareTripleChecker+Invalid, 2412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 761 IncrementalHoareTripleChecker+Valid, 1651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:44,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4073 Valid, 2603 Invalid, 2412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [761 Valid, 1651 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-02 20:21:44,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2147 states. [2022-11-02 20:21:44,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2147 to 1967. [2022-11-02 20:21:44,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1967 states, 1583 states have (on average 1.3531269740998104) internal successors, (2142), 1608 states have internal predecessors, (2142), 216 states have call successors, (216), 139 states have call predecessors, (216), 166 states have return successors, (264), 222 states have call predecessors, (264), 214 states have call successors, (264) [2022-11-02 20:21:44,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 2622 transitions. [2022-11-02 20:21:44,944 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 2622 transitions. Word has length 66 [2022-11-02 20:21:44,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:44,945 INFO L495 AbstractCegarLoop]: Abstraction has 1967 states and 2622 transitions. [2022-11-02 20:21:44,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-02 20:21:44,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 2622 transitions. [2022-11-02 20:21:44,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-11-02 20:21:44,947 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:44,947 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 20:21:44,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:21:44,948 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:21:44,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:44,948 INFO L85 PathProgramCache]: Analyzing trace with hash 135267171, now seen corresponding path program 1 times [2022-11-02 20:21:44,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:44,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680209061] [2022-11-02 20:21:44,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:44,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:44,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:45,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:21:45,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:45,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:21:45,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:45,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:21:45,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:45,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:21:45,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:45,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 20:21:45,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:45,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-02 20:21:45,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:45,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-02 20:21:45,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:45,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-02 20:21:45,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:45,147 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-02 20:21:45,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:45,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680209061] [2022-11-02 20:21:45,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680209061] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:45,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:45,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:21:45,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13073234] [2022-11-02 20:21:45,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:45,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:21:45,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:45,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:21:45,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:21:45,150 INFO L87 Difference]: Start difference. First operand 1967 states and 2622 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-02 20:21:46,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:46,609 INFO L93 Difference]: Finished difference Result 3792 states and 5024 transitions. [2022-11-02 20:21:46,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:21:46,610 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 91 [2022-11-02 20:21:46,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:46,621 INFO L225 Difference]: With dead ends: 3792 [2022-11-02 20:21:46,621 INFO L226 Difference]: Without dead ends: 2161 [2022-11-02 20:21:46,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:21:46,627 INFO L413 NwaCegarLoop]: 647 mSDtfsCounter, 581 mSDsluCounter, 2229 mSDsCounter, 0 mSdLazyCounter, 1538 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 2876 SdHoareTripleChecker+Invalid, 1636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:46,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 2876 Invalid, 1636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1538 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-02 20:21:46,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2161 states. [2022-11-02 20:21:46,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2161 to 2027. [2022-11-02 20:21:46,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2027 states, 1631 states have (on average 1.3390557939914163) internal successors, (2184), 1656 states have internal predecessors, (2184), 216 states have call successors, (216), 139 states have call predecessors, (216), 178 states have return successors, (276), 234 states have call predecessors, (276), 214 states have call successors, (276) [2022-11-02 20:21:46,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2027 states to 2027 states and 2676 transitions. [2022-11-02 20:21:46,796 INFO L78 Accepts]: Start accepts. Automaton has 2027 states and 2676 transitions. Word has length 91 [2022-11-02 20:21:46,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:46,798 INFO L495 AbstractCegarLoop]: Abstraction has 2027 states and 2676 transitions. [2022-11-02 20:21:46,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-02 20:21:46,800 INFO L276 IsEmpty]: Start isEmpty. Operand 2027 states and 2676 transitions. [2022-11-02 20:21:46,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-11-02 20:21:46,807 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:46,807 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 20:21:46,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:21:46,807 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:21:46,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:46,808 INFO L85 PathProgramCache]: Analyzing trace with hash 579167845, now seen corresponding path program 1 times [2022-11-02 20:21:46,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:46,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863667644] [2022-11-02 20:21:46,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:46,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:46,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:46,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:21:46,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:47,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:21:47,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:47,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:21:47,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:47,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:21:47,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:47,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 20:21:47,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:47,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-02 20:21:47,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:47,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-02 20:21:47,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:47,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-02 20:21:47,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:47,061 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-02 20:21:47,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:47,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863667644] [2022-11-02 20:21:47,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863667644] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:47,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:47,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:21:47,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367766249] [2022-11-02 20:21:47,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:47,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:21:47,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:47,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:21:47,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:21:47,063 INFO L87 Difference]: Start difference. First operand 2027 states and 2676 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-02 20:21:48,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:48,474 INFO L93 Difference]: Finished difference Result 3554 states and 4640 transitions. [2022-11-02 20:21:48,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 20:21:48,475 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 91 [2022-11-02 20:21:48,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:48,485 INFO L225 Difference]: With dead ends: 3554 [2022-11-02 20:21:48,485 INFO L226 Difference]: Without dead ends: 2101 [2022-11-02 20:21:48,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2022-11-02 20:21:48,490 INFO L413 NwaCegarLoop]: 678 mSDtfsCounter, 1621 mSDsluCounter, 1323 mSDsCounter, 0 mSdLazyCounter, 1189 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1652 SdHoareTripleChecker+Valid, 2001 SdHoareTripleChecker+Invalid, 1397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 1189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:48,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1652 Valid, 2001 Invalid, 1397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 1189 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-02 20:21:48,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2101 states. [2022-11-02 20:21:48,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2101 to 1806. [2022-11-02 20:21:48,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1806 states, 1463 states have (on average 1.343814080656186) internal successors, (1966), 1483 states have internal predecessors, (1966), 188 states have call successors, (188), 120 states have call predecessors, (188), 153 states have return successors, (236), 204 states have call predecessors, (236), 186 states have call successors, (236) [2022-11-02 20:21:48,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1806 states to 1806 states and 2390 transitions. [2022-11-02 20:21:48,642 INFO L78 Accepts]: Start accepts. Automaton has 1806 states and 2390 transitions. Word has length 91 [2022-11-02 20:21:48,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:48,644 INFO L495 AbstractCegarLoop]: Abstraction has 1806 states and 2390 transitions. [2022-11-02 20:21:48,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-02 20:21:48,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1806 states and 2390 transitions. [2022-11-02 20:21:48,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-11-02 20:21:48,645 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:48,645 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 20:21:48,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:21:48,646 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:21:48,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:48,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1776637405, now seen corresponding path program 1 times [2022-11-02 20:21:48,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:48,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596457184] [2022-11-02 20:21:48,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:48,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:48,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:48,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:21:48,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:48,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:21:48,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:48,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:21:48,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:48,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:21:48,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:48,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 20:21:48,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:48,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-02 20:21:48,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:48,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-02 20:21:48,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:48,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-02 20:21:48,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:48,794 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 20:21:48,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:48,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596457184] [2022-11-02 20:21:48,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596457184] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:48,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:48,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:21:48,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181422104] [2022-11-02 20:21:48,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:48,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:21:48,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:48,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:21:48,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:21:48,796 INFO L87 Difference]: Start difference. First operand 1806 states and 2390 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-02 20:21:49,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:49,554 INFO L93 Difference]: Finished difference Result 4958 states and 6502 transitions. [2022-11-02 20:21:49,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:21:49,554 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 91 [2022-11-02 20:21:49,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:49,570 INFO L225 Difference]: With dead ends: 4958 [2022-11-02 20:21:49,570 INFO L226 Difference]: Without dead ends: 3489 [2022-11-02 20:21:49,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:21:49,575 INFO L413 NwaCegarLoop]: 675 mSDtfsCounter, 1233 mSDsluCounter, 1323 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1265 SdHoareTripleChecker+Valid, 1998 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:49,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1265 Valid, 1998 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:21:49,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3489 states. [2022-11-02 20:21:49,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3489 to 3275. [2022-11-02 20:21:49,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3275 states, 2612 states have (on average 1.2993874425727412) internal successors, (3394), 2661 states have internal predecessors, (3394), 349 states have call successors, (349), 233 states have call predecessors, (349), 312 states have return successors, (519), 383 states have call predecessors, (519), 347 states have call successors, (519) [2022-11-02 20:21:49,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3275 states to 3275 states and 4262 transitions. [2022-11-02 20:21:49,838 INFO L78 Accepts]: Start accepts. Automaton has 3275 states and 4262 transitions. Word has length 91 [2022-11-02 20:21:49,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:49,839 INFO L495 AbstractCegarLoop]: Abstraction has 3275 states and 4262 transitions. [2022-11-02 20:21:49,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-02 20:21:49,839 INFO L276 IsEmpty]: Start isEmpty. Operand 3275 states and 4262 transitions. [2022-11-02 20:21:49,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-11-02 20:21:49,841 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:49,841 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 20:21:49,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:21:49,841 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:21:49,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:49,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1460491813, now seen corresponding path program 1 times [2022-11-02 20:21:49,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:49,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349799743] [2022-11-02 20:21:49,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:49,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:49,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:49,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:21:49,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:49,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:21:49,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:49,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:21:49,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:49,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:21:49,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:49,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 20:21:49,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:49,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-02 20:21:49,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:49,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-02 20:21:49,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:49,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-02 20:21:49,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:49,920 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-02 20:21:49,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:49,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349799743] [2022-11-02 20:21:49,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349799743] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:49,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:49,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:21:49,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815332618] [2022-11-02 20:21:49,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:49,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:21:49,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:49,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:21:49,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:21:49,923 INFO L87 Difference]: Start difference. First operand 3275 states and 4262 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-02 20:21:50,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:50,717 INFO L93 Difference]: Finished difference Result 4859 states and 6246 transitions. [2022-11-02 20:21:50,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:21:50,717 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 91 [2022-11-02 20:21:50,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:50,726 INFO L225 Difference]: With dead ends: 4859 [2022-11-02 20:21:50,726 INFO L226 Difference]: Without dead ends: 1921 [2022-11-02 20:21:50,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:21:50,732 INFO L413 NwaCegarLoop]: 646 mSDtfsCounter, 696 mSDsluCounter, 1135 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 1781 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:50,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 1781 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:21:50,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1921 states. [2022-11-02 20:21:50,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1921 to 1806. [2022-11-02 20:21:50,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1806 states, 1463 states have (on average 1.3185235816814764) internal successors, (1929), 1483 states have internal predecessors, (1929), 188 states have call successors, (188), 120 states have call predecessors, (188), 153 states have return successors, (236), 204 states have call predecessors, (236), 186 states have call successors, (236) [2022-11-02 20:21:50,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1806 states to 1806 states and 2353 transitions. [2022-11-02 20:21:50,866 INFO L78 Accepts]: Start accepts. Automaton has 1806 states and 2353 transitions. Word has length 91 [2022-11-02 20:21:50,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:50,866 INFO L495 AbstractCegarLoop]: Abstraction has 1806 states and 2353 transitions. [2022-11-02 20:21:50,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-02 20:21:50,866 INFO L276 IsEmpty]: Start isEmpty. Operand 1806 states and 2353 transitions. [2022-11-02 20:21:50,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-11-02 20:21:50,868 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:50,868 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 20:21:50,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:21:50,868 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:21:50,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:50,869 INFO L85 PathProgramCache]: Analyzing trace with hash 186814586, now seen corresponding path program 1 times [2022-11-02 20:21:50,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:50,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606546448] [2022-11-02 20:21:50,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:50,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:50,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:50,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:21:50,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:50,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:21:50,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:51,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:21:51,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:51,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:21:51,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:51,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 20:21:51,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:51,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-02 20:21:51,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:51,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-02 20:21:51,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:51,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-02 20:21:51,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:51,043 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:21:51,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:51,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606546448] [2022-11-02 20:21:51,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606546448] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:51,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:51,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:21:51,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811385728] [2022-11-02 20:21:51,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:51,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:21:51,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:51,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:21:51,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:21:51,045 INFO L87 Difference]: Start difference. First operand 1806 states and 2353 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-02 20:21:52,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:52,826 INFO L93 Difference]: Finished difference Result 4224 states and 5436 transitions. [2022-11-02 20:21:52,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-02 20:21:52,826 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 92 [2022-11-02 20:21:52,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:52,839 INFO L225 Difference]: With dead ends: 4224 [2022-11-02 20:21:52,839 INFO L226 Difference]: Without dead ends: 2604 [2022-11-02 20:21:52,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2022-11-02 20:21:52,843 INFO L413 NwaCegarLoop]: 716 mSDtfsCounter, 2310 mSDsluCounter, 1353 mSDsCounter, 0 mSdLazyCounter, 1316 mSolverCounterSat, 479 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2351 SdHoareTripleChecker+Valid, 2069 SdHoareTripleChecker+Invalid, 1795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 479 IncrementalHoareTripleChecker+Valid, 1316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:52,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2351 Valid, 2069 Invalid, 1795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [479 Valid, 1316 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-02 20:21:52,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2604 states. [2022-11-02 20:21:53,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2604 to 2427. [2022-11-02 20:21:53,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2427 states, 1930 states have (on average 1.2803108808290156) internal successors, (2471), 1958 states have internal predecessors, (2471), 265 states have call successors, (265), 168 states have call predecessors, (265), 230 states have return successors, (367), 302 states have call predecessors, (367), 263 states have call successors, (367) [2022-11-02 20:21:53,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2427 states to 2427 states and 3103 transitions. [2022-11-02 20:21:53,043 INFO L78 Accepts]: Start accepts. Automaton has 2427 states and 3103 transitions. Word has length 92 [2022-11-02 20:21:53,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:53,044 INFO L495 AbstractCegarLoop]: Abstraction has 2427 states and 3103 transitions. [2022-11-02 20:21:53,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-02 20:21:53,044 INFO L276 IsEmpty]: Start isEmpty. Operand 2427 states and 3103 transitions. [2022-11-02 20:21:53,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-11-02 20:21:53,047 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:53,047 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:21:53,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:21:53,047 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:21:53,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:53,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1184625881, now seen corresponding path program 1 times [2022-11-02 20:21:53,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:53,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765803070] [2022-11-02 20:21:53,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:53,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:53,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:53,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:21:53,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:53,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:21:53,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:53,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:21:53,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:53,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:21:53,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:53,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 20:21:53,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:53,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-02 20:21:53,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:53,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-02 20:21:53,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:53,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-02 20:21:53,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:53,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-02 20:21:53,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:53,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-02 20:21:53,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:53,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-02 20:21:53,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:53,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:21:53,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:53,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:21:53,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:53,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-02 20:21:53,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:53,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-02 20:21:53,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:53,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-02 20:21:53,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:53,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-02 20:21:53,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:53,272 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-11-02 20:21:53,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:53,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765803070] [2022-11-02 20:21:53,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765803070] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:21:53,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330063851] [2022-11-02 20:21:53,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:53,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:21:53,273 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8bfe40-91a3-4f41-a178-aab45ecf7871/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:21:53,275 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8bfe40-91a3-4f41-a178-aab45ecf7871/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:21:53,297 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8bfe40-91a3-4f41-a178-aab45ecf7871/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:21:53,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:53,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-02 20:21:53,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:21:53,642 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-11-02 20:21:53,642 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:21:53,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330063851] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:53,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:21:53,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-11-02 20:21:53,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893214883] [2022-11-02 20:21:53,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:53,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:21:53,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:53,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:21:53,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:21:53,645 INFO L87 Difference]: Start difference. First operand 2427 states and 3103 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-02 20:21:54,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:54,005 INFO L93 Difference]: Finished difference Result 6353 states and 7932 transitions. [2022-11-02 20:21:54,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:21:54,006 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 163 [2022-11-02 20:21:54,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:54,025 INFO L225 Difference]: With dead ends: 6353 [2022-11-02 20:21:54,026 INFO L226 Difference]: Without dead ends: 4339 [2022-11-02 20:21:54,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:21:54,032 INFO L413 NwaCegarLoop]: 670 mSDtfsCounter, 61 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1307 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:54,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1307 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:21:54,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4339 states. [2022-11-02 20:21:54,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4339 to 4297. [2022-11-02 20:21:54,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4297 states, 3387 states have (on average 1.247416592855034) internal successors, (4225), 3438 states have internal predecessors, (4225), 472 states have call successors, (472), 329 states have call predecessors, (472), 436 states have return successors, (635), 531 states have call predecessors, (635), 470 states have call successors, (635) [2022-11-02 20:21:54,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4297 states to 4297 states and 5332 transitions. [2022-11-02 20:21:54,391 INFO L78 Accepts]: Start accepts. Automaton has 4297 states and 5332 transitions. Word has length 163 [2022-11-02 20:21:54,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:54,391 INFO L495 AbstractCegarLoop]: Abstraction has 4297 states and 5332 transitions. [2022-11-02 20:21:54,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-02 20:21:54,392 INFO L276 IsEmpty]: Start isEmpty. Operand 4297 states and 5332 transitions. [2022-11-02 20:21:54,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-11-02 20:21:54,395 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:54,395 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:21:54,436 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8bfe40-91a3-4f41-a178-aab45ecf7871/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:21:54,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8bfe40-91a3-4f41-a178-aab45ecf7871/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-02 20:21:54,617 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:21:54,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:54,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1277878197, now seen corresponding path program 1 times [2022-11-02 20:21:54,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:54,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351751106] [2022-11-02 20:21:54,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:54,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:54,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:54,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:21:54,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:54,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:21:54,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:54,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:21:54,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:54,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-02 20:21:54,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:54,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-11-02 20:21:54,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:54,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:21:54,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:54,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351751106] [2022-11-02 20:21:54,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351751106] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:54,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:54,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:21:54,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799394994] [2022-11-02 20:21:54,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:54,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:21:54,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:54,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:21:54,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:21:54,800 INFO L87 Difference]: Start difference. First operand 4297 states and 5332 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 3 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:21:57,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:57,277 INFO L93 Difference]: Finished difference Result 4737 states and 6042 transitions. [2022-11-02 20:21:57,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:21:57,278 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 3 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 156 [2022-11-02 20:21:57,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:57,297 INFO L225 Difference]: With dead ends: 4737 [2022-11-02 20:21:57,297 INFO L226 Difference]: Without dead ends: 4417 [2022-11-02 20:21:57,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:21:57,300 INFO L413 NwaCegarLoop]: 705 mSDtfsCounter, 991 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1013 SdHoareTripleChecker+Valid, 1236 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:57,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1013 Valid, 1236 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-02 20:21:57,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4417 states. [2022-11-02 20:21:58,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4417 to 4297. [2022-11-02 20:21:58,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4297 states, 3387 states have (on average 1.2471213463241806) internal successors, (4224), 3438 states have internal predecessors, (4224), 472 states have call successors, (472), 329 states have call predecessors, (472), 436 states have return successors, (635), 531 states have call predecessors, (635), 470 states have call successors, (635) [2022-11-02 20:21:58,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4297 states to 4297 states and 5331 transitions. [2022-11-02 20:21:58,085 INFO L78 Accepts]: Start accepts. Automaton has 4297 states and 5331 transitions. Word has length 156 [2022-11-02 20:21:58,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:58,085 INFO L495 AbstractCegarLoop]: Abstraction has 4297 states and 5331 transitions. [2022-11-02 20:21:58,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 3 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:21:58,087 INFO L276 IsEmpty]: Start isEmpty. Operand 4297 states and 5331 transitions. [2022-11-02 20:21:58,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-11-02 20:21:58,089 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:58,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:21:58,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:21:58,090 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:21:58,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:58,091 INFO L85 PathProgramCache]: Analyzing trace with hash -653247437, now seen corresponding path program 1 times [2022-11-02 20:21:58,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:58,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661787273] [2022-11-02 20:21:58,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:58,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:58,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:58,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:21:58,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:58,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:21:58,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:58,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:21:58,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:58,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-02 20:21:58,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:58,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-11-02 20:21:58,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:58,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:21:58,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:58,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661787273] [2022-11-02 20:21:58,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661787273] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:58,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:58,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:21:58,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105752414] [2022-11-02 20:21:58,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:58,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:21:58,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:58,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:21:58,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:21:58,268 INFO L87 Difference]: Start difference. First operand 4297 states and 5331 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 3 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:22:00,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:22:00,682 INFO L93 Difference]: Finished difference Result 4729 states and 6025 transitions. [2022-11-02 20:22:00,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:22:00,683 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 3 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 156 [2022-11-02 20:22:00,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:22:00,699 INFO L225 Difference]: With dead ends: 4729 [2022-11-02 20:22:00,699 INFO L226 Difference]: Without dead ends: 4417 [2022-11-02 20:22:00,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:22:00,703 INFO L413 NwaCegarLoop]: 704 mSDtfsCounter, 982 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1004 SdHoareTripleChecker+Valid, 1234 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:22:00,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1004 Valid, 1234 Invalid, 806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 712 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-02 20:22:00,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4417 states. [2022-11-02 20:22:01,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4417 to 4297. [2022-11-02 20:22:01,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4297 states, 3387 states have (on average 1.2468260997933274) internal successors, (4223), 3438 states have internal predecessors, (4223), 472 states have call successors, (472), 329 states have call predecessors, (472), 436 states have return successors, (635), 531 states have call predecessors, (635), 470 states have call successors, (635) [2022-11-02 20:22:01,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4297 states to 4297 states and 5330 transitions. [2022-11-02 20:22:01,568 INFO L78 Accepts]: Start accepts. Automaton has 4297 states and 5330 transitions. Word has length 156 [2022-11-02 20:22:01,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:22:01,568 INFO L495 AbstractCegarLoop]: Abstraction has 4297 states and 5330 transitions. [2022-11-02 20:22:01,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 3 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:22:01,569 INFO L276 IsEmpty]: Start isEmpty. Operand 4297 states and 5330 transitions. [2022-11-02 20:22:01,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-11-02 20:22:01,571 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:22:01,571 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:22:01,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:22:01,572 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:22:01,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:22:01,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1134622385, now seen corresponding path program 1 times [2022-11-02 20:22:01,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:22:01,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533745414] [2022-11-02 20:22:01,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:22:01,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:22:01,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:01,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:22:01,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:01,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:22:01,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:01,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:22:01,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:01,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-02 20:22:01,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:01,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-11-02 20:22:01,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:01,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:22:01,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:22:01,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533745414] [2022-11-02 20:22:01,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533745414] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:22:01,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:22:01,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:22:01,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166844502] [2022-11-02 20:22:01,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:22:01,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:22:01,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:22:01,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:22:01,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:22:01,810 INFO L87 Difference]: Start difference. First operand 4297 states and 5330 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 4 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:22:05,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:22:05,739 INFO L93 Difference]: Finished difference Result 5169 states and 6737 transitions. [2022-11-02 20:22:05,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:22:05,739 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 4 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 156 [2022-11-02 20:22:05,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:22:05,761 INFO L225 Difference]: With dead ends: 5169 [2022-11-02 20:22:05,766 INFO L226 Difference]: Without dead ends: 4860 [2022-11-02 20:22:05,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:22:05,769 INFO L413 NwaCegarLoop]: 738 mSDtfsCounter, 1560 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 1845 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1589 SdHoareTripleChecker+Valid, 1734 SdHoareTripleChecker+Invalid, 1993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 1845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:22:05,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1589 Valid, 1734 Invalid, 1993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 1845 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-11-02 20:22:05,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4860 states. [2022-11-02 20:22:06,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4860 to 4621. [2022-11-02 20:22:06,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4621 states, 3685 states have (on average 1.2746268656716417) internal successors, (4697), 3737 states have internal predecessors, (4697), 491 states have call successors, (491), 335 states have call predecessors, (491), 443 states have return successors, (657), 550 states have call predecessors, (657), 489 states have call successors, (657) [2022-11-02 20:22:06,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4621 states to 4621 states and 5845 transitions. [2022-11-02 20:22:06,581 INFO L78 Accepts]: Start accepts. Automaton has 4621 states and 5845 transitions. Word has length 156 [2022-11-02 20:22:06,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:22:06,582 INFO L495 AbstractCegarLoop]: Abstraction has 4621 states and 5845 transitions. [2022-11-02 20:22:06,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 4 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:22:06,582 INFO L276 IsEmpty]: Start isEmpty. Operand 4621 states and 5845 transitions. [2022-11-02 20:22:06,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-11-02 20:22:06,585 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:22:06,586 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:22:06,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:22:06,586 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:22:06,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:22:06,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1761391309, now seen corresponding path program 1 times [2022-11-02 20:22:06,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:22:06,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958485028] [2022-11-02 20:22:06,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:22:06,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:22:06,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:06,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:22:06,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:06,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:22:06,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:06,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:22:06,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:06,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-02 20:22:06,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:06,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-11-02 20:22:06,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:06,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:22:06,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:22:06,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958485028] [2022-11-02 20:22:06,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958485028] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:22:06,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:22:06,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:22:06,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494752901] [2022-11-02 20:22:06,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:22:06,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:22:06,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:22:06,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:22:06,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:22:06,864 INFO L87 Difference]: Start difference. First operand 4621 states and 5845 transitions. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:22:11,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:22:11,352 INFO L93 Difference]: Finished difference Result 5952 states and 7993 transitions. [2022-11-02 20:22:11,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:22:11,352 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 156 [2022-11-02 20:22:11,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:22:11,367 INFO L225 Difference]: With dead ends: 5952 [2022-11-02 20:22:11,367 INFO L226 Difference]: Without dead ends: 5319 [2022-11-02 20:22:11,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:22:11,371 INFO L413 NwaCegarLoop]: 995 mSDtfsCounter, 1581 mSDsluCounter, 1853 mSDsCounter, 0 mSdLazyCounter, 2885 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1610 SdHoareTripleChecker+Valid, 2848 SdHoareTripleChecker+Invalid, 2996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 2885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:22:11,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1610 Valid, 2848 Invalid, 2996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 2885 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-11-02 20:22:11,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5319 states. [2022-11-02 20:22:11,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5319 to 4922. [2022-11-02 20:22:11,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4922 states, 3960 states have (on average 1.2941919191919191) internal successors, (5125), 4013 states have internal predecessors, (5125), 510 states have call successors, (510), 341 states have call predecessors, (510), 450 states have return successors, (678), 570 states have call predecessors, (678), 508 states have call successors, (678) [2022-11-02 20:22:11,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4922 states to 4922 states and 6313 transitions. [2022-11-02 20:22:11,923 INFO L78 Accepts]: Start accepts. Automaton has 4922 states and 6313 transitions. Word has length 156 [2022-11-02 20:22:11,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:22:11,924 INFO L495 AbstractCegarLoop]: Abstraction has 4922 states and 6313 transitions. [2022-11-02 20:22:11,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:22:11,924 INFO L276 IsEmpty]: Start isEmpty. Operand 4922 states and 6313 transitions. [2022-11-02 20:22:11,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-11-02 20:22:11,928 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:22:11,928 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:22:11,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:22:11,928 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:22:11,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:22:11,929 INFO L85 PathProgramCache]: Analyzing trace with hash 916135537, now seen corresponding path program 1 times [2022-11-02 20:22:11,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:22:11,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607041667] [2022-11-02 20:22:11,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:22:11,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:22:11,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:12,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:22:12,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:12,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:22:12,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:12,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:22:12,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:12,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-02 20:22:12,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:12,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-11-02 20:22:12,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:12,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:22:12,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:22:12,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607041667] [2022-11-02 20:22:12,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607041667] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:22:12,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:22:12,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:22:12,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263031695] [2022-11-02 20:22:12,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:22:12,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:22:12,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:22:12,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:22:12,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:22:12,171 INFO L87 Difference]: Start difference. First operand 4922 states and 6313 transitions. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:22:16,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:22:16,983 INFO L93 Difference]: Finished difference Result 7106 states and 9829 transitions. [2022-11-02 20:22:16,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:22:16,984 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 156 [2022-11-02 20:22:16,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:22:17,000 INFO L225 Difference]: With dead ends: 7106 [2022-11-02 20:22:17,000 INFO L226 Difference]: Without dead ends: 6172 [2022-11-02 20:22:17,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:22:17,008 INFO L413 NwaCegarLoop]: 987 mSDtfsCounter, 1578 mSDsluCounter, 1853 mSDsCounter, 0 mSdLazyCounter, 2887 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1607 SdHoareTripleChecker+Valid, 2840 SdHoareTripleChecker+Invalid, 3001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 2887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:22:17,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1607 Valid, 2840 Invalid, 3001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 2887 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-11-02 20:22:17,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6172 states. [2022-11-02 20:22:17,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6172 to 5525. [2022-11-02 20:22:17,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5525 states, 4511 states have (on average 1.326091775659499) internal successors, (5982), 4566 states have internal predecessors, (5982), 548 states have call successors, (548), 353 states have call predecessors, (548), 464 states have return successors, (724), 610 states have call predecessors, (724), 546 states have call successors, (724) [2022-11-02 20:22:17,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5525 states to 5525 states and 7254 transitions. [2022-11-02 20:22:17,850 INFO L78 Accepts]: Start accepts. Automaton has 5525 states and 7254 transitions. Word has length 156 [2022-11-02 20:22:17,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:22:17,850 INFO L495 AbstractCegarLoop]: Abstraction has 5525 states and 7254 transitions. [2022-11-02 20:22:17,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:22:17,851 INFO L276 IsEmpty]: Start isEmpty. Operand 5525 states and 7254 transitions. [2022-11-02 20:22:17,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-11-02 20:22:17,854 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:22:17,854 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:22:17,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:22:17,855 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:22:17,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:22:17,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1279602035, now seen corresponding path program 1 times [2022-11-02 20:22:17,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:22:17,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425672154] [2022-11-02 20:22:17,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:22:17,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:22:17,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:17,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:22:17,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:17,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:22:17,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:18,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:22:18,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:18,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-02 20:22:18,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:18,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-11-02 20:22:18,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:18,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:22:18,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:22:18,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425672154] [2022-11-02 20:22:18,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425672154] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:22:18,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:22:18,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:22:18,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947783367] [2022-11-02 20:22:18,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:22:18,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:22:18,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:22:18,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:22:18,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:22:18,081 INFO L87 Difference]: Start difference. First operand 5525 states and 7254 transitions. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:22:20,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:22:20,753 INFO L93 Difference]: Finished difference Result 7699 states and 10763 transitions. [2022-11-02 20:22:20,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:22:20,754 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 156 [2022-11-02 20:22:20,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:22:20,771 INFO L225 Difference]: With dead ends: 7699 [2022-11-02 20:22:20,771 INFO L226 Difference]: Without dead ends: 6162 [2022-11-02 20:22:20,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:22:20,778 INFO L413 NwaCegarLoop]: 679 mSDtfsCounter, 1389 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 1260 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1419 SdHoareTripleChecker+Valid, 1492 SdHoareTripleChecker+Invalid, 1420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 1260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:22:20,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1419 Valid, 1492 Invalid, 1420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 1260 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-02 20:22:20,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6162 states. [2022-11-02 20:22:21,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6162 to 5525. [2022-11-02 20:22:21,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5525 states, 4511 states have (on average 1.3249833739747285) internal successors, (5977), 4566 states have internal predecessors, (5977), 548 states have call successors, (548), 353 states have call predecessors, (548), 464 states have return successors, (724), 610 states have call predecessors, (724), 546 states have call successors, (724) [2022-11-02 20:22:21,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5525 states to 5525 states and 7249 transitions. [2022-11-02 20:22:21,693 INFO L78 Accepts]: Start accepts. Automaton has 5525 states and 7249 transitions. Word has length 156 [2022-11-02 20:22:21,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:22:21,694 INFO L495 AbstractCegarLoop]: Abstraction has 5525 states and 7249 transitions. [2022-11-02 20:22:21,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:22:21,694 INFO L276 IsEmpty]: Start isEmpty. Operand 5525 states and 7249 transitions. [2022-11-02 20:22:21,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-11-02 20:22:21,697 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:22:21,698 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:22:21,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:22:21,698 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:22:21,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:22:21,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1568421425, now seen corresponding path program 1 times [2022-11-02 20:22:21,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:22:21,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319289281] [2022-11-02 20:22:21,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:22:21,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:22:21,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:21,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:22:21,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:21,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:22:21,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:21,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:22:21,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:21,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-02 20:22:21,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:21,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-11-02 20:22:21,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:21,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:22:21,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:22:21,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319289281] [2022-11-02 20:22:21,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319289281] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:22:21,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:22:21,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:22:21,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976244200] [2022-11-02 20:22:21,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:22:21,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:22:21,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:22:21,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:22:21,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:22:21,923 INFO L87 Difference]: Start difference. First operand 5525 states and 7249 transitions. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:22:24,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:22:24,487 INFO L93 Difference]: Finished difference Result 7693 states and 10737 transitions. [2022-11-02 20:22:24,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:22:24,490 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 156 [2022-11-02 20:22:24,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:22:24,508 INFO L225 Difference]: With dead ends: 7693 [2022-11-02 20:22:24,508 INFO L226 Difference]: Without dead ends: 6156 [2022-11-02 20:22:24,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:22:24,515 INFO L413 NwaCegarLoop]: 675 mSDtfsCounter, 1387 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 1250 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1417 SdHoareTripleChecker+Valid, 1488 SdHoareTripleChecker+Invalid, 1410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 1250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:22:24,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1417 Valid, 1488 Invalid, 1410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 1250 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-02 20:22:24,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6156 states. [2022-11-02 20:22:25,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6156 to 5525. [2022-11-02 20:22:25,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5525 states, 4511 states have (on average 1.3238749722899579) internal successors, (5972), 4566 states have internal predecessors, (5972), 548 states have call successors, (548), 353 states have call predecessors, (548), 464 states have return successors, (724), 610 states have call predecessors, (724), 546 states have call successors, (724) [2022-11-02 20:22:25,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5525 states to 5525 states and 7244 transitions. [2022-11-02 20:22:25,437 INFO L78 Accepts]: Start accepts. Automaton has 5525 states and 7244 transitions. Word has length 156 [2022-11-02 20:22:25,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:22:25,438 INFO L495 AbstractCegarLoop]: Abstraction has 5525 states and 7244 transitions. [2022-11-02 20:22:25,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:22:25,438 INFO L276 IsEmpty]: Start isEmpty. Operand 5525 states and 7244 transitions. [2022-11-02 20:22:25,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-11-02 20:22:25,442 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:22:25,442 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:22:25,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:22:25,442 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:22:25,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:22:25,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1023548851, now seen corresponding path program 1 times [2022-11-02 20:22:25,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:22:25,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327492972] [2022-11-02 20:22:25,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:22:25,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:22:25,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:25,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:22:25,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:25,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:22:25,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:25,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:22:25,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:25,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-02 20:22:25,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:25,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-11-02 20:22:25,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:25,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:22:25,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:22:25,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327492972] [2022-11-02 20:22:25,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327492972] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:22:25,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:22:25,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:22:25,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939505458] [2022-11-02 20:22:25,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:22:25,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:22:25,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:22:25,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:22:25,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:22:25,698 INFO L87 Difference]: Start difference. First operand 5525 states and 7244 transitions. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:22:30,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:22:30,776 INFO L93 Difference]: Finished difference Result 9310 states and 13264 transitions. [2022-11-02 20:22:30,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:22:30,777 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 156 [2022-11-02 20:22:30,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:22:30,802 INFO L225 Difference]: With dead ends: 9310 [2022-11-02 20:22:30,802 INFO L226 Difference]: Without dead ends: 7773 [2022-11-02 20:22:30,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:22:30,810 INFO L413 NwaCegarLoop]: 969 mSDtfsCounter, 1561 mSDsluCounter, 1853 mSDsCounter, 0 mSdLazyCounter, 2843 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1590 SdHoareTripleChecker+Valid, 2822 SdHoareTripleChecker+Invalid, 2960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 2843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:22:30,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1590 Valid, 2822 Invalid, 2960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 2843 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-11-02 20:22:30,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7773 states. [2022-11-02 20:22:32,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7773 to 6740. [2022-11-02 20:22:32,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6740 states, 5622 states have (on average 1.367484880825329) internal successors, (7688), 5681 states have internal predecessors, (7688), 624 states have call successors, (624), 377 states have call predecessors, (624), 492 states have return successors, (822), 690 states have call predecessors, (822), 622 states have call successors, (822) [2022-11-02 20:22:32,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6740 states to 6740 states and 9134 transitions. [2022-11-02 20:22:32,092 INFO L78 Accepts]: Start accepts. Automaton has 6740 states and 9134 transitions. Word has length 156 [2022-11-02 20:22:32,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:22:32,093 INFO L495 AbstractCegarLoop]: Abstraction has 6740 states and 9134 transitions. [2022-11-02 20:22:32,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:22:32,093 INFO L276 IsEmpty]: Start isEmpty. Operand 6740 states and 9134 transitions. [2022-11-02 20:22:32,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-11-02 20:22:32,096 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:22:32,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:22:32,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 20:22:32,097 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:22:32,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:22:32,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1698708977, now seen corresponding path program 1 times [2022-11-02 20:22:32,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:22:32,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827413027] [2022-11-02 20:22:32,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:22:32,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:22:32,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:32,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:22:32,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:32,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:22:32,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:32,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:22:32,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:32,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-02 20:22:32,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:32,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-11-02 20:22:32,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:32,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-11-02 20:22:32,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:22:32,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827413027] [2022-11-02 20:22:32,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827413027] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:22:32,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:22:32,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:22:32,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031627326] [2022-11-02 20:22:32,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:22:32,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:22:32,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:22:32,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:22:32,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:22:32,370 INFO L87 Difference]: Start difference. First operand 6740 states and 9134 transitions. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:22:37,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:22:37,835 INFO L93 Difference]: Finished difference Result 13737 states and 20238 transitions. [2022-11-02 20:22:37,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:22:37,836 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 156 [2022-11-02 20:22:37,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:22:37,870 INFO L225 Difference]: With dead ends: 13737 [2022-11-02 20:22:37,870 INFO L226 Difference]: Without dead ends: 10985 [2022-11-02 20:22:37,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:22:37,883 INFO L413 NwaCegarLoop]: 961 mSDtfsCounter, 1556 mSDsluCounter, 1853 mSDsCounter, 0 mSdLazyCounter, 2823 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1585 SdHoareTripleChecker+Valid, 2814 SdHoareTripleChecker+Invalid, 2941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 2823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:22:37,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1585 Valid, 2814 Invalid, 2941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 2823 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-11-02 20:22:37,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10985 states. [2022-11-02 20:22:39,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10985 to 9181. [2022-11-02 20:22:39,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9181 states, 7855 states have (on average 1.4179503500954806) internal successors, (11138), 7922 states have internal predecessors, (11138), 776 states have call successors, (776), 425 states have call predecessors, (776), 548 states have return successors, (1036), 850 states have call predecessors, (1036), 774 states have call successors, (1036) [2022-11-02 20:22:39,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9181 states to 9181 states and 12950 transitions. [2022-11-02 20:22:39,451 INFO L78 Accepts]: Start accepts. Automaton has 9181 states and 12950 transitions. Word has length 156 [2022-11-02 20:22:39,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:22:39,452 INFO L495 AbstractCegarLoop]: Abstraction has 9181 states and 12950 transitions. [2022-11-02 20:22:39,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:22:39,452 INFO L276 IsEmpty]: Start isEmpty. Operand 9181 states and 12950 transitions. [2022-11-02 20:22:39,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-11-02 20:22:39,458 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:22:39,458 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:22:39,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 20:22:39,459 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:22:39,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:22:39,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1113937327, now seen corresponding path program 1 times [2022-11-02 20:22:39,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:22:39,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564682815] [2022-11-02 20:22:39,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:22:39,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:22:39,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:39,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:22:39,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:39,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:22:39,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:39,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:22:39,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:39,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-02 20:22:39,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:39,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-11-02 20:22:39,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:39,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:22:39,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:22:39,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564682815] [2022-11-02 20:22:39,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564682815] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:22:39,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:22:39,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:22:39,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212626000] [2022-11-02 20:22:39,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:22:39,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:22:39,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:22:39,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:22:39,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:22:39,719 INFO L87 Difference]: Start difference. First operand 9181 states and 12950 transitions. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:22:43,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:22:43,087 INFO L93 Difference]: Finished difference Result 16248 states and 24261 transitions. [2022-11-02 20:22:43,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:22:43,088 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 156 [2022-11-02 20:22:43,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:22:43,120 INFO L225 Difference]: With dead ends: 16248 [2022-11-02 20:22:43,121 INFO L226 Difference]: Without dead ends: 11055 [2022-11-02 20:22:43,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:22:43,138 INFO L413 NwaCegarLoop]: 633 mSDtfsCounter, 1442 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 1193 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1472 SdHoareTripleChecker+Valid, 1446 SdHoareTripleChecker+Invalid, 1357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 1193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:22:43,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1472 Valid, 1446 Invalid, 1357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 1193 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-02 20:22:43,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11055 states. [2022-11-02 20:22:44,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11055 to 9181. [2022-11-02 20:22:44,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9181 states, 7855 states have (on average 1.415786123488224) internal successors, (11121), 7922 states have internal predecessors, (11121), 776 states have call successors, (776), 425 states have call predecessors, (776), 548 states have return successors, (1036), 850 states have call predecessors, (1036), 774 states have call successors, (1036) [2022-11-02 20:22:44,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9181 states to 9181 states and 12933 transitions. [2022-11-02 20:22:44,456 INFO L78 Accepts]: Start accepts. Automaton has 9181 states and 12933 transitions. Word has length 156 [2022-11-02 20:22:44,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:22:44,456 INFO L495 AbstractCegarLoop]: Abstraction has 9181 states and 12933 transitions. [2022-11-02 20:22:44,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:22:44,456 INFO L276 IsEmpty]: Start isEmpty. Operand 9181 states and 12933 transitions. [2022-11-02 20:22:44,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-11-02 20:22:44,461 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:22:44,461 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:22:44,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 20:22:44,461 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:22:44,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:22:44,462 INFO L85 PathProgramCache]: Analyzing trace with hash 679431729, now seen corresponding path program 1 times [2022-11-02 20:22:44,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:22:44,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357424656] [2022-11-02 20:22:44,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:22:44,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:22:44,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:44,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:22:44,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:44,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:22:44,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:44,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:22:44,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:44,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-02 20:22:44,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:44,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-11-02 20:22:44,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:44,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:22:44,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:22:44,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357424656] [2022-11-02 20:22:44,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357424656] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:22:44,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:22:44,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:22:44,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263236217] [2022-11-02 20:22:44,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:22:44,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:22:44,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:22:44,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:22:44,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:22:44,687 INFO L87 Difference]: Start difference. First operand 9181 states and 12933 transitions. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:22:51,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:22:51,393 INFO L93 Difference]: Finished difference Result 22588 states and 34152 transitions. [2022-11-02 20:22:51,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:22:51,396 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 156 [2022-11-02 20:22:51,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:22:51,438 INFO L225 Difference]: With dead ends: 22588 [2022-11-02 20:22:51,439 INFO L226 Difference]: Without dead ends: 17395 [2022-11-02 20:22:51,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:22:51,453 INFO L413 NwaCegarLoop]: 950 mSDtfsCounter, 1548 mSDsluCounter, 1853 mSDsCounter, 0 mSdLazyCounter, 2796 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1577 SdHoareTripleChecker+Valid, 2803 SdHoareTripleChecker+Invalid, 2914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 2796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:22:51,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1577 Valid, 2803 Invalid, 2914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 2796 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-11-02 20:22:51,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17395 states. [2022-11-02 20:22:53,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17395 to 14093. [2022-11-02 20:22:53,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14093 states, 12351 states have (on average 1.4606914419885029) internal successors, (18041), 12434 states have internal predecessors, (18041), 1080 states have call successors, (1080), 521 states have call predecessors, (1080), 660 states have return successors, (1518), 1170 states have call predecessors, (1518), 1078 states have call successors, (1518) [2022-11-02 20:22:53,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14093 states to 14093 states and 20639 transitions. [2022-11-02 20:22:53,634 INFO L78 Accepts]: Start accepts. Automaton has 14093 states and 20639 transitions. Word has length 156 [2022-11-02 20:22:53,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:22:53,634 INFO L495 AbstractCegarLoop]: Abstraction has 14093 states and 20639 transitions. [2022-11-02 20:22:53,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:22:53,635 INFO L276 IsEmpty]: Start isEmpty. Operand 14093 states and 20639 transitions. [2022-11-02 20:22:53,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-11-02 20:22:53,642 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:22:53,642 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:22:53,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-02 20:22:53,643 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:22:53,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:22:53,643 INFO L85 PathProgramCache]: Analyzing trace with hash 249773423, now seen corresponding path program 1 times [2022-11-02 20:22:53,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:22:53,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683106715] [2022-11-02 20:22:53,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:22:53,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:22:53,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:53,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:22:53,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:53,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:22:53,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:53,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:22:53,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:53,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-02 20:22:53,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:53,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-11-02 20:22:53,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:53,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:22:53,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:22:53,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683106715] [2022-11-02 20:22:53,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683106715] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:22:53,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:22:53,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:22:53,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933356687] [2022-11-02 20:22:53,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:22:53,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:22:53,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:22:53,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:22:53,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:22:53,856 INFO L87 Difference]: Start difference. First operand 14093 states and 20639 transitions. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:22:58,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:22:58,397 INFO L93 Difference]: Finished difference Result 27652 states and 42368 transitions. [2022-11-02 20:22:58,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:22:58,398 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 156 [2022-11-02 20:22:58,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:22:58,434 INFO L225 Difference]: With dead ends: 27652 [2022-11-02 20:22:58,434 INFO L226 Difference]: Without dead ends: 17547 [2022-11-02 20:22:58,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:22:58,450 INFO L413 NwaCegarLoop]: 654 mSDtfsCounter, 1387 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 1208 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1417 SdHoareTripleChecker+Valid, 1467 SdHoareTripleChecker+Invalid, 1371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 1208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:22:58,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1417 Valid, 1467 Invalid, 1371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 1208 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-02 20:22:58,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17547 states. [2022-11-02 20:23:00,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17547 to 14093. [2022-11-02 20:23:00,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14093 states, 12351 states have (on average 1.4580195935551776) internal successors, (18008), 12434 states have internal predecessors, (18008), 1080 states have call successors, (1080), 521 states have call predecessors, (1080), 660 states have return successors, (1518), 1170 states have call predecessors, (1518), 1078 states have call successors, (1518) [2022-11-02 20:23:00,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14093 states to 14093 states and 20606 transitions. [2022-11-02 20:23:00,910 INFO L78 Accepts]: Start accepts. Automaton has 14093 states and 20606 transitions. Word has length 156 [2022-11-02 20:23:00,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:23:00,911 INFO L495 AbstractCegarLoop]: Abstraction has 14093 states and 20606 transitions. [2022-11-02 20:23:00,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:23:00,911 INFO L276 IsEmpty]: Start isEmpty. Operand 14093 states and 20606 transitions. [2022-11-02 20:23:00,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-11-02 20:23:00,917 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:23:00,917 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:23:00,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-02 20:23:00,918 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:23:00,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:23:00,918 INFO L85 PathProgramCache]: Analyzing trace with hash -456823183, now seen corresponding path program 1 times [2022-11-02 20:23:00,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:23:00,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230116524] [2022-11-02 20:23:00,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:23:00,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:23:00,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:23:01,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:23:01,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:23:01,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:23:01,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:23:01,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:23:01,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:23:01,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-02 20:23:01,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:23:01,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-11-02 20:23:01,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:23:01,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:23:01,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:23:01,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230116524] [2022-11-02 20:23:01,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230116524] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:23:01,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:23:01,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:23:01,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254177496] [2022-11-02 20:23:01,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:23:01,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:23:01,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:23:01,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:23:01,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:23:01,120 INFO L87 Difference]: Start difference. First operand 14093 states and 20606 transitions. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:23:06,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:23:06,022 INFO L93 Difference]: Finished difference Result 27618 states and 42201 transitions. [2022-11-02 20:23:06,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:23:06,022 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 156 [2022-11-02 20:23:06,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:23:06,060 INFO L225 Difference]: With dead ends: 27618 [2022-11-02 20:23:06,060 INFO L226 Difference]: Without dead ends: 17513 [2022-11-02 20:23:06,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:23:06,078 INFO L413 NwaCegarLoop]: 650 mSDtfsCounter, 1186 mSDsluCounter, 1038 mSDsCounter, 0 mSdLazyCounter, 1344 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1216 SdHoareTripleChecker+Valid, 1688 SdHoareTripleChecker+Invalid, 1467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 1344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:23:06,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1216 Valid, 1688 Invalid, 1467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1344 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-02 20:23:06,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17513 states. [2022-11-02 20:23:08,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17513 to 14093. [2022-11-02 20:23:08,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14093 states, 12351 states have (on average 1.4553477451218524) internal successors, (17975), 12434 states have internal predecessors, (17975), 1080 states have call successors, (1080), 521 states have call predecessors, (1080), 660 states have return successors, (1518), 1170 states have call predecessors, (1518), 1078 states have call successors, (1518) [2022-11-02 20:23:08,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14093 states to 14093 states and 20573 transitions. [2022-11-02 20:23:08,457 INFO L78 Accepts]: Start accepts. Automaton has 14093 states and 20573 transitions. Word has length 156 [2022-11-02 20:23:08,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:23:08,458 INFO L495 AbstractCegarLoop]: Abstraction has 14093 states and 20573 transitions. [2022-11-02 20:23:08,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:23:08,458 INFO L276 IsEmpty]: Start isEmpty. Operand 14093 states and 20573 transitions. [2022-11-02 20:23:08,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-11-02 20:23:08,464 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:23:08,464 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:23:08,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-02 20:23:08,465 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:23:08,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:23:08,465 INFO L85 PathProgramCache]: Analyzing trace with hash 490214703, now seen corresponding path program 1 times [2022-11-02 20:23:08,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:23:08,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624598232] [2022-11-02 20:23:08,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:23:08,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:23:08,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:23:08,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:23:08,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:23:08,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:23:08,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:23:08,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:23:08,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:23:08,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-02 20:23:08,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:23:08,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-11-02 20:23:08,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:23:08,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:23:08,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:23:08,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624598232] [2022-11-02 20:23:08,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624598232] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:23:08,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:23:08,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:23:08,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423741315] [2022-11-02 20:23:08,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:23:08,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:23:08,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:23:08,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:23:08,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:23:08,688 INFO L87 Difference]: Start difference. First operand 14093 states and 20573 transitions. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:23:20,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:23:20,367 INFO L93 Difference]: Finished difference Result 44642 states and 68606 transitions. [2022-11-02 20:23:20,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:23:20,367 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 156 [2022-11-02 20:23:20,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:23:20,455 INFO L225 Difference]: With dead ends: 44642 [2022-11-02 20:23:20,455 INFO L226 Difference]: Without dead ends: 34537 [2022-11-02 20:23:20,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:23:20,482 INFO L413 NwaCegarLoop]: 930 mSDtfsCounter, 1901 mSDsluCounter, 1842 mSDsCounter, 0 mSdLazyCounter, 2742 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1941 SdHoareTripleChecker+Valid, 2772 SdHoareTripleChecker+Invalid, 2865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 2742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:23:20,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1941 Valid, 2772 Invalid, 2865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 2742 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-11-02 20:23:20,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34537 states. [2022-11-02 20:23:24,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34537 to 23756. [2022-11-02 20:23:24,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23756 states, 21214 states have (on average 1.4868011690393137) internal successors, (31541), 21329 states have internal predecessors, (31541), 1656 states have call successors, (1656), 713 states have call predecessors, (1656), 884 states have return successors, (2612), 1778 states have call predecessors, (2612), 1654 states have call successors, (2612) [2022-11-02 20:23:24,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23756 states to 23756 states and 35809 transitions. [2022-11-02 20:23:24,413 INFO L78 Accepts]: Start accepts. Automaton has 23756 states and 35809 transitions. Word has length 156 [2022-11-02 20:23:24,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:23:24,414 INFO L495 AbstractCegarLoop]: Abstraction has 23756 states and 35809 transitions. [2022-11-02 20:23:24,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:23:24,414 INFO L276 IsEmpty]: Start isEmpty. Operand 23756 states and 35809 transitions. [2022-11-02 20:23:24,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-11-02 20:23:24,424 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:23:24,424 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:23:24,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-02 20:23:24,425 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:23:24,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:23:24,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1352048305, now seen corresponding path program 1 times [2022-11-02 20:23:24,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:23:24,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614667270] [2022-11-02 20:23:24,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:23:24,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:23:24,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:23:24,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:23:24,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:23:24,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:23:24,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:23:24,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:23:24,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:23:24,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-02 20:23:24,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:23:24,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-11-02 20:23:24,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:23:24,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:23:24,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:23:24,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614667270] [2022-11-02 20:23:24,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614667270] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:23:24,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:23:24,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:23:24,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837537951] [2022-11-02 20:23:24,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:23:24,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:23:24,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:23:24,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:23:24,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:23:24,692 INFO L87 Difference]: Start difference. First operand 23756 states and 35809 transitions. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:23:44,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:23:44,241 INFO L93 Difference]: Finished difference Result 82903 states and 129408 transitions. [2022-11-02 20:23:44,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:23:44,242 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 156 [2022-11-02 20:23:44,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:23:44,422 INFO L225 Difference]: With dead ends: 82903 [2022-11-02 20:23:44,422 INFO L226 Difference]: Without dead ends: 63135 [2022-11-02 20:23:44,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:23:44,473 INFO L413 NwaCegarLoop]: 1064 mSDtfsCounter, 1618 mSDsluCounter, 1845 mSDsCounter, 0 mSdLazyCounter, 3156 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1646 SdHoareTripleChecker+Valid, 2909 SdHoareTripleChecker+Invalid, 3279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 3156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:23:44,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1646 Valid, 2909 Invalid, 3279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 3156 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-11-02 20:23:44,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63135 states. [2022-11-02 20:23:52,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63135 to 43205. [2022-11-02 20:23:52,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43205 states, 39095 states have (on average 1.5078910346591636) internal successors, (58951), 39274 states have internal predecessors, (58951), 2776 states have call successors, (2776), 1097 states have call predecessors, (2776), 1332 states have return successors, (5254), 2962 states have call predecessors, (5254), 2774 states have call successors, (5254) [2022-11-02 20:23:52,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43205 states to 43205 states and 66981 transitions. [2022-11-02 20:23:52,613 INFO L78 Accepts]: Start accepts. Automaton has 43205 states and 66981 transitions. Word has length 156 [2022-11-02 20:23:52,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:23:52,613 INFO L495 AbstractCegarLoop]: Abstraction has 43205 states and 66981 transitions. [2022-11-02 20:23:52,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:23:52,614 INFO L276 IsEmpty]: Start isEmpty. Operand 43205 states and 66981 transitions. [2022-11-02 20:23:52,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-11-02 20:23:52,758 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:23:52,758 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:23:52,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-02 20:23:52,758 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:23:52,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:23:52,759 INFO L85 PathProgramCache]: Analyzing trace with hash -698360593, now seen corresponding path program 1 times [2022-11-02 20:23:52,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:23:52,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319939601] [2022-11-02 20:23:52,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:23:52,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:23:52,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:23:52,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:23:52,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:23:52,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:23:52,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:23:52,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:23:52,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:23:53,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-02 20:23:53,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:23:53,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-11-02 20:23:53,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:23:53,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:23:53,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:23:53,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319939601] [2022-11-02 20:23:53,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319939601] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:23:53,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:23:53,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:23:53,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163104184] [2022-11-02 20:23:53,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:23:53,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:23:53,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:23:53,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:23:53,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:23:53,020 INFO L87 Difference]: Start difference. First operand 43205 states and 66981 transitions. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)