./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w32_d8_e0.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc84b43-98a1-49e2-8fa1-55b7ce7aa123/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc84b43-98a1-49e2-8fa1-55b7ce7aa123/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc84b43-98a1-49e2-8fa1-55b7ce7aa123/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc84b43-98a1-49e2-8fa1-55b7ce7aa123/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w32_d8_e0.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc84b43-98a1-49e2-8fa1-55b7ce7aa123/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc84b43-98a1-49e2-8fa1-55b7ce7aa123/bin/uautomizer-verify-VRDe98Ueme --witnessprinter.witness.filename witness --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 64bit --witnessprinter.graph.data.programhash 5bfb987fcec0e4e87ab47a565086b76b03edc9a60525cd8ee77a0c461c0fdaaa --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 10:43:22,850 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 10:43:22,932 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc84b43-98a1-49e2-8fa1-55b7ce7aa123/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-26 10:43:22,938 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 10:43:22,939 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 10:43:22,969 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 10:43:22,970 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 10:43:22,971 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 10:43:22,972 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 10:43:22,977 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 10:43:22,978 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 10:43:22,979 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 10:43:22,980 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 10:43:22,980 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 10:43:22,981 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 10:43:22,981 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 10:43:22,982 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 10:43:22,982 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 10:43:22,983 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 10:43:22,983 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 10:43:22,984 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 10:43:22,986 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 10:43:22,987 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 10:43:22,987 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 10:43:22,988 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 10:43:22,989 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 10:43:22,989 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 10:43:22,990 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 10:43:22,990 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 10:43:23,006 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 10:43:23,007 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 10:43:23,007 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 10:43:23,007 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 10:43:23,008 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 10:43:23,008 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 10:43:23,008 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 10:43:23,009 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 10:43:23,009 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 10:43:23,009 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 10:43:23,009 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc84b43-98a1-49e2-8fa1-55b7ce7aa123/bin/uautomizer-verify-VRDe98Ueme/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_3bc84b43-98a1-49e2-8fa1-55b7ce7aa123/bin/uautomizer-verify-VRDe98Ueme Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5bfb987fcec0e4e87ab47a565086b76b03edc9a60525cd8ee77a0c461c0fdaaa [2023-11-26 10:43:23,341 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 10:43:23,394 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 10:43:23,399 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 10:43:23,400 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 10:43:23,401 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 10:43:23,402 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc84b43-98a1-49e2-8fa1-55b7ce7aa123/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w32_d8_e0.c [2023-11-26 10:43:26,465 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 10:43:26,879 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 10:43:26,880 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc84b43-98a1-49e2-8fa1-55b7ce7aa123/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w32_d8_e0.c [2023-11-26 10:43:26,901 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc84b43-98a1-49e2-8fa1-55b7ce7aa123/bin/uautomizer-verify-VRDe98Ueme/data/77e62c0f8/67876e646b5e4994a879e754e5160fc7/FLAG46204fbbc [2023-11-26 10:43:26,926 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc84b43-98a1-49e2-8fa1-55b7ce7aa123/bin/uautomizer-verify-VRDe98Ueme/data/77e62c0f8/67876e646b5e4994a879e754e5160fc7 [2023-11-26 10:43:26,933 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 10:43:26,936 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 10:43:26,940 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 10:43:26,940 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 10:43:26,946 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 10:43:26,947 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:43:26" (1/1) ... [2023-11-26 10:43:26,948 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f3f2f1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:43:26, skipping insertion in model container [2023-11-26 10:43:26,949 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:43:26" (1/1) ... [2023-11-26 10:43:27,026 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 10:43:27,198 WARN L240 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_3bc84b43-98a1-49e2-8fa1-55b7ce7aa123/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w32_d8_e0.c[1279,1292] [2023-11-26 10:43:27,426 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 10:43:27,438 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 10:43:27,452 WARN L240 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_3bc84b43-98a1-49e2-8fa1-55b7ce7aa123/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w32_d8_e0.c[1279,1292] [2023-11-26 10:43:27,587 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 10:43:27,603 INFO L206 MainTranslator]: Completed translation [2023-11-26 10:43:27,605 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:43:27 WrapperNode [2023-11-26 10:43:27,605 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 10:43:27,606 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 10:43:27,607 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 10:43:27,607 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 10:43:27,615 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:43:27" (1/1) ... [2023-11-26 10:43:27,671 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:43:27" (1/1) ... [2023-11-26 10:43:27,875 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1535 [2023-11-26 10:43:27,875 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 10:43:27,876 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 10:43:27,876 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 10:43:27,876 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 10:43:27,889 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:43:27" (1/1) ... [2023-11-26 10:43:27,889 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:43:27" (1/1) ... [2023-11-26 10:43:27,914 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:43:27" (1/1) ... [2023-11-26 10:43:28,037 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-26 10:43:28,037 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:43:27" (1/1) ... [2023-11-26 10:43:28,037 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:43:27" (1/1) ... [2023-11-26 10:43:28,155 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:43:27" (1/1) ... [2023-11-26 10:43:28,187 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:43:27" (1/1) ... [2023-11-26 10:43:28,218 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:43:27" (1/1) ... [2023-11-26 10:43:28,249 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:43:27" (1/1) ... [2023-11-26 10:43:28,349 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 10:43:28,350 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 10:43:28,351 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 10:43:28,351 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 10:43:28,352 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:43:27" (1/1) ... [2023-11-26 10:43:28,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 10:43:28,371 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc84b43-98a1-49e2-8fa1-55b7ce7aa123/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:43:28,390 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc84b43-98a1-49e2-8fa1-55b7ce7aa123/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 10:43:28,424 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bc84b43-98a1-49e2-8fa1-55b7ce7aa123/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 10:43:28,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 10:43:28,441 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-26 10:43:28,441 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-26 10:43:28,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 10:43:28,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 10:43:28,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 10:43:28,690 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 10:43:28,693 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 10:43:30,319 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 10:43:30,393 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 10:43:30,394 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-26 10:43:30,396 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:43:30 BoogieIcfgContainer [2023-11-26 10:43:30,396 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 10:43:30,400 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 10:43:30,400 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 10:43:30,404 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 10:43:30,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 10:43:26" (1/3) ... [2023-11-26 10:43:30,405 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8763cdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:43:30, skipping insertion in model container [2023-11-26 10:43:30,405 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:43:27" (2/3) ... [2023-11-26 10:43:30,407 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8763cdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:43:30, skipping insertion in model container [2023-11-26 10:43:30,407 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:43:30" (3/3) ... [2023-11-26 10:43:30,409 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.circular_pointer_top_w32_d8_e0.c [2023-11-26 10:43:30,428 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 10:43:30,429 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-26 10:43:30,509 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 10:43:30,518 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=LoopHeads, 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;@16844b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 10:43:30,518 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-26 10:43:30,527 INFO L276 IsEmpty]: Start isEmpty. Operand has 297 states, 291 states have (on average 1.6563573883161513) internal successors, (482), 292 states have internal predecessors, (482), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-26 10:43:30,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-26 10:43:30,551 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:43:30,552 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:43:30,552 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:43:30,561 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:43:30,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1078998386, now seen corresponding path program 1 times [2023-11-26 10:43:30,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:43:30,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521575617] [2023-11-26 10:43:30,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:43:30,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:43:30,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:31,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-26 10:43:31,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:31,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 10:43:31,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:31,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 10:43:31,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:31,083 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-26 10:43:31,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:43:31,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521575617] [2023-11-26 10:43:31,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521575617] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:43:31,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:43:31,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:43:31,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8242351] [2023-11-26 10:43:31,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:43:31,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-26 10:43:31,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:43:31,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-26 10:43:31,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 10:43:31,125 INFO L87 Difference]: Start difference. First operand has 297 states, 291 states have (on average 1.6563573883161513) internal successors, (482), 292 states have internal predecessors, (482), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 52.0) internal successors, (104), 2 states have internal predecessors, (104), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-26 10:43:31,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:43:31,179 INFO L93 Difference]: Finished difference Result 540 states and 892 transitions. [2023-11-26 10:43:31,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-26 10:43:31,183 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 52.0) internal successors, (104), 2 states have internal predecessors, (104), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 116 [2023-11-26 10:43:31,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:43:31,195 INFO L225 Difference]: With dead ends: 540 [2023-11-26 10:43:31,195 INFO L226 Difference]: Without dead ends: 295 [2023-11-26 10:43:31,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 10:43:31,203 INFO L413 NwaCegarLoop]: 482 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 10:43:31,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 482 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 10:43:31,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2023-11-26 10:43:31,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2023-11-26 10:43:31,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 290 states have (on average 1.6448275862068966) internal successors, (477), 290 states have internal predecessors, (477), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-26 10:43:31,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 483 transitions. [2023-11-26 10:43:31,265 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 483 transitions. Word has length 116 [2023-11-26 10:43:31,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:43:31,266 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 483 transitions. [2023-11-26 10:43:31,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 52.0) internal successors, (104), 2 states have internal predecessors, (104), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-26 10:43:31,267 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 483 transitions. [2023-11-26 10:43:31,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-26 10:43:31,270 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:43:31,271 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:43:31,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 10:43:31,271 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:43:31,272 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:43:31,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1359904200, now seen corresponding path program 1 times [2023-11-26 10:43:31,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:43:31,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034658687] [2023-11-26 10:43:31,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:43:31,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:43:31,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:32,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-26 10:43:32,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:32,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 10:43:32,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:32,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 10:43:32,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:32,408 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-26 10:43:32,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:43:32,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034658687] [2023-11-26 10:43:32,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034658687] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:43:32,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:43:32,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 10:43:32,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666751428] [2023-11-26 10:43:32,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:43:32,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 10:43:32,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:43:32,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 10:43:32,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 10:43:32,434 INFO L87 Difference]: Start difference. First operand 295 states and 483 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-26 10:43:32,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:43:32,513 INFO L93 Difference]: Finished difference Result 299 states and 487 transitions. [2023-11-26 10:43:32,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 10:43:32,514 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 116 [2023-11-26 10:43:32,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:43:32,520 INFO L225 Difference]: With dead ends: 299 [2023-11-26 10:43:32,521 INFO L226 Difference]: Without dead ends: 297 [2023-11-26 10:43:32,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 10:43:32,523 INFO L413 NwaCegarLoop]: 480 mSDtfsCounter, 1 mSDsluCounter, 955 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1435 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 10:43:32,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1435 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 10:43:32,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2023-11-26 10:43:32,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2023-11-26 10:43:32,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 292 states have (on average 1.6404109589041096) internal successors, (479), 292 states have internal predecessors, (479), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-26 10:43:32,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 485 transitions. [2023-11-26 10:43:32,558 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 485 transitions. Word has length 116 [2023-11-26 10:43:32,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:43:32,562 INFO L495 AbstractCegarLoop]: Abstraction has 297 states and 485 transitions. [2023-11-26 10:43:32,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-26 10:43:32,563 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 485 transitions. [2023-11-26 10:43:32,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-11-26 10:43:32,575 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:43:32,575 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:43:32,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 10:43:32,576 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:43:32,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:43:32,577 INFO L85 PathProgramCache]: Analyzing trace with hash -790917242, now seen corresponding path program 1 times [2023-11-26 10:43:32,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:43:32,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325355809] [2023-11-26 10:43:32,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:43:32,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:43:32,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:33,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-26 10:43:33,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:33,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 10:43:33,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:33,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 10:43:33,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:33,221 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-26 10:43:33,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:43:33,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325355809] [2023-11-26 10:43:33,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325355809] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:43:33,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:43:33,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 10:43:33,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629671348] [2023-11-26 10:43:33,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:43:33,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 10:43:33,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:43:33,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 10:43:33,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:43:33,231 INFO L87 Difference]: Start difference. First operand 297 states and 485 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-26 10:43:33,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:43:33,687 INFO L93 Difference]: Finished difference Result 752 states and 1222 transitions. [2023-11-26 10:43:33,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 10:43:33,688 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 117 [2023-11-26 10:43:33,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:43:33,691 INFO L225 Difference]: With dead ends: 752 [2023-11-26 10:43:33,691 INFO L226 Difference]: Without dead ends: 297 [2023-11-26 10:43:33,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-26 10:43:33,695 INFO L413 NwaCegarLoop]: 523 mSDtfsCounter, 913 mSDsluCounter, 888 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 913 SdHoareTripleChecker+Valid, 1411 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-26 10:43:33,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [913 Valid, 1411 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-26 10:43:33,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2023-11-26 10:43:33,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2023-11-26 10:43:33,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 292 states have (on average 1.6369863013698631) internal successors, (478), 292 states have internal predecessors, (478), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-26 10:43:33,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 484 transitions. [2023-11-26 10:43:33,716 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 484 transitions. Word has length 117 [2023-11-26 10:43:33,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:43:33,717 INFO L495 AbstractCegarLoop]: Abstraction has 297 states and 484 transitions. [2023-11-26 10:43:33,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-26 10:43:33,717 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 484 transitions. [2023-11-26 10:43:33,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-26 10:43:33,719 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:43:33,719 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:43:33,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 10:43:33,720 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:43:33,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:43:33,720 INFO L85 PathProgramCache]: Analyzing trace with hash 986526220, now seen corresponding path program 1 times [2023-11-26 10:43:33,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:43:33,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534960598] [2023-11-26 10:43:33,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:43:33,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:43:33,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:34,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-26 10:43:34,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:34,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 10:43:34,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:34,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 10:43:34,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:34,179 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-26 10:43:34,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:43:34,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534960598] [2023-11-26 10:43:34,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534960598] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:43:34,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:43:34,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 10:43:34,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546892180] [2023-11-26 10:43:34,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:43:34,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 10:43:34,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:43:34,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 10:43:34,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 10:43:34,183 INFO L87 Difference]: Start difference. First operand 297 states and 484 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-26 10:43:34,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:43:34,228 INFO L93 Difference]: Finished difference Result 545 states and 886 transitions. [2023-11-26 10:43:34,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 10:43:34,229 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 118 [2023-11-26 10:43:34,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:43:34,232 INFO L225 Difference]: With dead ends: 545 [2023-11-26 10:43:34,233 INFO L226 Difference]: Without dead ends: 300 [2023-11-26 10:43:34,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 10:43:34,246 INFO L413 NwaCegarLoop]: 479 mSDtfsCounter, 1 mSDsluCounter, 951 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1430 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 10:43:34,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1430 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 10:43:34,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-11-26 10:43:34,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 299. [2023-11-26 10:43:34,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 294 states have (on average 1.6326530612244898) internal successors, (480), 294 states have internal predecessors, (480), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-26 10:43:34,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 486 transitions. [2023-11-26 10:43:34,262 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 486 transitions. Word has length 118 [2023-11-26 10:43:34,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:43:34,264 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 486 transitions. [2023-11-26 10:43:34,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-26 10:43:34,264 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 486 transitions. [2023-11-26 10:43:34,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-26 10:43:34,267 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:43:34,267 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:43:34,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 10:43:34,268 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:43:34,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:43:34,269 INFO L85 PathProgramCache]: Analyzing trace with hash 307109852, now seen corresponding path program 1 times [2023-11-26 10:43:34,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:43:34,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866292273] [2023-11-26 10:43:34,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:43:34,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:43:34,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:34,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-26 10:43:34,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:34,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 10:43:34,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:34,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 10:43:34,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:34,930 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-26 10:43:34,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:43:34,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866292273] [2023-11-26 10:43:34,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866292273] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:43:34,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:43:34,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 10:43:34,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050115532] [2023-11-26 10:43:34,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:43:34,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 10:43:34,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:43:34,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 10:43:34,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 10:43:34,933 INFO L87 Difference]: Start difference. First operand 299 states and 486 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-26 10:43:35,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:43:35,021 INFO L93 Difference]: Finished difference Result 546 states and 886 transitions. [2023-11-26 10:43:35,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 10:43:35,022 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 119 [2023-11-26 10:43:35,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:43:35,024 INFO L225 Difference]: With dead ends: 546 [2023-11-26 10:43:35,025 INFO L226 Difference]: Without dead ends: 299 [2023-11-26 10:43:35,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:43:35,026 INFO L413 NwaCegarLoop]: 463 mSDtfsCounter, 396 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 10:43:35,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 928 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 10:43:35,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-11-26 10:43:35,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2023-11-26 10:43:35,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 294 states have (on average 1.629251700680272) internal successors, (479), 294 states have internal predecessors, (479), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-26 10:43:35,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 485 transitions. [2023-11-26 10:43:35,039 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 485 transitions. Word has length 119 [2023-11-26 10:43:35,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:43:35,039 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 485 transitions. [2023-11-26 10:43:35,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-26 10:43:35,040 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 485 transitions. [2023-11-26 10:43:35,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-26 10:43:35,042 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:43:35,044 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:43:35,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 10:43:35,045 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:43:35,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:43:35,046 INFO L85 PathProgramCache]: Analyzing trace with hash -602034372, now seen corresponding path program 1 times [2023-11-26 10:43:35,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:43:35,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429544529] [2023-11-26 10:43:35,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:43:35,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:43:35,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:35,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-26 10:43:35,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:35,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 10:43:35,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:35,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 10:43:35,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:35,447 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-26 10:43:35,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:43:35,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429544529] [2023-11-26 10:43:35,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429544529] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:43:35,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:43:35,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 10:43:35,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494277916] [2023-11-26 10:43:35,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:43:35,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 10:43:35,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:43:35,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 10:43:35,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:43:35,450 INFO L87 Difference]: Start difference. First operand 299 states and 485 transitions. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-26 10:43:35,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:43:35,537 INFO L93 Difference]: Finished difference Result 546 states and 884 transitions. [2023-11-26 10:43:35,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 10:43:35,537 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 120 [2023-11-26 10:43:35,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:43:35,540 INFO L225 Difference]: With dead ends: 546 [2023-11-26 10:43:35,540 INFO L226 Difference]: Without dead ends: 299 [2023-11-26 10:43:35,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:43:35,541 INFO L413 NwaCegarLoop]: 463 mSDtfsCounter, 471 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 10:43:35,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 934 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 10:43:35,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-11-26 10:43:35,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2023-11-26 10:43:35,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 294 states have (on average 1.6258503401360545) internal successors, (478), 294 states have internal predecessors, (478), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-26 10:43:35,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 484 transitions. [2023-11-26 10:43:35,554 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 484 transitions. Word has length 120 [2023-11-26 10:43:35,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:43:35,554 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 484 transitions. [2023-11-26 10:43:35,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-26 10:43:35,555 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 484 transitions. [2023-11-26 10:43:35,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-11-26 10:43:35,556 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:43:35,556 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:43:35,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 10:43:35,557 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:43:35,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:43:35,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1199198390, now seen corresponding path program 1 times [2023-11-26 10:43:35,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:43:35,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797625590] [2023-11-26 10:43:35,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:43:35,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:43:35,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:36,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-26 10:43:36,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:36,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 10:43:36,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:36,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 10:43:36,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:36,117 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-26 10:43:36,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:43:36,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797625590] [2023-11-26 10:43:36,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797625590] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:43:36,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:43:36,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 10:43:36,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550870618] [2023-11-26 10:43:36,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:43:36,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 10:43:36,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:43:36,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 10:43:36,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 10:43:36,120 INFO L87 Difference]: Start difference. First operand 299 states and 484 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-26 10:43:36,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:43:36,239 INFO L93 Difference]: Finished difference Result 546 states and 882 transitions. [2023-11-26 10:43:36,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 10:43:36,240 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 121 [2023-11-26 10:43:36,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:43:36,242 INFO L225 Difference]: With dead ends: 546 [2023-11-26 10:43:36,242 INFO L226 Difference]: Without dead ends: 299 [2023-11-26 10:43:36,243 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:43:36,243 INFO L413 NwaCegarLoop]: 445 mSDtfsCounter, 388 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 10:43:36,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 892 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 10:43:36,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-11-26 10:43:36,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2023-11-26 10:43:36,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 294 states have (on average 1.6224489795918366) internal successors, (477), 294 states have internal predecessors, (477), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-26 10:43:36,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 483 transitions. [2023-11-26 10:43:36,255 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 483 transitions. Word has length 121 [2023-11-26 10:43:36,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:43:36,256 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 483 transitions. [2023-11-26 10:43:36,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-26 10:43:36,256 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 483 transitions. [2023-11-26 10:43:36,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-26 10:43:36,258 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:43:36,258 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:43:36,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-26 10:43:36,258 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:43:36,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:43:36,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1836346922, now seen corresponding path program 1 times [2023-11-26 10:43:36,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:43:36,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201837756] [2023-11-26 10:43:36,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:43:36,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:43:36,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:36,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-26 10:43:36,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:36,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 10:43:36,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:36,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 10:43:36,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:36,633 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-26 10:43:36,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:43:36,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201837756] [2023-11-26 10:43:36,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201837756] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:43:36,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:43:36,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 10:43:36,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361724875] [2023-11-26 10:43:36,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:43:36,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 10:43:36,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:43:36,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 10:43:36,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:43:36,635 INFO L87 Difference]: Start difference. First operand 299 states and 483 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-26 10:43:36,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:43:36,763 INFO L93 Difference]: Finished difference Result 546 states and 880 transitions. [2023-11-26 10:43:36,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 10:43:36,764 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 122 [2023-11-26 10:43:36,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:43:36,766 INFO L225 Difference]: With dead ends: 546 [2023-11-26 10:43:36,766 INFO L226 Difference]: Without dead ends: 299 [2023-11-26 10:43:36,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:43:36,768 INFO L413 NwaCegarLoop]: 445 mSDtfsCounter, 850 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 853 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 10:43:36,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [853 Valid, 892 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 10:43:36,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-11-26 10:43:36,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2023-11-26 10:43:36,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 294 states have (on average 1.619047619047619) internal successors, (476), 294 states have internal predecessors, (476), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-26 10:43:36,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 482 transitions. [2023-11-26 10:43:36,780 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 482 transitions. Word has length 122 [2023-11-26 10:43:36,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:43:36,781 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 482 transitions. [2023-11-26 10:43:36,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-26 10:43:36,781 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 482 transitions. [2023-11-26 10:43:36,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-11-26 10:43:36,783 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:43:36,783 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:43:36,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-26 10:43:36,783 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:43:36,784 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:43:36,784 INFO L85 PathProgramCache]: Analyzing trace with hash 170210960, now seen corresponding path program 1 times [2023-11-26 10:43:36,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:43:36,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572890187] [2023-11-26 10:43:36,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:43:36,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:43:36,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:37,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-26 10:43:37,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:37,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 10:43:37,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:37,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 10:43:37,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:37,259 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-26 10:43:37,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:43:37,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572890187] [2023-11-26 10:43:37,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572890187] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:43:37,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:43:37,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 10:43:37,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674408723] [2023-11-26 10:43:37,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:43:37,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 10:43:37,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:43:37,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 10:43:37,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:43:37,263 INFO L87 Difference]: Start difference. First operand 299 states and 482 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-26 10:43:37,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:43:37,394 INFO L93 Difference]: Finished difference Result 546 states and 878 transitions. [2023-11-26 10:43:37,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 10:43:37,395 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 123 [2023-11-26 10:43:37,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:43:37,398 INFO L225 Difference]: With dead ends: 546 [2023-11-26 10:43:37,398 INFO L226 Difference]: Without dead ends: 299 [2023-11-26 10:43:37,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:43:37,399 INFO L413 NwaCegarLoop]: 445 mSDtfsCounter, 465 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 898 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 10:43:37,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 898 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 10:43:37,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-11-26 10:43:37,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2023-11-26 10:43:37,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 294 states have (on average 1.6156462585034013) internal successors, (475), 294 states have internal predecessors, (475), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-26 10:43:37,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 481 transitions. [2023-11-26 10:43:37,412 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 481 transitions. Word has length 123 [2023-11-26 10:43:37,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:43:37,413 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 481 transitions. [2023-11-26 10:43:37,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-26 10:43:37,413 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 481 transitions. [2023-11-26 10:43:37,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-26 10:43:37,415 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:43:37,415 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:43:37,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-26 10:43:37,415 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:43:37,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:43:37,416 INFO L85 PathProgramCache]: Analyzing trace with hash -136472208, now seen corresponding path program 1 times [2023-11-26 10:43:37,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:43:37,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077392833] [2023-11-26 10:43:37,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:43:37,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:43:37,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:37,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-26 10:43:37,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:37,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 10:43:37,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:37,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 10:43:37,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:37,823 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-26 10:43:37,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:43:37,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077392833] [2023-11-26 10:43:37,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077392833] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:43:37,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:43:37,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 10:43:37,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851388369] [2023-11-26 10:43:37,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:43:37,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 10:43:37,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:43:37,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 10:43:37,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:43:37,827 INFO L87 Difference]: Start difference. First operand 299 states and 481 transitions. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-26 10:43:37,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:43:37,964 INFO L93 Difference]: Finished difference Result 546 states and 876 transitions. [2023-11-26 10:43:37,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 10:43:37,965 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 124 [2023-11-26 10:43:37,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:43:37,968 INFO L225 Difference]: With dead ends: 546 [2023-11-26 10:43:37,968 INFO L226 Difference]: Without dead ends: 299 [2023-11-26 10:43:37,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:43:37,970 INFO L413 NwaCegarLoop]: 445 mSDtfsCounter, 461 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 898 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 10:43:37,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 898 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 10:43:37,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-11-26 10:43:37,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2023-11-26 10:43:37,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 294 states have (on average 1.6122448979591837) internal successors, (474), 294 states have internal predecessors, (474), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-26 10:43:37,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 480 transitions. [2023-11-26 10:43:37,984 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 480 transitions. Word has length 124 [2023-11-26 10:43:37,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:43:37,985 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 480 transitions. [2023-11-26 10:43:37,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-26 10:43:37,986 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 480 transitions. [2023-11-26 10:43:37,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-11-26 10:43:37,988 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:43:37,988 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:43:37,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-26 10:43:37,988 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:43:37,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:43:37,989 INFO L85 PathProgramCache]: Analyzing trace with hash -792506006, now seen corresponding path program 1 times [2023-11-26 10:43:37,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:43:37,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734547503] [2023-11-26 10:43:37,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:43:37,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:43:38,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:38,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-26 10:43:38,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:38,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 10:43:38,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:38,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 10:43:38,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:38,598 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-26 10:43:38,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:43:38,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734547503] [2023-11-26 10:43:38,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734547503] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:43:38,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:43:38,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 10:43:38,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350132412] [2023-11-26 10:43:38,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:43:38,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 10:43:38,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:43:38,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 10:43:38,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 10:43:38,602 INFO L87 Difference]: Start difference. First operand 299 states and 480 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-26 10:43:38,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:43:38,682 INFO L93 Difference]: Finished difference Result 546 states and 874 transitions. [2023-11-26 10:43:38,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 10:43:38,683 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 125 [2023-11-26 10:43:38,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:43:38,685 INFO L225 Difference]: With dead ends: 546 [2023-11-26 10:43:38,685 INFO L226 Difference]: Without dead ends: 299 [2023-11-26 10:43:38,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:43:38,687 INFO L413 NwaCegarLoop]: 462 mSDtfsCounter, 427 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 10:43:38,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 926 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 10:43:38,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-11-26 10:43:38,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2023-11-26 10:43:38,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 294 states have (on average 1.6088435374149659) internal successors, (473), 294 states have internal predecessors, (473), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-26 10:43:38,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 479 transitions. [2023-11-26 10:43:38,700 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 479 transitions. Word has length 125 [2023-11-26 10:43:38,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:43:38,700 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 479 transitions. [2023-11-26 10:43:38,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-26 10:43:38,701 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 479 transitions. [2023-11-26 10:43:38,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-11-26 10:43:38,702 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:43:38,703 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:43:38,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-26 10:43:38,703 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:43:38,703 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:43:38,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1996412576, now seen corresponding path program 1 times [2023-11-26 10:43:38,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:43:38,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788054765] [2023-11-26 10:43:38,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:43:38,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:43:38,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:39,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-26 10:43:39,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:39,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-26 10:43:39,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:39,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-26 10:43:39,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:39,502 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-26 10:43:39,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:43:39,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788054765] [2023-11-26 10:43:39,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788054765] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:43:39,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:43:39,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 10:43:39,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742885904] [2023-11-26 10:43:39,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:43:39,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 10:43:39,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:43:39,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 10:43:39,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:43:39,506 INFO L87 Difference]: Start difference. First operand 299 states and 479 transitions. Second operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-26 10:43:39,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:43:39,669 INFO L93 Difference]: Finished difference Result 546 states and 872 transitions. [2023-11-26 10:43:39,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 10:43:39,670 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 126 [2023-11-26 10:43:39,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:43:39,672 INFO L225 Difference]: With dead ends: 546 [2023-11-26 10:43:39,673 INFO L226 Difference]: Without dead ends: 299 [2023-11-26 10:43:39,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:43:39,674 INFO L413 NwaCegarLoop]: 444 mSDtfsCounter, 381 mSDsluCounter, 886 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 1330 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 10:43:39,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 1330 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 10:43:39,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-11-26 10:43:39,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2023-11-26 10:43:39,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 294 states have (on average 1.6054421768707483) internal successors, (472), 294 states have internal predecessors, (472), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-26 10:43:39,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 478 transitions. [2023-11-26 10:43:39,688 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 478 transitions. Word has length 126 [2023-11-26 10:43:39,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:43:39,689 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 478 transitions. [2023-11-26 10:43:39,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-26 10:43:39,689 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 478 transitions. [2023-11-26 10:43:39,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-11-26 10:43:39,691 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:43:39,691 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:43:39,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-26 10:43:39,691 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:43:39,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:43:39,692 INFO L85 PathProgramCache]: Analyzing trace with hash 190974242, now seen corresponding path program 1 times [2023-11-26 10:43:39,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:43:39,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20734806] [2023-11-26 10:43:39,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:43:39,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:43:39,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:40,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-26 10:43:40,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:40,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-26 10:43:40,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:40,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-26 10:43:40,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:40,336 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-26 10:43:40,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:43:40,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20734806] [2023-11-26 10:43:40,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20734806] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:43:40,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:43:40,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 10:43:40,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774661722] [2023-11-26 10:43:40,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:43:40,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 10:43:40,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:43:40,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 10:43:40,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:43:40,339 INFO L87 Difference]: Start difference. First operand 299 states and 478 transitions. Second operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-26 10:43:40,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:43:40,477 INFO L93 Difference]: Finished difference Result 546 states and 870 transitions. [2023-11-26 10:43:40,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 10:43:40,478 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 126 [2023-11-26 10:43:40,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:43:40,480 INFO L225 Difference]: With dead ends: 546 [2023-11-26 10:43:40,481 INFO L226 Difference]: Without dead ends: 299 [2023-11-26 10:43:40,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:43:40,482 INFO L413 NwaCegarLoop]: 444 mSDtfsCounter, 378 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 10:43:40,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 896 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 10:43:40,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-11-26 10:43:40,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2023-11-26 10:43:40,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 294 states have (on average 1.6020408163265305) internal successors, (471), 294 states have internal predecessors, (471), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-26 10:43:40,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 477 transitions. [2023-11-26 10:43:40,495 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 477 transitions. Word has length 126 [2023-11-26 10:43:40,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:43:40,496 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 477 transitions. [2023-11-26 10:43:40,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-26 10:43:40,496 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 477 transitions. [2023-11-26 10:43:40,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-11-26 10:43:40,498 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:43:40,498 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:43:40,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-26 10:43:40,499 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:43:40,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:43:40,499 INFO L85 PathProgramCache]: Analyzing trace with hash -626674208, now seen corresponding path program 1 times [2023-11-26 10:43:40,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:43:40,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458227001] [2023-11-26 10:43:40,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:43:40,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:43:40,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:41,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-26 10:43:41,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:41,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-26 10:43:41,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:41,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-26 10:43:41,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:41,158 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-26 10:43:41,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:43:41,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458227001] [2023-11-26 10:43:41,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458227001] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:43:41,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:43:41,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 10:43:41,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906529626] [2023-11-26 10:43:41,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:43:41,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 10:43:41,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:43:41,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 10:43:41,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:43:41,161 INFO L87 Difference]: Start difference. First operand 299 states and 477 transitions. Second operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-26 10:43:41,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:43:41,304 INFO L93 Difference]: Finished difference Result 546 states and 868 transitions. [2023-11-26 10:43:41,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 10:43:41,305 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 126 [2023-11-26 10:43:41,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:43:41,307 INFO L225 Difference]: With dead ends: 546 [2023-11-26 10:43:41,308 INFO L226 Difference]: Without dead ends: 299 [2023-11-26 10:43:41,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:43:41,309 INFO L413 NwaCegarLoop]: 444 mSDtfsCounter, 748 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 10:43:41,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [748 Valid, 890 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 10:43:41,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-11-26 10:43:41,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2023-11-26 10:43:41,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 294 states have (on average 1.598639455782313) internal successors, (470), 294 states have internal predecessors, (470), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-26 10:43:41,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 476 transitions. [2023-11-26 10:43:41,325 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 476 transitions. Word has length 126 [2023-11-26 10:43:41,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:43:41,326 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 476 transitions. [2023-11-26 10:43:41,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-26 10:43:41,326 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 476 transitions. [2023-11-26 10:43:41,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-11-26 10:43:41,328 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:43:41,328 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:43:41,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-26 10:43:41,328 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:43:41,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:43:41,329 INFO L85 PathProgramCache]: Analyzing trace with hash 2079945186, now seen corresponding path program 1 times [2023-11-26 10:43:41,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:43:41,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989319133] [2023-11-26 10:43:41,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:43:41,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:43:41,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:41,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-26 10:43:41,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:41,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-26 10:43:41,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:41,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-26 10:43:41,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:41,738 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-26 10:43:41,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:43:41,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989319133] [2023-11-26 10:43:41,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989319133] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:43:41,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:43:41,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 10:43:41,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843889633] [2023-11-26 10:43:41,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:43:41,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 10:43:41,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:43:41,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 10:43:41,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 10:43:41,741 INFO L87 Difference]: Start difference. First operand 299 states and 476 transitions. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-26 10:43:41,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:43:41,818 INFO L93 Difference]: Finished difference Result 546 states and 866 transitions. [2023-11-26 10:43:41,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 10:43:41,818 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 126 [2023-11-26 10:43:41,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:43:41,820 INFO L225 Difference]: With dead ends: 546 [2023-11-26 10:43:41,821 INFO L226 Difference]: Without dead ends: 299 [2023-11-26 10:43:41,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:43:41,822 INFO L413 NwaCegarLoop]: 459 mSDtfsCounter, 421 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 10:43:41,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 920 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 10:43:41,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-11-26 10:43:41,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2023-11-26 10:43:41,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 294 states have (on average 1.5952380952380953) internal successors, (469), 294 states have internal predecessors, (469), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-26 10:43:41,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 475 transitions. [2023-11-26 10:43:41,836 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 475 transitions. Word has length 126 [2023-11-26 10:43:41,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:43:41,836 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 475 transitions. [2023-11-26 10:43:41,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-26 10:43:41,837 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 475 transitions. [2023-11-26 10:43:41,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-11-26 10:43:41,838 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:43:41,838 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:43:41,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-26 10:43:41,839 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:43:41,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:43:41,839 INFO L85 PathProgramCache]: Analyzing trace with hash 2107010788, now seen corresponding path program 1 times [2023-11-26 10:43:41,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:43:41,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921774973] [2023-11-26 10:43:41,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:43:41,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:43:42,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:42,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-26 10:43:42,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:42,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-26 10:43:42,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:42,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-26 10:43:42,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:42,443 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-26 10:43:42,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:43:42,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921774973] [2023-11-26 10:43:42,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921774973] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:43:42,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:43:42,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 10:43:42,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617273054] [2023-11-26 10:43:42,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:43:42,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 10:43:42,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:43:42,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 10:43:42,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 10:43:42,448 INFO L87 Difference]: Start difference. First operand 299 states and 475 transitions. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-26 10:43:42,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:43:42,528 INFO L93 Difference]: Finished difference Result 546 states and 864 transitions. [2023-11-26 10:43:42,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 10:43:42,529 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 126 [2023-11-26 10:43:42,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:43:42,531 INFO L225 Difference]: With dead ends: 546 [2023-11-26 10:43:42,531 INFO L226 Difference]: Without dead ends: 299 [2023-11-26 10:43:42,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:43:42,533 INFO L413 NwaCegarLoop]: 454 mSDtfsCounter, 382 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 10:43:42,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 910 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 10:43:42,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-11-26 10:43:42,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2023-11-26 10:43:42,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 294 states have (on average 1.5918367346938775) internal successors, (468), 294 states have internal predecessors, (468), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-26 10:43:42,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 474 transitions. [2023-11-26 10:43:42,548 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 474 transitions. Word has length 126 [2023-11-26 10:43:42,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:43:42,548 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 474 transitions. [2023-11-26 10:43:42,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-26 10:43:42,549 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 474 transitions. [2023-11-26 10:43:42,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-11-26 10:43:42,550 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:43:42,551 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:43:42,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-26 10:43:42,551 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:43:42,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:43:42,552 INFO L85 PathProgramCache]: Analyzing trace with hash -801753114, now seen corresponding path program 1 times [2023-11-26 10:43:42,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:43:42,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103868838] [2023-11-26 10:43:42,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:43:42,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:43:42,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:43,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-26 10:43:43,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:43,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-26 10:43:43,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:43,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-26 10:43:43,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:43,159 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-26 10:43:43,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:43:43,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103868838] [2023-11-26 10:43:43,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103868838] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:43:43,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:43:43,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 10:43:43,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070665768] [2023-11-26 10:43:43,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:43:43,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 10:43:43,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:43:43,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 10:43:43,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 10:43:43,165 INFO L87 Difference]: Start difference. First operand 299 states and 474 transitions. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-26 10:43:43,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:43:43,398 INFO L93 Difference]: Finished difference Result 548 states and 864 transitions. [2023-11-26 10:43:43,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 10:43:43,399 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 126 [2023-11-26 10:43:43,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:43:43,401 INFO L225 Difference]: With dead ends: 548 [2023-11-26 10:43:43,401 INFO L226 Difference]: Without dead ends: 299 [2023-11-26 10:43:43,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:43:43,402 INFO L413 NwaCegarLoop]: 465 mSDtfsCounter, 4 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1277 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-26 10:43:43,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1277 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-26 10:43:43,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-11-26 10:43:43,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2023-11-26 10:43:43,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 294 states have (on average 1.58843537414966) internal successors, (467), 294 states have internal predecessors, (467), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-26 10:43:43,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 473 transitions. [2023-11-26 10:43:43,419 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 473 transitions. Word has length 126 [2023-11-26 10:43:43,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:43:43,420 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 473 transitions. [2023-11-26 10:43:43,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-26 10:43:43,420 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 473 transitions. [2023-11-26 10:43:43,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-11-26 10:43:43,422 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:43:43,422 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:43:43,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-26 10:43:43,423 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:43:43,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:43:43,423 INFO L85 PathProgramCache]: Analyzing trace with hash -186832874, now seen corresponding path program 1 times [2023-11-26 10:43:43,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:43:43,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191801896] [2023-11-26 10:43:43,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:43:43,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:43:43,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:44,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-26 10:43:44,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:44,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-26 10:43:44,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:44,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-26 10:43:44,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:44,644 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-26 10:43:44,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:43:44,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191801896] [2023-11-26 10:43:44,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191801896] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:43:44,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:43:44,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 10:43:44,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176075333] [2023-11-26 10:43:44,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:43:44,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 10:43:44,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:43:44,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 10:43:44,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:43:44,648 INFO L87 Difference]: Start difference. First operand 299 states and 473 transitions. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-26 10:43:44,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:43:44,880 INFO L93 Difference]: Finished difference Result 872 states and 1369 transitions. [2023-11-26 10:43:44,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 10:43:44,881 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 127 [2023-11-26 10:43:44,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:43:44,885 INFO L225 Difference]: With dead ends: 872 [2023-11-26 10:43:44,885 INFO L226 Difference]: Without dead ends: 625 [2023-11-26 10:43:44,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-11-26 10:43:44,887 INFO L413 NwaCegarLoop]: 587 mSDtfsCounter, 1950 mSDsluCounter, 1380 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1953 SdHoareTripleChecker+Valid, 1967 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 10:43:44,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1953 Valid, 1967 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 10:43:44,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2023-11-26 10:43:44,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 391. [2023-11-26 10:43:44,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 383 states have (on average 1.5613577023498695) internal successors, (598), 383 states have internal predecessors, (598), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-26 10:43:44,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 610 transitions. [2023-11-26 10:43:44,915 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 610 transitions. Word has length 127 [2023-11-26 10:43:44,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:43:44,916 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 610 transitions. [2023-11-26 10:43:44,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-26 10:43:44,916 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 610 transitions. [2023-11-26 10:43:44,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2023-11-26 10:43:44,921 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:43:44,922 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:43:44,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-26 10:43:44,922 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:43:44,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:43:44,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1486298518, now seen corresponding path program 1 times [2023-11-26 10:43:44,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:43:44,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614446363] [2023-11-26 10:43:44,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:43:44,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:43:45,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:45,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-26 10:43:45,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:45,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-26 10:43:46,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:46,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-26 10:43:46,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:46,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2023-11-26 10:43:46,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:46,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2023-11-26 10:43:46,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:46,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2023-11-26 10:43:46,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:46,020 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-26 10:43:46,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:43:46,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614446363] [2023-11-26 10:43:46,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614446363] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:43:46,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:43:46,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 10:43:46,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869161608] [2023-11-26 10:43:46,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:43:46,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 10:43:46,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:43:46,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 10:43:46,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:43:46,027 INFO L87 Difference]: Start difference. First operand 391 states and 610 transitions. Second operand has 5 states, 5 states have (on average 56.4) internal successors, (282), 5 states have internal predecessors, (282), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-26 10:43:46,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:43:46,159 INFO L93 Difference]: Finished difference Result 638 states and 997 transitions. [2023-11-26 10:43:46,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 10:43:46,161 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 56.4) internal successors, (282), 5 states have internal predecessors, (282), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 309 [2023-11-26 10:43:46,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:43:46,164 INFO L225 Difference]: With dead ends: 638 [2023-11-26 10:43:46,164 INFO L226 Difference]: Without dead ends: 391 [2023-11-26 10:43:46,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:43:46,165 INFO L413 NwaCegarLoop]: 441 mSDtfsCounter, 426 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 10:43:46,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 890 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 10:43:46,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2023-11-26 10:43:46,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2023-11-26 10:43:46,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 383 states have (on average 1.558746736292428) internal successors, (597), 383 states have internal predecessors, (597), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-26 10:43:46,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 609 transitions. [2023-11-26 10:43:46,191 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 609 transitions. Word has length 309 [2023-11-26 10:43:46,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:43:46,192 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 609 transitions. [2023-11-26 10:43:46,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 56.4) internal successors, (282), 5 states have internal predecessors, (282), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-26 10:43:46,194 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 609 transitions. [2023-11-26 10:43:46,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2023-11-26 10:43:46,199 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:43:46,200 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:43:46,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-26 10:43:46,200 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:43:46,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:43:46,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1863575638, now seen corresponding path program 1 times [2023-11-26 10:43:46,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:43:46,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363401302] [2023-11-26 10:43:46,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:43:46,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:43:46,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:47,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-26 10:43:47,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:47,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-26 10:43:47,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:47,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-26 10:43:47,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:47,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2023-11-26 10:43:47,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:47,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2023-11-26 10:43:47,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:47,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2023-11-26 10:43:47,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:47,223 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-26 10:43:47,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:43:47,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363401302] [2023-11-26 10:43:47,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363401302] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:43:47,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:43:47,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 10:43:47,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930836990] [2023-11-26 10:43:47,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:43:47,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 10:43:47,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:43:47,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 10:43:47,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:43:47,229 INFO L87 Difference]: Start difference. First operand 391 states and 609 transitions. Second operand has 5 states, 5 states have (on average 56.6) internal successors, (283), 5 states have internal predecessors, (283), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-26 10:43:47,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:43:47,350 INFO L93 Difference]: Finished difference Result 638 states and 995 transitions. [2023-11-26 10:43:47,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 10:43:47,351 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 56.6) internal successors, (283), 5 states have internal predecessors, (283), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 310 [2023-11-26 10:43:47,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:43:47,355 INFO L225 Difference]: With dead ends: 638 [2023-11-26 10:43:47,355 INFO L226 Difference]: Without dead ends: 391 [2023-11-26 10:43:47,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:43:47,357 INFO L413 NwaCegarLoop]: 441 mSDtfsCounter, 418 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 10:43:47,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 890 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 10:43:47,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2023-11-26 10:43:47,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2023-11-26 10:43:47,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 383 states have (on average 1.556135770234987) internal successors, (596), 383 states have internal predecessors, (596), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-26 10:43:47,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 608 transitions. [2023-11-26 10:43:47,389 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 608 transitions. Word has length 310 [2023-11-26 10:43:47,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:43:47,390 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 608 transitions. [2023-11-26 10:43:47,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 56.6) internal successors, (283), 5 states have internal predecessors, (283), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-26 10:43:47,391 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 608 transitions. [2023-11-26 10:43:47,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2023-11-26 10:43:47,396 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:43:47,396 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:43:47,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-26 10:43:47,397 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:43:47,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:43:47,397 INFO L85 PathProgramCache]: Analyzing trace with hash 372564790, now seen corresponding path program 1 times [2023-11-26 10:43:47,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:43:47,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746557827] [2023-11-26 10:43:47,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:43:47,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:43:47,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:48,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-26 10:43:48,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:48,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-26 10:43:48,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:48,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-26 10:43:48,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:48,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2023-11-26 10:43:48,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:48,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2023-11-26 10:43:48,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:48,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2023-11-26 10:43:48,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:48,498 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-26 10:43:48,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:43:48,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746557827] [2023-11-26 10:43:48,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746557827] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:43:48,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:43:48,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 10:43:48,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36721260] [2023-11-26 10:43:48,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:43:48,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 10:43:48,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:43:48,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 10:43:48,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:43:48,503 INFO L87 Difference]: Start difference. First operand 391 states and 608 transitions. Second operand has 5 states, 5 states have (on average 56.8) internal successors, (284), 5 states have internal predecessors, (284), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-26 10:43:48,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:43:48,629 INFO L93 Difference]: Finished difference Result 638 states and 993 transitions. [2023-11-26 10:43:48,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 10:43:48,630 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 56.8) internal successors, (284), 5 states have internal predecessors, (284), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 311 [2023-11-26 10:43:48,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:43:48,633 INFO L225 Difference]: With dead ends: 638 [2023-11-26 10:43:48,633 INFO L226 Difference]: Without dead ends: 391 [2023-11-26 10:43:48,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:43:48,638 INFO L413 NwaCegarLoop]: 441 mSDtfsCounter, 410 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 10:43:48,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 890 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 10:43:48,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2023-11-26 10:43:48,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2023-11-26 10:43:48,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 383 states have (on average 1.5535248041775458) internal successors, (595), 383 states have internal predecessors, (595), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-26 10:43:48,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 607 transitions. [2023-11-26 10:43:48,667 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 607 transitions. Word has length 311 [2023-11-26 10:43:48,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:43:48,668 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 607 transitions. [2023-11-26 10:43:48,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 56.8) internal successors, (284), 5 states have internal predecessors, (284), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-26 10:43:48,669 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 607 transitions. [2023-11-26 10:43:48,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2023-11-26 10:43:48,674 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:43:48,674 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:43:48,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-26 10:43:48,675 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:43:48,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:43:48,675 INFO L85 PathProgramCache]: Analyzing trace with hash -342234970, now seen corresponding path program 1 times [2023-11-26 10:43:48,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:43:48,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448672084] [2023-11-26 10:43:48,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:43:48,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:43:49,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:49,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-26 10:43:49,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:49,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-26 10:43:49,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:49,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-26 10:43:49,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:49,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2023-11-26 10:43:49,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:49,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2023-11-26 10:43:49,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:49,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2023-11-26 10:43:49,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:49,703 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-26 10:43:49,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:43:49,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448672084] [2023-11-26 10:43:49,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448672084] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:43:49,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:43:49,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 10:43:49,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957765960] [2023-11-26 10:43:49,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:43:49,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 10:43:49,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:43:49,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 10:43:49,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:43:49,707 INFO L87 Difference]: Start difference. First operand 391 states and 607 transitions. Second operand has 5 states, 5 states have (on average 57.0) internal successors, (285), 5 states have internal predecessors, (285), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-26 10:43:49,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:43:49,823 INFO L93 Difference]: Finished difference Result 638 states and 991 transitions. [2023-11-26 10:43:49,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 10:43:49,824 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 57.0) internal successors, (285), 5 states have internal predecessors, (285), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 312 [2023-11-26 10:43:49,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:43:49,827 INFO L225 Difference]: With dead ends: 638 [2023-11-26 10:43:49,827 INFO L226 Difference]: Without dead ends: 391 [2023-11-26 10:43:49,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:43:49,829 INFO L413 NwaCegarLoop]: 441 mSDtfsCounter, 714 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 10:43:49,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [717 Valid, 884 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 10:43:49,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2023-11-26 10:43:49,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2023-11-26 10:43:49,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 383 states have (on average 1.5509138381201044) internal successors, (594), 383 states have internal predecessors, (594), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-26 10:43:49,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 606 transitions. [2023-11-26 10:43:49,858 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 606 transitions. Word has length 312 [2023-11-26 10:43:49,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:43:49,859 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 606 transitions. [2023-11-26 10:43:49,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.0) internal successors, (285), 5 states have internal predecessors, (285), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-26 10:43:49,860 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 606 transitions. [2023-11-26 10:43:49,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2023-11-26 10:43:49,864 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:43:49,865 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:43:49,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-26 10:43:49,866 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:43:49,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:43:49,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1107896516, now seen corresponding path program 1 times [2023-11-26 10:43:49,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:43:49,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023526166] [2023-11-26 10:43:49,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:43:49,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:43:50,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:50,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-26 10:43:50,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:50,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-26 10:43:50,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:50,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-26 10:43:50,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:50,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2023-11-26 10:43:50,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:50,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2023-11-26 10:43:50,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:50,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2023-11-26 10:43:50,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:50,936 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-26 10:43:50,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:43:50,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023526166] [2023-11-26 10:43:50,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023526166] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:43:50,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:43:50,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 10:43:50,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061531298] [2023-11-26 10:43:50,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:43:50,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 10:43:50,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:43:50,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 10:43:50,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:43:50,942 INFO L87 Difference]: Start difference. First operand 391 states and 606 transitions. Second operand has 5 states, 5 states have (on average 57.2) internal successors, (286), 5 states have internal predecessors, (286), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-26 10:43:51,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:43:51,035 INFO L93 Difference]: Finished difference Result 638 states and 989 transitions. [2023-11-26 10:43:51,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 10:43:51,036 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 57.2) internal successors, (286), 5 states have internal predecessors, (286), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 313 [2023-11-26 10:43:51,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:43:51,039 INFO L225 Difference]: With dead ends: 638 [2023-11-26 10:43:51,039 INFO L226 Difference]: Without dead ends: 391 [2023-11-26 10:43:51,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:43:51,041 INFO L413 NwaCegarLoop]: 449 mSDtfsCounter, 692 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 10:43:51,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 900 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 10:43:51,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2023-11-26 10:43:51,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2023-11-26 10:43:51,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 383 states have (on average 1.5483028720626633) internal successors, (593), 383 states have internal predecessors, (593), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-26 10:43:51,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 605 transitions. [2023-11-26 10:43:51,066 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 605 transitions. Word has length 313 [2023-11-26 10:43:51,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:43:51,066 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 605 transitions. [2023-11-26 10:43:51,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.2) internal successors, (286), 5 states have internal predecessors, (286), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-26 10:43:51,067 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 605 transitions. [2023-11-26 10:43:51,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2023-11-26 10:43:51,072 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:43:51,072 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:43:51,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-26 10:43:51,073 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:43:51,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:43:51,073 INFO L85 PathProgramCache]: Analyzing trace with hash 787072628, now seen corresponding path program 1 times [2023-11-26 10:43:51,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:43:51,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672432369] [2023-11-26 10:43:51,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:43:51,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:43:51,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:52,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-26 10:43:52,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:52,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-26 10:43:52,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:52,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-26 10:43:52,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:52,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2023-11-26 10:43:52,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:52,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2023-11-26 10:43:52,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:52,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2023-11-26 10:43:52,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:52,090 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-26 10:43:52,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:43:52,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672432369] [2023-11-26 10:43:52,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672432369] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:43:52,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:43:52,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 10:43:52,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403573426] [2023-11-26 10:43:52,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:43:52,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 10:43:52,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:43:52,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 10:43:52,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:43:52,094 INFO L87 Difference]: Start difference. First operand 391 states and 605 transitions. Second operand has 5 states, 5 states have (on average 57.4) internal successors, (287), 5 states have internal predecessors, (287), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-26 10:43:52,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:43:52,182 INFO L93 Difference]: Finished difference Result 638 states and 987 transitions. [2023-11-26 10:43:52,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 10:43:52,183 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 57.4) internal successors, (287), 5 states have internal predecessors, (287), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 314 [2023-11-26 10:43:52,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:43:52,186 INFO L225 Difference]: With dead ends: 638 [2023-11-26 10:43:52,187 INFO L226 Difference]: Without dead ends: 391 [2023-11-26 10:43:52,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:43:52,188 INFO L413 NwaCegarLoop]: 449 mSDtfsCounter, 380 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 10:43:52,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 906 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 10:43:52,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2023-11-26 10:43:52,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2023-11-26 10:43:52,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 383 states have (on average 1.5456919060052219) internal successors, (592), 383 states have internal predecessors, (592), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-26 10:43:52,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 604 transitions. [2023-11-26 10:43:52,214 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 604 transitions. Word has length 314 [2023-11-26 10:43:52,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:43:52,215 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 604 transitions. [2023-11-26 10:43:52,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.4) internal successors, (287), 5 states have internal predecessors, (287), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-26 10:43:52,215 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 604 transitions. [2023-11-26 10:43:52,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2023-11-26 10:43:52,220 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:43:52,221 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:43:52,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-26 10:43:52,221 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:43:52,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:43:52,222 INFO L85 PathProgramCache]: Analyzing trace with hash 624313872, now seen corresponding path program 1 times [2023-11-26 10:43:52,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:43:52,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020023822] [2023-11-26 10:43:52,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:43:52,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:43:52,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:53,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-26 10:43:53,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:53,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-26 10:43:53,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:53,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-26 10:43:53,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:53,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2023-11-26 10:43:53,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:53,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2023-11-26 10:43:53,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:53,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2023-11-26 10:43:53,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:53,304 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-26 10:43:53,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:43:53,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020023822] [2023-11-26 10:43:53,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020023822] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:43:53,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:43:53,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 10:43:53,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202243357] [2023-11-26 10:43:53,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:43:53,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 10:43:53,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:43:53,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 10:43:53,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:43:53,309 INFO L87 Difference]: Start difference. First operand 391 states and 604 transitions. Second operand has 5 states, 5 states have (on average 57.6) internal successors, (288), 5 states have internal predecessors, (288), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-26 10:43:53,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:43:53,669 INFO L93 Difference]: Finished difference Result 638 states and 985 transitions. [2023-11-26 10:43:53,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 10:43:53,670 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 57.6) internal successors, (288), 5 states have internal predecessors, (288), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 315 [2023-11-26 10:43:53,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:43:53,673 INFO L225 Difference]: With dead ends: 638 [2023-11-26 10:43:53,674 INFO L226 Difference]: Without dead ends: 391 [2023-11-26 10:43:53,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:43:53,675 INFO L413 NwaCegarLoop]: 336 mSDtfsCounter, 654 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-26 10:43:53,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [657 Valid, 674 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-26 10:43:53,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2023-11-26 10:43:53,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2023-11-26 10:43:53,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 383 states have (on average 1.5430809399477807) internal successors, (591), 383 states have internal predecessors, (591), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-26 10:43:53,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 603 transitions. [2023-11-26 10:43:53,713 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 603 transitions. Word has length 315 [2023-11-26 10:43:53,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:43:53,714 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 603 transitions. [2023-11-26 10:43:53,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.6) internal successors, (288), 5 states have internal predecessors, (288), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-26 10:43:53,715 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 603 transitions. [2023-11-26 10:43:53,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2023-11-26 10:43:53,719 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:43:53,720 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:43:53,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-26 10:43:53,720 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:43:53,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:43:53,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1824240060, now seen corresponding path program 1 times [2023-11-26 10:43:53,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:43:53,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387684090] [2023-11-26 10:43:53,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:43:53,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:43:54,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:55,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-26 10:43:55,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:55,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-26 10:43:55,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:55,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-26 10:43:55,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:55,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2023-11-26 10:43:55,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:55,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2023-11-26 10:43:55,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:55,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2023-11-26 10:43:55,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:55,544 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-26 10:43:55,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:43:55,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387684090] [2023-11-26 10:43:55,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387684090] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:43:55,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:43:55,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 10:43:55,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849107116] [2023-11-26 10:43:55,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:43:55,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 10:43:55,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:43:55,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 10:43:55,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:43:55,549 INFO L87 Difference]: Start difference. First operand 391 states and 603 transitions. Second operand has 5 states, 5 states have (on average 57.8) internal successors, (289), 5 states have internal predecessors, (289), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-26 10:43:55,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:43:55,694 INFO L93 Difference]: Finished difference Result 638 states and 983 transitions. [2023-11-26 10:43:55,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 10:43:55,695 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 57.8) internal successors, (289), 5 states have internal predecessors, (289), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 316 [2023-11-26 10:43:55,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:43:55,700 INFO L225 Difference]: With dead ends: 638 [2023-11-26 10:43:55,701 INFO L226 Difference]: Without dead ends: 391 [2023-11-26 10:43:55,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:43:55,702 INFO L413 NwaCegarLoop]: 438 mSDtfsCounter, 365 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 10:43:55,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 884 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 10:43:55,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2023-11-26 10:43:55,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2023-11-26 10:43:55,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 383 states have (on average 1.5404699738903394) internal successors, (590), 383 states have internal predecessors, (590), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-26 10:43:55,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 602 transitions. [2023-11-26 10:43:55,735 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 602 transitions. Word has length 316 [2023-11-26 10:43:55,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:43:55,736 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 602 transitions. [2023-11-26 10:43:55,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.8) internal successors, (289), 5 states have internal predecessors, (289), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-26 10:43:55,736 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 602 transitions. [2023-11-26 10:43:55,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2023-11-26 10:43:55,742 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:43:55,743 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:43:55,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-26 10:43:55,744 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:43:55,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:43:55,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1253968254, now seen corresponding path program 1 times [2023-11-26 10:43:55,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:43:55,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113593646] [2023-11-26 10:43:55,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:43:55,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:43:56,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:57,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-26 10:43:57,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:57,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-26 10:43:57,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:57,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-26 10:43:57,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:57,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2023-11-26 10:43:57,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:57,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2023-11-26 10:43:57,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:57,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2023-11-26 10:43:57,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:57,573 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-26 10:43:57,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:43:57,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113593646] [2023-11-26 10:43:57,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113593646] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:43:57,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:43:57,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 10:43:57,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763596430] [2023-11-26 10:43:57,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:43:57,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 10:43:57,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:43:57,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 10:43:57,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 10:43:57,577 INFO L87 Difference]: Start difference. First operand 391 states and 602 transitions. Second operand has 4 states, 4 states have (on average 72.25) internal successors, (289), 4 states have internal predecessors, (289), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-26 10:43:57,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:43:57,680 INFO L93 Difference]: Finished difference Result 638 states and 981 transitions. [2023-11-26 10:43:57,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 10:43:57,681 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.25) internal successors, (289), 4 states have internal predecessors, (289), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 316 [2023-11-26 10:43:57,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:43:57,684 INFO L225 Difference]: With dead ends: 638 [2023-11-26 10:43:57,684 INFO L226 Difference]: Without dead ends: 391 [2023-11-26 10:43:57,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:43:57,686 INFO L413 NwaCegarLoop]: 438 mSDtfsCounter, 308 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 10:43:57,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 878 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 10:43:57,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2023-11-26 10:43:57,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2023-11-26 10:43:57,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 383 states have (on average 1.5378590078328982) internal successors, (589), 383 states have internal predecessors, (589), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-26 10:43:57,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 601 transitions. [2023-11-26 10:43:57,709 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 601 transitions. Word has length 316 [2023-11-26 10:43:57,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:43:57,710 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 601 transitions. [2023-11-26 10:43:57,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.25) internal successors, (289), 4 states have internal predecessors, (289), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-26 10:43:57,711 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 601 transitions. [2023-11-26 10:43:57,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2023-11-26 10:43:57,715 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:43:57,716 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:43:57,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-26 10:43:57,716 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:43:57,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:43:57,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1271527428, now seen corresponding path program 1 times [2023-11-26 10:43:57,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:43:57,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438264142] [2023-11-26 10:43:57,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:43:57,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:43:58,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:59,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-26 10:43:59,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:59,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-26 10:43:59,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:59,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-26 10:43:59,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:59,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2023-11-26 10:43:59,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:59,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2023-11-26 10:43:59,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:59,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2023-11-26 10:43:59,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:59,792 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-26 10:43:59,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:43:59,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438264142] [2023-11-26 10:43:59,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438264142] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:43:59,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:43:59,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 10:43:59,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748676927] [2023-11-26 10:43:59,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:43:59,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 10:43:59,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:43:59,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 10:43:59,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:43:59,797 INFO L87 Difference]: Start difference. First operand 391 states and 601 transitions. Second operand has 6 states, 6 states have (on average 48.166666666666664) internal successors, (289), 6 states have internal predecessors, (289), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-26 10:44:00,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:44:00,481 INFO L93 Difference]: Finished difference Result 957 states and 1474 transitions. [2023-11-26 10:44:00,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 10:44:00,482 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 48.166666666666664) internal successors, (289), 6 states have internal predecessors, (289), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 316 [2023-11-26 10:44:00,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:44:00,487 INFO L225 Difference]: With dead ends: 957 [2023-11-26 10:44:00,487 INFO L226 Difference]: Without dead ends: 710 [2023-11-26 10:44:00,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-26 10:44:00,488 INFO L413 NwaCegarLoop]: 433 mSDtfsCounter, 311 mSDsluCounter, 1621 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 2054 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-26 10:44:00,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 2054 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-26 10:44:00,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2023-11-26 10:44:00,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 604. [2023-11-26 10:44:00,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 593 states have (on average 1.5311973018549747) internal successors, (908), 593 states have internal predecessors, (908), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-26 10:44:00,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 926 transitions. [2023-11-26 10:44:00,530 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 926 transitions. Word has length 316 [2023-11-26 10:44:00,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:44:00,530 INFO L495 AbstractCegarLoop]: Abstraction has 604 states and 926 transitions. [2023-11-26 10:44:00,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 48.166666666666664) internal successors, (289), 6 states have internal predecessors, (289), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-26 10:44:00,531 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 926 transitions. [2023-11-26 10:44:00,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2023-11-26 10:44:00,536 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:44:00,537 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:44:00,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-11-26 10:44:00,538 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:44:00,538 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:44:00,538 INFO L85 PathProgramCache]: Analyzing trace with hash 746302368, now seen corresponding path program 1 times [2023-11-26 10:44:00,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:44:00,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465525980] [2023-11-26 10:44:00,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:44:00,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:44:01,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:44:02,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-26 10:44:02,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:44:02,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-26 10:44:02,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:44:02,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-26 10:44:02,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:44:02,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2023-11-26 10:44:02,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:44:02,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-11-26 10:44:02,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:44:02,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2023-11-26 10:44:02,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:44:02,938 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-26 10:44:02,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:44:02,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465525980] [2023-11-26 10:44:02,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465525980] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:44:02,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:44:02,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 10:44:02,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444331370] [2023-11-26 10:44:02,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:44:02,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 10:44:02,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:44:02,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 10:44:02,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:44:02,942 INFO L87 Difference]: Start difference. First operand 604 states and 926 transitions. Second operand has 6 states, 6 states have (on average 48.333333333333336) internal successors, (290), 6 states have internal predecessors, (290), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-26 10:44:03,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:44:03,554 INFO L93 Difference]: Finished difference Result 889 states and 1367 transitions. [2023-11-26 10:44:03,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 10:44:03,555 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 48.333333333333336) internal successors, (290), 6 states have internal predecessors, (290), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 317 [2023-11-26 10:44:03,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:44:03,559 INFO L225 Difference]: With dead ends: 889 [2023-11-26 10:44:03,559 INFO L226 Difference]: Without dead ends: 642 [2023-11-26 10:44:03,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-26 10:44:03,561 INFO L413 NwaCegarLoop]: 335 mSDtfsCounter, 651 mSDsluCounter, 987 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 1322 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-26 10:44:03,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [654 Valid, 1322 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-26 10:44:03,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2023-11-26 10:44:03,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 605. [2023-11-26 10:44:03,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 594 states have (on average 1.5303030303030303) internal successors, (909), 594 states have internal predecessors, (909), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-26 10:44:03,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 927 transitions. [2023-11-26 10:44:03,595 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 927 transitions. Word has length 317 [2023-11-26 10:44:03,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:44:03,596 INFO L495 AbstractCegarLoop]: Abstraction has 605 states and 927 transitions. [2023-11-26 10:44:03,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 48.333333333333336) internal successors, (290), 6 states have internal predecessors, (290), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-26 10:44:03,597 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 927 transitions. [2023-11-26 10:44:03,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2023-11-26 10:44:03,602 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:44:03,603 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:44:03,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-11-26 10:44:03,603 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:44:03,603 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:44:03,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1096173346, now seen corresponding path program 1 times [2023-11-26 10:44:03,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:44:03,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120617606] [2023-11-26 10:44:03,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:44:03,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:44:05,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:44:06,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-26 10:44:06,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:44:06,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-26 10:44:06,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:44:06,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-26 10:44:06,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:44:06,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2023-11-26 10:44:06,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:44:06,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-11-26 10:44:06,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:44:06,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2023-11-26 10:44:06,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:44:06,042 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2023-11-26 10:44:06,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:44:06,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120617606] [2023-11-26 10:44:06,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120617606] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:44:06,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:44:06,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 10:44:06,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738406512] [2023-11-26 10:44:06,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:44:06,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 10:44:06,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:44:06,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 10:44:06,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-26 10:44:06,046 INFO L87 Difference]: Start difference. First operand 605 states and 927 transitions. Second operand has 7 states, 7 states have (on average 37.285714285714285) internal successors, (261), 7 states have internal predecessors, (261), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-26 10:44:06,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:44:06,515 INFO L93 Difference]: Finished difference Result 1289 states and 1968 transitions. [2023-11-26 10:44:06,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 10:44:06,517 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 37.285714285714285) internal successors, (261), 7 states have internal predecessors, (261), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 317 [2023-11-26 10:44:06,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:44:06,521 INFO L225 Difference]: With dead ends: 1289 [2023-11-26 10:44:06,521 INFO L226 Difference]: Without dead ends: 617 [2023-11-26 10:44:06,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-11-26 10:44:06,524 INFO L413 NwaCegarLoop]: 443 mSDtfsCounter, 952 mSDsluCounter, 1316 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 952 SdHoareTripleChecker+Valid, 1759 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-26 10:44:06,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [952 Valid, 1759 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-26 10:44:06,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2023-11-26 10:44:06,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 611. [2023-11-26 10:44:06,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 600 states have (on average 1.52) internal successors, (912), 600 states have internal predecessors, (912), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-26 10:44:06,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 930 transitions. [2023-11-26 10:44:06,571 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 930 transitions. Word has length 317 [2023-11-26 10:44:06,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:44:06,571 INFO L495 AbstractCegarLoop]: Abstraction has 611 states and 930 transitions. [2023-11-26 10:44:06,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 37.285714285714285) internal successors, (261), 7 states have internal predecessors, (261), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-26 10:44:06,572 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 930 transitions. [2023-11-26 10:44:06,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2023-11-26 10:44:06,579 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:44:06,580 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:44:06,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-11-26 10:44:06,580 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 10:44:06,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:44:06,581 INFO L85 PathProgramCache]: Analyzing trace with hash -317734514, now seen corresponding path program 1 times [2023-11-26 10:44:06,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:44:06,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779270667] [2023-11-26 10:44:06,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:44:06,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms