./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_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_1f766efd-ade0-4cbc-9675-a57b3c60abdc/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f766efd-ade0-4cbc-9675-a57b3c60abdc/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f766efd-ade0-4cbc-9675-a57b3c60abdc/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f766efd-ade0-4cbc-9675-a57b3c60abdc/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d8_e0.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f766efd-ade0-4cbc-9675-a57b3c60abdc/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f766efd-ade0-4cbc-9675-a57b3c60abdc/bin/uautomizer-verify-BQ2R08f2Ya --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 4d887e46d9e1781030c0b6aae8069b6bddec306ee6a48cba2aa303ff66f408ca --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:41:38,109 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:41:38,169 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f766efd-ade0-4cbc-9675-a57b3c60abdc/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-29 00:41:38,174 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:41:38,174 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:41:38,196 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:41:38,197 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:41:38,197 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:41:38,198 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 00:41:38,198 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 00:41:38,199 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:41:38,200 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:41:38,200 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:41:38,201 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:41:38,201 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:41:38,202 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:41:38,203 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 00:41:38,203 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 00:41:38,204 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:41:38,204 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 00:41:38,205 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:41:38,205 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 00:41:38,206 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 00:41:38,206 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:41:38,207 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:41:38,207 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:41:38,208 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 00:41:38,208 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:41:38,208 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:41:38,209 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:41:38,209 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:41:38,210 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 00:41:38,210 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 00:41:38,210 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 00:41:38,210 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:41:38,210 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:41:38,211 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 00:41:38,211 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:41:38,211 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:41:38,211 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_1f766efd-ade0-4cbc-9675-a57b3c60abdc/bin/uautomizer-verify-BQ2R08f2Ya/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_1f766efd-ade0-4cbc-9675-a57b3c60abdc/bin/uautomizer-verify-BQ2R08f2Ya 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 -> 4d887e46d9e1781030c0b6aae8069b6bddec306ee6a48cba2aa303ff66f408ca [2023-11-29 00:41:38,410 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:41:38,442 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:41:38,444 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:41:38,445 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:41:38,445 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:41:38,446 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f766efd-ade0-4cbc-9675-a57b3c60abdc/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d8_e0.c [2023-11-29 00:41:41,173 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:41:41,417 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:41:41,417 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f766efd-ade0-4cbc-9675-a57b3c60abdc/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d8_e0.c [2023-11-29 00:41:41,429 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f766efd-ade0-4cbc-9675-a57b3c60abdc/bin/uautomizer-verify-BQ2R08f2Ya/data/5cdd1e569/0cf32d512bad47cb9c524c762887b7ef/FLAGb8be77c9e [2023-11-29 00:41:41,443 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f766efd-ade0-4cbc-9675-a57b3c60abdc/bin/uautomizer-verify-BQ2R08f2Ya/data/5cdd1e569/0cf32d512bad47cb9c524c762887b7ef [2023-11-29 00:41:41,446 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:41:41,447 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:41:41,448 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:41:41,448 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:41:41,453 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:41:41,454 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:41:41" (1/1) ... [2023-11-29 00:41:41,455 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@285c875a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:41:41, skipping insertion in model container [2023-11-29 00:41:41,455 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:41:41" (1/1) ... [2023-11-29 00:41:41,507 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:41:41,659 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_1f766efd-ade0-4cbc-9675-a57b3c60abdc/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d8_e0.c[1279,1292] [2023-11-29 00:41:41,819 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:41:41,829 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 00:41:41,841 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_1f766efd-ade0-4cbc-9675-a57b3c60abdc/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d8_e0.c[1279,1292] [2023-11-29 00:41:41,925 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:41:41,939 INFO L206 MainTranslator]: Completed translation [2023-11-29 00:41:41,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:41:41 WrapperNode [2023-11-29 00:41:41,940 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:41:41,941 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 00:41:41,942 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 00:41:41,942 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 00:41:41,949 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:41:41" (1/1) ... [2023-11-29 00:41:41,983 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:41:41" (1/1) ... [2023-11-29 00:41:42,185 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1571 [2023-11-29 00:41:42,186 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 00:41:42,186 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 00:41:42,186 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 00:41:42,187 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 00:41:42,195 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:41:41" (1/1) ... [2023-11-29 00:41:42,195 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:41:41" (1/1) ... [2023-11-29 00:41:42,222 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:41:41" (1/1) ... [2023-11-29 00:41:42,284 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-29 00:41:42,284 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:41:41" (1/1) ... [2023-11-29 00:41:42,284 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:41:41" (1/1) ... [2023-11-29 00:41:42,332 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:41:41" (1/1) ... [2023-11-29 00:41:42,345 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:41:41" (1/1) ... [2023-11-29 00:41:42,372 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:41:41" (1/1) ... [2023-11-29 00:41:42,382 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:41:41" (1/1) ... [2023-11-29 00:41:42,403 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 00:41:42,404 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 00:41:42,404 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 00:41:42,404 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 00:41:42,405 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:41:41" (1/1) ... [2023-11-29 00:41:42,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:41:42,420 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f766efd-ade0-4cbc-9675-a57b3c60abdc/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:41:42,430 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f766efd-ade0-4cbc-9675-a57b3c60abdc/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 00:41:42,436 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f766efd-ade0-4cbc-9675-a57b3c60abdc/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 00:41:42,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 00:41:42,462 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 00:41:42,462 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 00:41:42,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 00:41:42,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 00:41:42,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 00:41:42,650 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 00:41:42,653 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 00:41:43,937 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 00:41:43,986 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 00:41:43,986 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 00:41:43,987 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:41:43 BoogieIcfgContainer [2023-11-29 00:41:43,987 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 00:41:43,989 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 00:41:43,989 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 00:41:43,991 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 00:41:43,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:41:41" (1/3) ... [2023-11-29 00:41:43,992 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@294affc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:41:43, skipping insertion in model container [2023-11-29 00:41:43,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:41:41" (2/3) ... [2023-11-29 00:41:43,993 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@294affc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:41:43, skipping insertion in model container [2023-11-29 00:41:43,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:41:43" (3/3) ... [2023-11-29 00:41:43,994 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.circular_pointer_top_w16_d8_e0.c [2023-11-29 00:41:44,007 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 00:41:44,008 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 00:41:44,055 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:41:44,061 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;@4975068e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:41:44,061 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 00:41:44,066 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-29 00:41:44,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-29 00:41:44,079 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:41:44,080 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-29 00:41:44,080 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:41:44,085 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:41:44,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1078998386, now seen corresponding path program 1 times [2023-11-29 00:41:44,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:41:44,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421712704] [2023-11-29 00:41:44,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:41:44,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:41:44,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:44,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 00:41:44,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:44,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 00:41:44,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:44,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:41:44,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:44,406 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-29 00:41:44,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:41:44,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421712704] [2023-11-29 00:41:44,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421712704] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:41:44,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:41:44,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:41:44,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106326] [2023-11-29 00:41:44,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:41:44,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 00:41:44,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:41:44,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 00:41:44,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 00:41:44,440 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-29 00:41:44,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:41:44,492 INFO L93 Difference]: Finished difference Result 540 states and 892 transitions. [2023-11-29 00:41:44,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 00:41:44,494 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-29 00:41:44,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:41:44,505 INFO L225 Difference]: With dead ends: 540 [2023-11-29 00:41:44,505 INFO L226 Difference]: Without dead ends: 295 [2023-11-29 00:41:44,509 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-29 00:41:44,513 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-29 00:41:44,514 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-29 00:41:44,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2023-11-29 00:41:44,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2023-11-29 00:41:44,563 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-29 00:41:44,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 483 transitions. [2023-11-29 00:41:44,567 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 483 transitions. Word has length 116 [2023-11-29 00:41:44,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:41:44,568 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 483 transitions. [2023-11-29 00:41:44,568 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-29 00:41:44,568 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 483 transitions. [2023-11-29 00:41:44,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-29 00:41:44,571 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:41:44,572 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-29 00:41:44,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 00:41:44,572 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:41:44,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:41:44,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1359904200, now seen corresponding path program 1 times [2023-11-29 00:41:44,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:41:44,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116393334] [2023-11-29 00:41:44,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:41:44,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:41:44,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:45,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 00:41:45,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:45,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 00:41:45,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:45,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:41:45,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:45,230 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-29 00:41:45,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:41:45,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116393334] [2023-11-29 00:41:45,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116393334] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:41:45,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:41:45,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:41:45,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150465736] [2023-11-29 00:41:45,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:41:45,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:41:45,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:41:45,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:41:45,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:41:45,235 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-29 00:41:45,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:41:45,284 INFO L93 Difference]: Finished difference Result 299 states and 487 transitions. [2023-11-29 00:41:45,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:41:45,285 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-29 00:41:45,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:41:45,289 INFO L225 Difference]: With dead ends: 299 [2023-11-29 00:41:45,289 INFO L226 Difference]: Without dead ends: 297 [2023-11-29 00:41:45,290 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-29 00:41:45,291 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-29 00:41:45,292 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-29 00:41:45,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2023-11-29 00:41:45,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2023-11-29 00:41:45,311 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-29 00:41:45,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 485 transitions. [2023-11-29 00:41:45,313 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 485 transitions. Word has length 116 [2023-11-29 00:41:45,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:41:45,315 INFO L495 AbstractCegarLoop]: Abstraction has 297 states and 485 transitions. [2023-11-29 00:41:45,315 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-29 00:41:45,315 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 485 transitions. [2023-11-29 00:41:45,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-11-29 00:41:45,318 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:41:45,318 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-29 00:41:45,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 00:41:45,319 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:41:45,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:41:45,320 INFO L85 PathProgramCache]: Analyzing trace with hash -790917242, now seen corresponding path program 1 times [2023-11-29 00:41:45,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:41:45,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756880240] [2023-11-29 00:41:45,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:41:45,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:41:45,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:45,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 00:41:45,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:45,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 00:41:45,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:45,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:41:45,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:45,649 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-29 00:41:45,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:41:45,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756880240] [2023-11-29 00:41:45,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756880240] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:41:45,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:41:45,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:41:45,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473509837] [2023-11-29 00:41:45,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:41:45,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:41:45,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:41:45,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:41:45,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:41:45,652 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-29 00:41:46,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:41:46,055 INFO L93 Difference]: Finished difference Result 752 states and 1222 transitions. [2023-11-29 00:41:46,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:41:46,061 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-29 00:41:46,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:41:46,063 INFO L225 Difference]: With dead ends: 752 [2023-11-29 00:41:46,064 INFO L226 Difference]: Without dead ends: 297 [2023-11-29 00:41:46,065 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-29 00:41:46,067 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.3s IncrementalHoareTripleChecker+Time [2023-11-29 00:41:46,067 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.3s Time] [2023-11-29 00:41:46,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2023-11-29 00:41:46,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2023-11-29 00:41:46,079 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-29 00:41:46,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 484 transitions. [2023-11-29 00:41:46,081 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 484 transitions. Word has length 117 [2023-11-29 00:41:46,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:41:46,082 INFO L495 AbstractCegarLoop]: Abstraction has 297 states and 484 transitions. [2023-11-29 00:41:46,082 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-29 00:41:46,083 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 484 transitions. [2023-11-29 00:41:46,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-29 00:41:46,085 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:41:46,085 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-29 00:41:46,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 00:41:46,085 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:41:46,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:41:46,086 INFO L85 PathProgramCache]: Analyzing trace with hash 986526220, now seen corresponding path program 1 times [2023-11-29 00:41:46,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:41:46,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934040381] [2023-11-29 00:41:46,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:41:46,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:41:46,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:46,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 00:41:46,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:46,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 00:41:46,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:46,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:41:46,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:46,453 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-29 00:41:46,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:41:46,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934040381] [2023-11-29 00:41:46,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934040381] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:41:46,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:41:46,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:41:46,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579099178] [2023-11-29 00:41:46,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:41:46,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:41:46,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:41:46,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:41:46,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:41:46,456 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-29 00:41:46,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:41:46,491 INFO L93 Difference]: Finished difference Result 545 states and 886 transitions. [2023-11-29 00:41:46,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:41:46,492 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-29 00:41:46,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:41:46,494 INFO L225 Difference]: With dead ends: 545 [2023-11-29 00:41:46,494 INFO L226 Difference]: Without dead ends: 300 [2023-11-29 00:41:46,495 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-29 00:41:46,496 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-29 00:41:46,496 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-29 00:41:46,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-11-29 00:41:46,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 299. [2023-11-29 00:41:46,505 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-29 00:41:46,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 486 transitions. [2023-11-29 00:41:46,507 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 486 transitions. Word has length 118 [2023-11-29 00:41:46,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:41:46,508 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 486 transitions. [2023-11-29 00:41:46,508 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-29 00:41:46,508 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 486 transitions. [2023-11-29 00:41:46,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-29 00:41:46,510 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:41:46,510 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-29 00:41:46,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 00:41:46,510 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:41:46,511 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:41:46,511 INFO L85 PathProgramCache]: Analyzing trace with hash 307109852, now seen corresponding path program 1 times [2023-11-29 00:41:46,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:41:46,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676439244] [2023-11-29 00:41:46,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:41:46,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:41:46,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:47,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 00:41:47,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:47,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 00:41:47,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:47,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:41:47,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:47,045 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-29 00:41:47,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:41:47,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676439244] [2023-11-29 00:41:47,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676439244] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:41:47,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:41:47,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:41:47,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284980982] [2023-11-29 00:41:47,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:41:47,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:41:47,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:41:47,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:41:47,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:41:47,048 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-29 00:41:47,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:41:47,151 INFO L93 Difference]: Finished difference Result 546 states and 886 transitions. [2023-11-29 00:41:47,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:41:47,151 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-29 00:41:47,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:41:47,154 INFO L225 Difference]: With dead ends: 546 [2023-11-29 00:41:47,154 INFO L226 Difference]: Without dead ends: 299 [2023-11-29 00:41:47,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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-29 00:41:47,155 INFO L413 NwaCegarLoop]: 447 mSDtfsCounter, 390 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 896 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-29 00:41:47,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 896 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:41:47,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-11-29 00:41:47,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2023-11-29 00:41:47,165 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-29 00:41:47,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 485 transitions. [2023-11-29 00:41:47,166 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 485 transitions. Word has length 119 [2023-11-29 00:41:47,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:41:47,167 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 485 transitions. [2023-11-29 00:41:47,167 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-29 00:41:47,167 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 485 transitions. [2023-11-29 00:41:47,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-29 00:41:47,169 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:41:47,169 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-29 00:41:47,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 00:41:47,169 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:41:47,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:41:47,170 INFO L85 PathProgramCache]: Analyzing trace with hash -2102105782, now seen corresponding path program 1 times [2023-11-29 00:41:47,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:41:47,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600425126] [2023-11-29 00:41:47,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:41:47,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:41:47,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:47,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 00:41:47,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:47,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 00:41:47,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:47,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:41:47,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:47,495 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-29 00:41:47,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:41:47,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600425126] [2023-11-29 00:41:47,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600425126] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:41:47,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:41:47,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:41:47,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7365142] [2023-11-29 00:41:47,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:41:47,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:41:47,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:41:47,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:41:47,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:41:47,497 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-29 00:41:47,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:41:47,598 INFO L93 Difference]: Finished difference Result 548 states and 886 transitions. [2023-11-29 00:41:47,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:41:47,599 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-29 00:41:47,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:41:47,601 INFO L225 Difference]: With dead ends: 548 [2023-11-29 00:41:47,601 INFO L226 Difference]: Without dead ends: 299 [2023-11-29 00:41:47,602 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-29 00:41:47,602 INFO L413 NwaCegarLoop]: 474 mSDtfsCounter, 394 mSDsluCounter, 926 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 1400 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:41:47,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 1400 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:41:47,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-11-29 00:41:47,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2023-11-29 00:41:47,611 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-29 00:41:47,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 484 transitions. [2023-11-29 00:41:47,613 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 484 transitions. Word has length 120 [2023-11-29 00:41:47,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:41:47,614 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 484 transitions. [2023-11-29 00:41:47,614 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-29 00:41:47,614 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 484 transitions. [2023-11-29 00:41:47,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-11-29 00:41:47,615 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:41:47,615 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-29 00:41:47,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 00:41:47,616 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:41:47,616 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:41:47,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1866585142, now seen corresponding path program 1 times [2023-11-29 00:41:47,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:41:47,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428651799] [2023-11-29 00:41:47,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:41:47,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:41:47,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:47,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 00:41:47,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:47,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 00:41:47,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:47,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:41:47,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:47,931 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-29 00:41:47,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:41:47,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428651799] [2023-11-29 00:41:47,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428651799] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:41:47,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:41:47,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:41:47,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266287563] [2023-11-29 00:41:47,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:41:47,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:41:47,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:41:47,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:41:47,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:41:47,934 INFO L87 Difference]: Start difference. First operand 299 states and 484 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 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-29 00:41:48,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:41:48,044 INFO L93 Difference]: Finished difference Result 546 states and 882 transitions. [2023-11-29 00:41:48,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:41:48,045 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 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-29 00:41:48,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:41:48,047 INFO L225 Difference]: With dead ends: 546 [2023-11-29 00:41:48,047 INFO L226 Difference]: Without dead ends: 299 [2023-11-29 00:41:48,048 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-29 00:41:48,049 INFO L413 NwaCegarLoop]: 447 mSDtfsCounter, 467 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 902 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-29 00:41:48,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 902 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:41:48,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-11-29 00:41:48,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2023-11-29 00:41:48,058 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-29 00:41:48,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 483 transitions. [2023-11-29 00:41:48,060 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 483 transitions. Word has length 121 [2023-11-29 00:41:48,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:41:48,061 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 483 transitions. [2023-11-29 00:41:48,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 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-29 00:41:48,061 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 483 transitions. [2023-11-29 00:41:48,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-29 00:41:48,063 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:41:48,063 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-29 00:41:48,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 00:41:48,063 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:41:48,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:41:48,064 INFO L85 PathProgramCache]: Analyzing trace with hash 911519882, now seen corresponding path program 1 times [2023-11-29 00:41:48,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:41:48,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097365356] [2023-11-29 00:41:48,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:41:48,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:41:48,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:48,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 00:41:48,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:48,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 00:41:48,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:48,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:41:48,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:48,454 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-29 00:41:48,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:41:48,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097365356] [2023-11-29 00:41:48,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097365356] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:41:48,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:41:48,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:41:48,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033660847] [2023-11-29 00:41:48,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:41:48,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:41:48,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:41:48,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:41:48,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:41:48,456 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-29 00:41:48,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:41:48,567 INFO L93 Difference]: Finished difference Result 546 states and 880 transitions. [2023-11-29 00:41:48,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:41:48,568 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-29 00:41:48,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:41:48,570 INFO L225 Difference]: With dead ends: 546 [2023-11-29 00:41:48,570 INFO L226 Difference]: Without dead ends: 299 [2023-11-29 00:41:48,571 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-29 00:41:48,571 INFO L413 NwaCegarLoop]: 447 mSDtfsCounter, 840 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 843 SdHoareTripleChecker+Valid, 896 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-29 00:41:48,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [843 Valid, 896 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:41:48,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-11-29 00:41:48,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2023-11-29 00:41:48,581 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-29 00:41:48,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 482 transitions. [2023-11-29 00:41:48,583 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 482 transitions. Word has length 122 [2023-11-29 00:41:48,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:41:48,583 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 482 transitions. [2023-11-29 00:41:48,583 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-29 00:41:48,583 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 482 transitions. [2023-11-29 00:41:48,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-11-29 00:41:48,585 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:41:48,585 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-29 00:41:48,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 00:41:48,585 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:41:48,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:41:48,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1630477712, now seen corresponding path program 1 times [2023-11-29 00:41:48,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:41:48,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688885846] [2023-11-29 00:41:48,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:41:48,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:41:48,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:49,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 00:41:49,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:49,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 00:41:49,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:49,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:41:49,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:49,031 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-29 00:41:49,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:41:49,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688885846] [2023-11-29 00:41:49,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688885846] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:41:49,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:41:49,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:41:49,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644498823] [2023-11-29 00:41:49,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:41:49,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:41:49,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:41:49,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:41:49,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:41:49,033 INFO L87 Difference]: Start difference. First operand 299 states and 482 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 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-29 00:41:49,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:41:49,098 INFO L93 Difference]: Finished difference Result 546 states and 878 transitions. [2023-11-29 00:41:49,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:41:49,099 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 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-29 00:41:49,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:41:49,101 INFO L225 Difference]: With dead ends: 546 [2023-11-29 00:41:49,101 INFO L226 Difference]: Without dead ends: 299 [2023-11-29 00:41:49,102 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-29 00:41:49,102 INFO L413 NwaCegarLoop]: 459 mSDtfsCounter, 390 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 920 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.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:41:49,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 920 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:41:49,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-11-29 00:41:49,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2023-11-29 00:41:49,109 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-29 00:41:49,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 481 transitions. [2023-11-29 00:41:49,111 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 481 transitions. Word has length 123 [2023-11-29 00:41:49,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:41:49,111 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 481 transitions. [2023-11-29 00:41:49,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 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-29 00:41:49,111 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 481 transitions. [2023-11-29 00:41:49,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-29 00:41:49,112 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:41:49,112 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-29 00:41:49,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 00:41:49,113 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:41:49,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:41:49,113 INFO L85 PathProgramCache]: Analyzing trace with hash 677397706, now seen corresponding path program 1 times [2023-11-29 00:41:49,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:41:49,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161919310] [2023-11-29 00:41:49,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:41:49,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:41:49,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:49,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 00:41:49,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:49,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 00:41:49,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:49,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:41:49,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:49,347 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-29 00:41:49,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:41:49,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161919310] [2023-11-29 00:41:49,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161919310] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:41:49,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:41:49,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:41:49,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720885693] [2023-11-29 00:41:49,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:41:49,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:41:49,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:41:49,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:41:49,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:41:49,349 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-29 00:41:49,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:41:49,422 INFO L93 Difference]: Finished difference Result 548 states and 878 transitions. [2023-11-29 00:41:49,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:41:49,423 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-29 00:41:49,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:41:49,425 INFO L225 Difference]: With dead ends: 548 [2023-11-29 00:41:49,425 INFO L226 Difference]: Without dead ends: 299 [2023-11-29 00:41:49,425 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-29 00:41:49,426 INFO L413 NwaCegarLoop]: 470 mSDtfsCounter, 394 mSDsluCounter, 934 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 1404 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:41:49,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 1404 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:41:49,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-11-29 00:41:49,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2023-11-29 00:41:49,434 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-29 00:41:49,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 480 transitions. [2023-11-29 00:41:49,435 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 480 transitions. Word has length 124 [2023-11-29 00:41:49,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:41:49,436 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 480 transitions. [2023-11-29 00:41:49,436 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-29 00:41:49,436 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 480 transitions. [2023-11-29 00:41:49,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-11-29 00:41:49,437 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:41:49,437 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-29 00:41:49,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 00:41:49,437 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:41:49,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:41:49,438 INFO L85 PathProgramCache]: Analyzing trace with hash -792506006, now seen corresponding path program 1 times [2023-11-29 00:41:49,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:41:49,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545761780] [2023-11-29 00:41:49,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:41:49,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:41:49,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:49,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 00:41:49,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:49,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 00:41:49,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:49,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:41:49,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:49,762 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-29 00:41:49,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:41:49,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545761780] [2023-11-29 00:41:49,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545761780] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:41:49,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:41:49,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:41:49,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124230861] [2023-11-29 00:41:49,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:41:49,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:41:49,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:41:49,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:41:49,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:41:49,765 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-29 00:41:49,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:41:49,825 INFO L93 Difference]: Finished difference Result 546 states and 874 transitions. [2023-11-29 00:41:49,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:41:49,826 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-29 00:41:49,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:41:49,828 INFO L225 Difference]: With dead ends: 546 [2023-11-29 00:41:49,828 INFO L226 Difference]: Without dead ends: 299 [2023-11-29 00:41:49,828 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-29 00:41:49,829 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-29 00:41:49,829 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-29 00:41:49,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-11-29 00:41:49,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2023-11-29 00:41:49,837 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-29 00:41:49,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 479 transitions. [2023-11-29 00:41:49,838 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 479 transitions. Word has length 125 [2023-11-29 00:41:49,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:41:49,838 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 479 transitions. [2023-11-29 00:41:49,838 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-29 00:41:49,838 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 479 transitions. [2023-11-29 00:41:49,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-11-29 00:41:49,840 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:41:49,840 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-29 00:41:49,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 00:41:49,840 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:41:49,840 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:41:49,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1996412576, now seen corresponding path program 1 times [2023-11-29 00:41:49,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:41:49,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569804601] [2023-11-29 00:41:49,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:41:49,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:41:50,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:50,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 00:41:50,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:50,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:41:50,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:50,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 00:41:50,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:50,300 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-29 00:41:50,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:41:50,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569804601] [2023-11-29 00:41:50,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569804601] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:41:50,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:41:50,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:41:50,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939500941] [2023-11-29 00:41:50,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:41:50,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:41:50,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:41:50,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:41:50,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:41:50,302 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-29 00:41:50,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:41:50,399 INFO L93 Difference]: Finished difference Result 546 states and 872 transitions. [2023-11-29 00:41:50,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:41:50,400 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-29 00:41:50,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:41:50,401 INFO L225 Difference]: With dead ends: 546 [2023-11-29 00:41:50,402 INFO L226 Difference]: Without dead ends: 299 [2023-11-29 00:41:50,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:41:50,403 INFO L413 NwaCegarLoop]: 444 mSDtfsCounter, 382 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:41:50,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 890 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:41:50,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-11-29 00:41:50,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2023-11-29 00:41:50,410 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-29 00:41:50,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 478 transitions. [2023-11-29 00:41:50,412 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 478 transitions. Word has length 126 [2023-11-29 00:41:50,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:41:50,412 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 478 transitions. [2023-11-29 00:41:50,413 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-29 00:41:50,413 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 478 transitions. [2023-11-29 00:41:50,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-11-29 00:41:50,414 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:41:50,414 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-29 00:41:50,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 00:41:50,414 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:41:50,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:41:50,414 INFO L85 PathProgramCache]: Analyzing trace with hash 190974242, now seen corresponding path program 1 times [2023-11-29 00:41:50,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:41:50,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365350230] [2023-11-29 00:41:50,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:41:50,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:41:50,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:50,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 00:41:50,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:50,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:41:50,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:50,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 00:41:50,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:50,806 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-29 00:41:50,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:41:50,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365350230] [2023-11-29 00:41:50,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365350230] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:41:50,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:41:50,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:41:50,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864530375] [2023-11-29 00:41:50,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:41:50,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:41:50,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:41:50,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:41:50,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:41:50,808 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-29 00:41:50,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:41:50,921 INFO L93 Difference]: Finished difference Result 546 states and 870 transitions. [2023-11-29 00:41:50,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:41:50,922 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-29 00:41:50,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:41:50,924 INFO L225 Difference]: With dead ends: 546 [2023-11-29 00:41:50,924 INFO L226 Difference]: Without dead ends: 299 [2023-11-29 00:41:50,924 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-29 00:41:50,925 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-29 00:41:50,925 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-29 00:41:50,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-11-29 00:41:50,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2023-11-29 00:41:50,933 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-29 00:41:50,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 477 transitions. [2023-11-29 00:41:50,934 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 477 transitions. Word has length 126 [2023-11-29 00:41:50,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:41:50,935 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 477 transitions. [2023-11-29 00:41:50,935 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-29 00:41:50,935 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 477 transitions. [2023-11-29 00:41:50,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-11-29 00:41:50,936 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:41:50,936 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-29 00:41:50,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 00:41:50,936 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:41:50,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:41:50,937 INFO L85 PathProgramCache]: Analyzing trace with hash -626674208, now seen corresponding path program 1 times [2023-11-29 00:41:50,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:41:50,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672443088] [2023-11-29 00:41:50,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:41:50,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:41:51,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:51,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 00:41:51,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:51,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:41:51,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:51,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 00:41:51,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:51,510 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-29 00:41:51,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:41:51,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672443088] [2023-11-29 00:41:51,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672443088] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:41:51,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:41:51,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:41:51,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089302266] [2023-11-29 00:41:51,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:41:51,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:41:51,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:41:51,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:41:51,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:41:51,512 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-29 00:41:51,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:41:51,628 INFO L93 Difference]: Finished difference Result 546 states and 868 transitions. [2023-11-29 00:41:51,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:41:51,629 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-29 00:41:51,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:41:51,631 INFO L225 Difference]: With dead ends: 546 [2023-11-29 00:41:51,631 INFO L226 Difference]: Without dead ends: 299 [2023-11-29 00:41:51,632 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-29 00:41:51,632 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-29 00:41:51,633 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-29 00:41:51,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-11-29 00:41:51,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2023-11-29 00:41:51,644 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-29 00:41:51,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 476 transitions. [2023-11-29 00:41:51,646 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 476 transitions. Word has length 126 [2023-11-29 00:41:51,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:41:51,647 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 476 transitions. [2023-11-29 00:41:51,647 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-29 00:41:51,647 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 476 transitions. [2023-11-29 00:41:51,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-11-29 00:41:51,648 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:41:51,648 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-29 00:41:51,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 00:41:51,649 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:41:51,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:41:51,649 INFO L85 PathProgramCache]: Analyzing trace with hash 2079945186, now seen corresponding path program 1 times [2023-11-29 00:41:51,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:41:51,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442514692] [2023-11-29 00:41:51,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:41:51,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:41:51,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:51,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 00:41:51,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:51,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:41:51,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:51,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 00:41:51,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:51,986 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-29 00:41:51,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:41:51,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442514692] [2023-11-29 00:41:51,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442514692] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:41:51,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:41:51,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:41:51,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195102994] [2023-11-29 00:41:51,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:41:51,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:41:51,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:41:51,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:41:51,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:41:51,988 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-29 00:41:52,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:41:52,054 INFO L93 Difference]: Finished difference Result 546 states and 866 transitions. [2023-11-29 00:41:52,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:41:52,055 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-29 00:41:52,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:41:52,057 INFO L225 Difference]: With dead ends: 546 [2023-11-29 00:41:52,057 INFO L226 Difference]: Without dead ends: 299 [2023-11-29 00:41:52,058 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-29 00:41:52,058 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-29 00:41:52,059 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-29 00:41:52,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-11-29 00:41:52,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2023-11-29 00:41:52,070 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-29 00:41:52,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 475 transitions. [2023-11-29 00:41:52,072 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 475 transitions. Word has length 126 [2023-11-29 00:41:52,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:41:52,072 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 475 transitions. [2023-11-29 00:41:52,073 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-29 00:41:52,073 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 475 transitions. [2023-11-29 00:41:52,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-11-29 00:41:52,074 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:41:52,074 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-29 00:41:52,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 00:41:52,075 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:41:52,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:41:52,075 INFO L85 PathProgramCache]: Analyzing trace with hash 2107010788, now seen corresponding path program 1 times [2023-11-29 00:41:52,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:41:52,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742156369] [2023-11-29 00:41:52,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:41:52,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:41:52,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:52,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 00:41:52,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:52,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:41:52,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:52,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 00:41:52,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:52,477 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-29 00:41:52,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:41:52,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742156369] [2023-11-29 00:41:52,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742156369] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:41:52,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:41:52,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:41:52,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768241525] [2023-11-29 00:41:52,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:41:52,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:41:52,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:41:52,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:41:52,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:41:52,480 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-29 00:41:52,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:41:52,545 INFO L93 Difference]: Finished difference Result 546 states and 864 transitions. [2023-11-29 00:41:52,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:41:52,546 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-29 00:41:52,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:41:52,548 INFO L225 Difference]: With dead ends: 546 [2023-11-29 00:41:52,548 INFO L226 Difference]: Without dead ends: 299 [2023-11-29 00:41:52,549 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-29 00:41:52,550 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-29 00:41:52,550 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-29 00:41:52,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-11-29 00:41:52,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2023-11-29 00:41:52,561 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-29 00:41:52,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 474 transitions. [2023-11-29 00:41:52,563 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 474 transitions. Word has length 126 [2023-11-29 00:41:52,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:41:52,563 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 474 transitions. [2023-11-29 00:41:52,563 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-29 00:41:52,563 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 474 transitions. [2023-11-29 00:41:52,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-11-29 00:41:52,565 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:41:52,565 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-29 00:41:52,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 00:41:52,565 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:41:52,565 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:41:52,566 INFO L85 PathProgramCache]: Analyzing trace with hash -801753114, now seen corresponding path program 1 times [2023-11-29 00:41:52,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:41:52,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619827659] [2023-11-29 00:41:52,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:41:52,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:41:52,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:53,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 00:41:53,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:53,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:41:53,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:53,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 00:41:53,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:53,007 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-29 00:41:53,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:41:53,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619827659] [2023-11-29 00:41:53,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619827659] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:41:53,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:41:53,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:41:53,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802292432] [2023-11-29 00:41:53,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:41:53,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:41:53,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:41:53,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:41:53,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:41:53,010 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-29 00:41:53,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:41:53,191 INFO L93 Difference]: Finished difference Result 548 states and 864 transitions. [2023-11-29 00:41:53,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:41:53,192 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-29 00:41:53,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:41:53,194 INFO L225 Difference]: With dead ends: 548 [2023-11-29 00:41:53,194 INFO L226 Difference]: Without dead ends: 299 [2023-11-29 00:41:53,195 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-29 00:41:53,195 INFO L413 NwaCegarLoop]: 465 mSDtfsCounter, 4 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-29 00:41:53,196 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-29 00:41:53,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-11-29 00:41:53,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2023-11-29 00:41:53,204 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-29 00:41:53,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 473 transitions. [2023-11-29 00:41:53,206 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 473 transitions. Word has length 126 [2023-11-29 00:41:53,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:41:53,206 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 473 transitions. [2023-11-29 00:41:53,206 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-29 00:41:53,206 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 473 transitions. [2023-11-29 00:41:53,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-11-29 00:41:53,207 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:41:53,208 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-29 00:41:53,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 00:41:53,208 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:41:53,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:41:53,208 INFO L85 PathProgramCache]: Analyzing trace with hash -186832874, now seen corresponding path program 1 times [2023-11-29 00:41:53,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:41:53,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945402488] [2023-11-29 00:41:53,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:41:53,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:41:53,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:53,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 00:41:53,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:53,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:41:53,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:53,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 00:41:53,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:53,900 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-29 00:41:53,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:41:53,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945402488] [2023-11-29 00:41:53,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945402488] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:41:53,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:41:53,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 00:41:53,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966246980] [2023-11-29 00:41:53,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:41:53,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:41:53,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:41:53,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:41:53,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:41:53,902 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-29 00:41:54,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:41:54,092 INFO L93 Difference]: Finished difference Result 872 states and 1369 transitions. [2023-11-29 00:41:54,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 00:41:54,093 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-29 00:41:54,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:41:54,097 INFO L225 Difference]: With dead ends: 872 [2023-11-29 00:41:54,097 INFO L226 Difference]: Without dead ends: 625 [2023-11-29 00:41:54,098 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-29 00:41:54,099 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-29 00:41:54,099 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-29 00:41:54,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2023-11-29 00:41:54,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 391. [2023-11-29 00:41:54,122 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-29 00:41:54,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 610 transitions. [2023-11-29 00:41:54,124 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 610 transitions. Word has length 127 [2023-11-29 00:41:54,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:41:54,125 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 610 transitions. [2023-11-29 00:41:54,125 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-29 00:41:54,125 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 610 transitions. [2023-11-29 00:41:54,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2023-11-29 00:41:54,130 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:41:54,130 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-29 00:41:54,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 00:41:54,130 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:41:54,131 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:41:54,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1486298518, now seen corresponding path program 1 times [2023-11-29 00:41:54,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:41:54,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820801786] [2023-11-29 00:41:54,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:41:54,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:41:54,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:55,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 00:41:55,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:55,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:41:55,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:55,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 00:41:55,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:55,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2023-11-29 00:41:55,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:55,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2023-11-29 00:41:55,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:55,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2023-11-29 00:41:55,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:55,040 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-29 00:41:55,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:41:55,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820801786] [2023-11-29 00:41:55,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820801786] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:41:55,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:41:55,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:41:55,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481795374] [2023-11-29 00:41:55,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:41:55,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:41:55,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:41:55,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:41:55,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:41:55,043 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-29 00:41:55,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:41:55,141 INFO L93 Difference]: Finished difference Result 638 states and 997 transitions. [2023-11-29 00:41:55,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:41:55,142 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-29 00:41:55,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:41:55,145 INFO L225 Difference]: With dead ends: 638 [2023-11-29 00:41:55,145 INFO L226 Difference]: Without dead ends: 391 [2023-11-29 00:41:55,146 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-29 00:41:55,147 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-29 00:41:55,147 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-29 00:41:55,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2023-11-29 00:41:55,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2023-11-29 00:41:55,167 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-29 00:41:55,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 609 transitions. [2023-11-29 00:41:55,169 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 609 transitions. Word has length 309 [2023-11-29 00:41:55,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:41:55,170 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 609 transitions. [2023-11-29 00:41:55,170 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-29 00:41:55,170 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 609 transitions. [2023-11-29 00:41:55,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2023-11-29 00:41:55,175 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:41:55,175 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-29 00:41:55,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 00:41:55,175 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:41:55,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:41:55,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1863575638, now seen corresponding path program 1 times [2023-11-29 00:41:55,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:41:55,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179496849] [2023-11-29 00:41:55,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:41:55,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:41:55,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:55,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 00:41:55,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:55,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:41:55,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:55,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 00:41:55,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:55,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2023-11-29 00:41:55,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:55,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2023-11-29 00:41:55,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:55,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2023-11-29 00:41:55,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:55,912 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-29 00:41:55,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:41:55,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179496849] [2023-11-29 00:41:55,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179496849] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:41:55,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:41:55,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:41:55,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125368422] [2023-11-29 00:41:55,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:41:55,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:41:55,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:41:55,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:41:55,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:41:55,915 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-29 00:41:56,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:41:56,007 INFO L93 Difference]: Finished difference Result 638 states and 995 transitions. [2023-11-29 00:41:56,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:41:56,007 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-29 00:41:56,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:41:56,010 INFO L225 Difference]: With dead ends: 638 [2023-11-29 00:41:56,010 INFO L226 Difference]: Without dead ends: 391 [2023-11-29 00:41:56,010 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-29 00:41:56,011 INFO L413 NwaCegarLoop]: 441 mSDtfsCounter, 746 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 749 SdHoareTripleChecker+Valid, 884 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-29 00:41:56,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [749 Valid, 884 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:41:56,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2023-11-29 00:41:56,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2023-11-29 00:41:56,026 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-29 00:41:56,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 608 transitions. [2023-11-29 00:41:56,028 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 608 transitions. Word has length 310 [2023-11-29 00:41:56,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:41:56,028 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 608 transitions. [2023-11-29 00:41:56,028 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-29 00:41:56,028 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 608 transitions. [2023-11-29 00:41:56,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2023-11-29 00:41:56,031 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:41:56,032 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-29 00:41:56,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 00:41:56,032 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:41:56,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:41:56,032 INFO L85 PathProgramCache]: Analyzing trace with hash 372564790, now seen corresponding path program 1 times [2023-11-29 00:41:56,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:41:56,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950153912] [2023-11-29 00:41:56,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:41:56,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:41:56,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:56,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 00:41:56,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:56,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:41:56,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:56,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 00:41:56,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:56,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2023-11-29 00:41:56,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:56,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2023-11-29 00:41:56,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:56,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2023-11-29 00:41:56,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:56,586 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-29 00:41:56,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:41:56,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950153912] [2023-11-29 00:41:56,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950153912] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:41:56,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:41:56,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:41:56,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751687861] [2023-11-29 00:41:56,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:41:56,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:41:56,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:41:56,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:41:56,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:41:56,589 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-29 00:41:56,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:41:56,678 INFO L93 Difference]: Finished difference Result 638 states and 993 transitions. [2023-11-29 00:41:56,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:41:56,679 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-29 00:41:56,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:41:56,681 INFO L225 Difference]: With dead ends: 638 [2023-11-29 00:41:56,681 INFO L226 Difference]: Without dead ends: 391 [2023-11-29 00:41:56,682 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-29 00:41:56,683 INFO L413 NwaCegarLoop]: 441 mSDtfsCounter, 410 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-29 00:41:56,683 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-29 00:41:56,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2023-11-29 00:41:56,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2023-11-29 00:41:56,699 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-29 00:41:56,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 607 transitions. [2023-11-29 00:41:56,701 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 607 transitions. Word has length 311 [2023-11-29 00:41:56,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:41:56,701 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 607 transitions. [2023-11-29 00:41:56,701 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-29 00:41:56,701 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 607 transitions. [2023-11-29 00:41:56,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2023-11-29 00:41:56,704 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:41:56,705 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-29 00:41:56,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-29 00:41:56,705 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:41:56,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:41:56,705 INFO L85 PathProgramCache]: Analyzing trace with hash -342234970, now seen corresponding path program 1 times [2023-11-29 00:41:56,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:41:56,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769367362] [2023-11-29 00:41:56,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:41:56,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:41:56,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:57,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 00:41:57,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:57,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:41:57,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:57,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 00:41:57,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:57,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2023-11-29 00:41:57,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:57,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2023-11-29 00:41:57,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:57,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2023-11-29 00:41:57,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:57,337 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-29 00:41:57,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:41:57,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769367362] [2023-11-29 00:41:57,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769367362] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:41:57,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:41:57,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:41:57,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29054288] [2023-11-29 00:41:57,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:41:57,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:41:57,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:41:57,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:41:57,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:41:57,340 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-29 00:41:57,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:41:57,434 INFO L93 Difference]: Finished difference Result 638 states and 991 transitions. [2023-11-29 00:41:57,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:41:57,436 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-29 00:41:57,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:41:57,439 INFO L225 Difference]: With dead ends: 638 [2023-11-29 00:41:57,439 INFO L226 Difference]: Without dead ends: 391 [2023-11-29 00:41:57,440 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-29 00:41:57,441 INFO L413 NwaCegarLoop]: 441 mSDtfsCounter, 714 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-29 00:41:57,441 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-29 00:41:57,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2023-11-29 00:41:57,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2023-11-29 00:41:57,459 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-29 00:41:57,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 606 transitions. [2023-11-29 00:41:57,462 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 606 transitions. Word has length 312 [2023-11-29 00:41:57,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:41:57,463 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 606 transitions. [2023-11-29 00:41:57,463 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-29 00:41:57,463 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 606 transitions. [2023-11-29 00:41:57,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2023-11-29 00:41:57,468 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:41:57,469 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-29 00:41:57,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-29 00:41:57,469 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:41:57,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:41:57,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1107896516, now seen corresponding path program 1 times [2023-11-29 00:41:57,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:41:57,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266031063] [2023-11-29 00:41:57,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:41:57,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:41:57,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:58,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 00:41:58,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:58,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:41:58,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:58,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 00:41:58,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:58,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2023-11-29 00:41:58,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:58,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2023-11-29 00:41:58,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:58,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2023-11-29 00:41:58,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:58,350 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-29 00:41:58,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:41:58,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266031063] [2023-11-29 00:41:58,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266031063] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:41:58,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:41:58,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:41:58,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827082684] [2023-11-29 00:41:58,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:41:58,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:41:58,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:41:58,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:41:58,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:41:58,353 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-29 00:41:58,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:41:58,437 INFO L93 Difference]: Finished difference Result 638 states and 989 transitions. [2023-11-29 00:41:58,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:41:58,438 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-29 00:41:58,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:41:58,441 INFO L225 Difference]: With dead ends: 638 [2023-11-29 00:41:58,441 INFO L226 Difference]: Without dead ends: 391 [2023-11-29 00:41:58,442 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-29 00:41:58,442 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-29 00:41:58,442 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-29 00:41:58,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2023-11-29 00:41:58,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2023-11-29 00:41:58,464 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-29 00:41:58,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 605 transitions. [2023-11-29 00:41:58,467 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 605 transitions. Word has length 313 [2023-11-29 00:41:58,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:41:58,468 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 605 transitions. [2023-11-29 00:41:58,468 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-29 00:41:58,468 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 605 transitions. [2023-11-29 00:41:58,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2023-11-29 00:41:58,474 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:41:58,474 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-29 00:41:58,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-29 00:41:58,475 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:41:58,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:41:58,475 INFO L85 PathProgramCache]: Analyzing trace with hash 787072628, now seen corresponding path program 1 times [2023-11-29 00:41:58,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:41:58,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907450503] [2023-11-29 00:41:58,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:41:58,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:41:58,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:59,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 00:41:59,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:59,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:41:59,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:59,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 00:41:59,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:59,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2023-11-29 00:41:59,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:59,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2023-11-29 00:41:59,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:59,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2023-11-29 00:41:59,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:59,246 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-29 00:41:59,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:41:59,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907450503] [2023-11-29 00:41:59,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907450503] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:41:59,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:41:59,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:41:59,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760832082] [2023-11-29 00:41:59,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:41:59,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:41:59,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:41:59,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:41:59,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:41:59,249 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-29 00:41:59,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:41:59,321 INFO L93 Difference]: Finished difference Result 638 states and 987 transitions. [2023-11-29 00:41:59,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:41:59,322 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-29 00:41:59,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:41:59,324 INFO L225 Difference]: With dead ends: 638 [2023-11-29 00:41:59,325 INFO L226 Difference]: Without dead ends: 391 [2023-11-29 00:41:59,325 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-29 00:41:59,326 INFO L413 NwaCegarLoop]: 449 mSDtfsCounter, 676 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 679 SdHoareTripleChecker+Valid, 900 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-29 00:41:59,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [679 Valid, 900 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:41:59,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2023-11-29 00:41:59,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2023-11-29 00:41:59,354 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-29 00:41:59,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 604 transitions. [2023-11-29 00:41:59,357 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 604 transitions. Word has length 314 [2023-11-29 00:41:59,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:41:59,357 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 604 transitions. [2023-11-29 00:41:59,358 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-29 00:41:59,358 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 604 transitions. [2023-11-29 00:41:59,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2023-11-29 00:41:59,363 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:41:59,363 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-29 00:41:59,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-29 00:41:59,363 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:41:59,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:41:59,364 INFO L85 PathProgramCache]: Analyzing trace with hash 624313872, now seen corresponding path program 1 times [2023-11-29 00:41:59,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:41:59,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233861704] [2023-11-29 00:41:59,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:41:59,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:41:59,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:00,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 00:42:00,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:00,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:42:00,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:00,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 00:42:00,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:00,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2023-11-29 00:42:00,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:00,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2023-11-29 00:42:00,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:00,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2023-11-29 00:42:00,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:00,147 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-29 00:42:00,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:42:00,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233861704] [2023-11-29 00:42:00,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233861704] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:42:00,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:42:00,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:42:00,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846823306] [2023-11-29 00:42:00,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:42:00,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:42:00,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:42:00,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:42:00,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:42:00,150 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-29 00:42:00,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:42:00,409 INFO L93 Difference]: Finished difference Result 638 states and 985 transitions. [2023-11-29 00:42:00,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:42:00,410 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-29 00:42:00,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:42:00,412 INFO L225 Difference]: With dead ends: 638 [2023-11-29 00:42:00,412 INFO L226 Difference]: Without dead ends: 391 [2023-11-29 00:42:00,413 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-29 00:42:00,413 INFO L413 NwaCegarLoop]: 336 mSDtfsCounter, 366 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 680 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.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:42:00,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 680 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 00:42:00,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2023-11-29 00:42:00,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2023-11-29 00:42:00,428 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-29 00:42:00,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 603 transitions. [2023-11-29 00:42:00,430 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 603 transitions. Word has length 315 [2023-11-29 00:42:00,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:42:00,431 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 603 transitions. [2023-11-29 00:42:00,431 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-29 00:42:00,432 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 603 transitions. [2023-11-29 00:42:00,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2023-11-29 00:42:00,434 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:42:00,434 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-29 00:42:00,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-29 00:42:00,434 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:42:00,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:42:00,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1824240060, now seen corresponding path program 1 times [2023-11-29 00:42:00,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:42:00,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399633130] [2023-11-29 00:42:00,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:42:00,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:42:00,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:01,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 00:42:01,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:01,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:42:01,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:01,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 00:42:01,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:01,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2023-11-29 00:42:01,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:01,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2023-11-29 00:42:01,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:01,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2023-11-29 00:42:01,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:01,377 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-29 00:42:01,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:42:01,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399633130] [2023-11-29 00:42:01,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399633130] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:42:01,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:42:01,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:42:01,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143750674] [2023-11-29 00:42:01,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:42:01,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:42:01,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:42:01,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:42:01,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:42:01,380 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-29 00:42:01,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:42:01,478 INFO L93 Difference]: Finished difference Result 638 states and 983 transitions. [2023-11-29 00:42:01,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:42:01,479 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-29 00:42:01,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:42:01,482 INFO L225 Difference]: With dead ends: 638 [2023-11-29 00:42:01,482 INFO L226 Difference]: Without dead ends: 391 [2023-11-29 00:42:01,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 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-29 00:42:01,483 INFO L413 NwaCegarLoop]: 438 mSDtfsCounter, 680 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 878 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-29 00:42:01,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 878 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:42:01,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2023-11-29 00:42:01,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2023-11-29 00:42:01,495 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-29 00:42:01,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 602 transitions. [2023-11-29 00:42:01,497 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 602 transitions. Word has length 316 [2023-11-29 00:42:01,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:42:01,497 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 602 transitions. [2023-11-29 00:42:01,498 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-29 00:42:01,498 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 602 transitions. [2023-11-29 00:42:01,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2023-11-29 00:42:01,499 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:42:01,499 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-29 00:42:01,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-29 00:42:01,500 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:42:01,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:42:01,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1253968254, now seen corresponding path program 1 times [2023-11-29 00:42:01,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:42:01,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517633930] [2023-11-29 00:42:01,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:42:01,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:42:01,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:02,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 00:42:02,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:02,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:42:02,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:02,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 00:42:02,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:02,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2023-11-29 00:42:02,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:02,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2023-11-29 00:42:02,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:02,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2023-11-29 00:42:02,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:02,450 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-29 00:42:02,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:42:02,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517633930] [2023-11-29 00:42:02,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517633930] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:42:02,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:42:02,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:42:02,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622683469] [2023-11-29 00:42:02,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:42:02,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:42:02,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:42:02,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:42:02,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:42:02,453 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-29 00:42:02,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:42:02,534 INFO L93 Difference]: Finished difference Result 638 states and 981 transitions. [2023-11-29 00:42:02,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:42:02,534 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-29 00:42:02,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:42:02,537 INFO L225 Difference]: With dead ends: 638 [2023-11-29 00:42:02,537 INFO L226 Difference]: Without dead ends: 391 [2023-11-29 00:42:02,537 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-29 00:42:02,538 INFO L413 NwaCegarLoop]: 438 mSDtfsCounter, 308 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-29 00:42:02,538 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-29 00:42:02,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2023-11-29 00:42:02,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2023-11-29 00:42:02,549 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-29 00:42:02,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 601 transitions. [2023-11-29 00:42:02,551 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 601 transitions. Word has length 316 [2023-11-29 00:42:02,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:42:02,551 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 601 transitions. [2023-11-29 00:42:02,551 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-29 00:42:02,552 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 601 transitions. [2023-11-29 00:42:02,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2023-11-29 00:42:02,553 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:42:02,553 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-29 00:42:02,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-29 00:42:02,554 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:42:02,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:42:02,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1271527428, now seen corresponding path program 1 times [2023-11-29 00:42:02,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:42:02,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308593753] [2023-11-29 00:42:02,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:42:02,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:42:03,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:04,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 00:42:04,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:04,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:42:04,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:04,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 00:42:04,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:04,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2023-11-29 00:42:04,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:04,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2023-11-29 00:42:04,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:04,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2023-11-29 00:42:04,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:04,041 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-29 00:42:04,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:42:04,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308593753] [2023-11-29 00:42:04,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308593753] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:42:04,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:42:04,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 00:42:04,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165156299] [2023-11-29 00:42:04,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:42:04,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 00:42:04,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:42:04,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 00:42:04,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:42:04,043 INFO L87 Difference]: Start difference. First operand 391 states and 601 transitions. Second operand has 7 states, 7 states have (on average 37.142857142857146) internal successors, (260), 7 states have internal predecessors, (260), 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-29 00:42:04,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:42:04,401 INFO L93 Difference]: Finished difference Result 830 states and 1270 transitions. [2023-11-29 00:42:04,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 00:42:04,401 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 37.142857142857146) internal successors, (260), 7 states have internal predecessors, (260), 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-29 00:42:04,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:42:04,404 INFO L225 Difference]: With dead ends: 830 [2023-11-29 00:42:04,404 INFO L226 Difference]: Without dead ends: 399 [2023-11-29 00:42:04,405 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-29 00:42:04,406 INFO L413 NwaCegarLoop]: 443 mSDtfsCounter, 952 mSDsluCounter, 1316 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-29 00:42:04,406 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-29 00:42:04,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2023-11-29 00:42:04,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 395. [2023-11-29 00:42:04,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 387 states have (on average 1.5271317829457365) internal successors, (591), 387 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-29 00:42:04,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 603 transitions. [2023-11-29 00:42:04,425 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 603 transitions. Word has length 316 [2023-11-29 00:42:04,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:42:04,426 INFO L495 AbstractCegarLoop]: Abstraction has 395 states and 603 transitions. [2023-11-29 00:42:04,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 37.142857142857146) internal successors, (260), 7 states have internal predecessors, (260), 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-29 00:42:04,426 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 603 transitions. [2023-11-29 00:42:04,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2023-11-29 00:42:04,429 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:42:04,429 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] [2023-11-29 00:42:04,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-11-29 00:42:04,429 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:42:04,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:42:04,430 INFO L85 PathProgramCache]: Analyzing trace with hash -84980268, now seen corresponding path program 1 times [2023-11-29 00:42:04,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:42:04,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708483725] [2023-11-29 00:42:04,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:42:04,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:42:05,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:05,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 00:42:05,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:05,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 00:42:05,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:05,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 00:42:05,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:05,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2023-11-29 00:42:05,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:05,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2023-11-29 00:42:05,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:05,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2023-11-29 00:42:05,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:05,762 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-29 00:42:05,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:42:05,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708483725] [2023-11-29 00:42:05,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708483725] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:42:05,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:42:05,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 00:42:05,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924906920] [2023-11-29 00:42:05,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:42:05,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:42:05,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:42:05,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:42:05,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:42:05,764 INFO L87 Difference]: Start difference. First operand 395 states and 603 transitions. Second operand has 6 states, 6 states have (on average 48.5) internal successors, (291), 6 states have internal predecessors, (291), 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-29 00:42:06,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:42:06,314 INFO L93 Difference]: Finished difference Result 967 states and 1479 transitions. [2023-11-29 00:42:06,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:42:06,315 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 48.5) internal successors, (291), 6 states have internal predecessors, (291), 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 318 [2023-11-29 00:42:06,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:42:06,320 INFO L225 Difference]: With dead ends: 967 [2023-11-29 00:42:06,320 INFO L226 Difference]: Without dead ends: 718 [2023-11-29 00:42:06,321 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-29 00:42:06,322 INFO L413 NwaCegarLoop]: 445 mSDtfsCounter, 308 mSDsluCounter, 1641 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 2086 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 00:42:06,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 2086 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 00:42:06,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2023-11-29 00:42:06,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 610. [2023-11-29 00:42:06,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 599 states have (on average 1.5208681135225375) internal successors, (911), 599 states have internal predecessors, (911), 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-29 00:42:06,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 929 transitions. [2023-11-29 00:42:06,351 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 929 transitions. Word has length 318 [2023-11-29 00:42:06,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:42:06,351 INFO L495 AbstractCegarLoop]: Abstraction has 610 states and 929 transitions. [2023-11-29 00:42:06,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 48.5) internal successors, (291), 6 states have internal predecessors, (291), 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-29 00:42:06,352 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 929 transitions. [2023-11-29 00:42:06,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2023-11-29 00:42:06,354 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:42:06,355 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-29 00:42:06,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-11-29 00:42:06,355 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:42:06,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:42:06,355 INFO L85 PathProgramCache]: Analyzing trace with hash 964437772, now seen corresponding path program 1 times [2023-11-29 00:42:06,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:42:06,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183469950] [2023-11-29 00:42:06,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:42:06,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:42:07,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:07,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 00:42:07,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:07,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 00:42:07,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:07,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 00:42:07,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:07,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2023-11-29 00:42:07,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:07,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2023-11-29 00:42:07,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:07,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2023-11-29 00:42:07,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:07,763 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-29 00:42:07,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:42:07,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183469950] [2023-11-29 00:42:07,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183469950] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:42:07,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:42:07,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 00:42:07,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796060484] [2023-11-29 00:42:07,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:42:07,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:42:07,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:42:07,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:42:07,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:42:07,766 INFO L87 Difference]: Start difference. First operand 610 states and 929 transitions. Second operand has 6 states, 6 states have (on average 48.666666666666664) internal successors, (292), 6 states have internal predecessors, (292), 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-29 00:42:08,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:42:08,248 INFO L93 Difference]: Finished difference Result 897 states and 1371 transitions. [2023-11-29 00:42:08,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:42:08,249 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 48.666666666666664) internal successors, (292), 6 states have internal predecessors, (292), 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 319 [2023-11-29 00:42:08,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:42:08,253 INFO L225 Difference]: With dead ends: 897 [2023-11-29 00:42:08,253 INFO L226 Difference]: Without dead ends: 648 [2023-11-29 00:42:08,254 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-29 00:42:08,254 INFO L413 NwaCegarLoop]: 334 mSDtfsCounter, 866 mSDsluCounter, 978 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 869 SdHoareTripleChecker+Valid, 1312 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.4s IncrementalHoareTripleChecker+Time [2023-11-29 00:42:08,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [869 Valid, 1312 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 00:42:08,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2023-11-29 00:42:08,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 611. [2023-11-29 00:42:08,280 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-29 00:42:08,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 930 transitions. [2023-11-29 00:42:08,283 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 930 transitions. Word has length 319 [2023-11-29 00:42:08,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:42:08,283 INFO L495 AbstractCegarLoop]: Abstraction has 611 states and 930 transitions. [2023-11-29 00:42:08,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 48.666666666666664) internal successors, (292), 6 states have internal predecessors, (292), 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-29 00:42:08,284 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 930 transitions. [2023-11-29 00:42:08,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2023-11-29 00:42:08,286 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:42:08,287 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-29 00:42:08,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-11-29 00:42:08,287 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:42:08,287 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:42:08,287 INFO L85 PathProgramCache]: Analyzing trace with hash -317734514, now seen corresponding path program 1 times [2023-11-29 00:42:08,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:42:08,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24506332] [2023-11-29 00:42:08,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:42:08,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:42:09,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:10,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 00:42:10,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:10,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 00:42:10,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:10,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 00:42:10,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:10,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2023-11-29 00:42:10,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:10,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2023-11-29 00:42:10,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:10,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2023-11-29 00:42:10,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:10,021 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-11-29 00:42:10,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:42:10,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24506332] [2023-11-29 00:42:10,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24506332] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:42:10,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:42:10,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 00:42:10,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659857984] [2023-11-29 00:42:10,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:42:10,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 00:42:10,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:42:10,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 00:42:10,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:42:10,024 INFO L87 Difference]: Start difference. First operand 611 states and 930 transitions. Second operand has 7 states, 7 states have (on average 33.857142857142854) internal successors, (237), 7 states have internal predecessors, (237), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 00:42:10,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:42:10,519 INFO L93 Difference]: Finished difference Result 1122 states and 1702 transitions. [2023-11-29 00:42:10,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:42:10,520 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 33.857142857142854) internal successors, (237), 7 states have internal predecessors, (237), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 319 [2023-11-29 00:42:10,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:42:10,523 INFO L225 Difference]: With dead ends: 1122 [2023-11-29 00:42:10,523 INFO L226 Difference]: Without dead ends: 623 [2023-11-29 00:42:10,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2023-11-29 00:42:10,525 INFO L413 NwaCegarLoop]: 344 mSDtfsCounter, 815 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 1130 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 00:42:10,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 1130 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 00:42:10,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2023-11-29 00:42:10,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 617. [2023-11-29 00:42:10,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 606 states have (on average 1.50990099009901) internal successors, (915), 606 states have internal predecessors, (915), 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-29 00:42:10,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 933 transitions. [2023-11-29 00:42:10,553 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 933 transitions. Word has length 319 [2023-11-29 00:42:10,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:42:10,553 INFO L495 AbstractCegarLoop]: Abstraction has 617 states and 933 transitions. [2023-11-29 00:42:10,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 33.857142857142854) internal successors, (237), 7 states have internal predecessors, (237), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 00:42:10,554 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 933 transitions. [2023-11-29 00:42:10,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2023-11-29 00:42:10,557 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:42:10,557 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, 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-29 00:42:10,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-11-29 00:42:10,558 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:42:10,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:42:10,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1301267710, now seen corresponding path program 1 times [2023-11-29 00:42:10,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:42:10,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798450799] [2023-11-29 00:42:10,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:42:10,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:42:11,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:11,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 00:42:11,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:11,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 00:42:11,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:11,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 00:42:11,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:11,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2023-11-29 00:42:11,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:11,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2023-11-29 00:42:11,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:11,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2023-11-29 00:42:11,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:11,841 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-11-29 00:42:11,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:42:11,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798450799] [2023-11-29 00:42:11,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798450799] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:42:11,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:42:11,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:42:11,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059901916] [2023-11-29 00:42:11,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:42:11,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:42:11,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:42:11,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:42:11,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:42:11,845 INFO L87 Difference]: Start difference. First operand 617 states and 933 transitions. Second operand has 4 states, 4 states have (on average 66.5) internal successors, (266), 4 states have internal predecessors, (266), 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-29 00:42:12,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:42:12,090 INFO L93 Difference]: Finished difference Result 1032 states and 1548 transitions. [2023-11-29 00:42:12,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:42:12,091 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 66.5) internal successors, (266), 4 states have internal predecessors, (266), 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 321 [2023-11-29 00:42:12,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:42:12,094 INFO L225 Difference]: With dead ends: 1032 [2023-11-29 00:42:12,095 INFO L226 Difference]: Without dead ends: 617 [2023-11-29 00:42:12,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:42:12,096 INFO L413 NwaCegarLoop]: 340 mSDtfsCounter, 370 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:42:12,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 674 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 00:42:12,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2023-11-29 00:42:12,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 617. [2023-11-29 00:42:12,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 606 states have (on average 1.504950495049505) internal successors, (912), 606 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-29 00:42:12,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 930 transitions. [2023-11-29 00:42:12,116 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 930 transitions. Word has length 321 [2023-11-29 00:42:12,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:42:12,117 INFO L495 AbstractCegarLoop]: Abstraction has 617 states and 930 transitions. [2023-11-29 00:42:12,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 66.5) internal successors, (266), 4 states have internal predecessors, (266), 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-29 00:42:12,117 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 930 transitions. [2023-11-29 00:42:12,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2023-11-29 00:42:12,119 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:42:12,119 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, 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-29 00:42:12,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-11-29 00:42:12,120 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:42:12,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:42:12,120 INFO L85 PathProgramCache]: Analyzing trace with hash -291763706, now seen corresponding path program 1 times [2023-11-29 00:42:12,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:42:12,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123818695] [2023-11-29 00:42:12,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:42:12,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:42:12,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:14,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 00:42:14,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:14,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 00:42:14,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:14,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 00:42:14,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:14,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2023-11-29 00:42:14,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:14,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2023-11-29 00:42:14,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:14,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2023-11-29 00:42:14,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:14,051 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-11-29 00:42:14,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:42:14,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123818695] [2023-11-29 00:42:14,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123818695] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:42:14,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:42:14,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 00:42:14,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167433036] [2023-11-29 00:42:14,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:42:14,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 00:42:14,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:42:14,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 00:42:14,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-29 00:42:14,054 INFO L87 Difference]: Start difference. First operand 617 states and 930 transitions. Second operand has 8 states, 8 states have (on average 29.875) internal successors, (239), 8 states have internal predecessors, (239), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 00:42:14,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:42:14,928 INFO L93 Difference]: Finished difference Result 1627 states and 2444 transitions. [2023-11-29 00:42:14,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 00:42:14,929 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 29.875) internal successors, (239), 8 states have internal predecessors, (239), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 321 [2023-11-29 00:42:14,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:42:14,935 INFO L225 Difference]: With dead ends: 1627 [2023-11-29 00:42:14,935 INFO L226 Difference]: Without dead ends: 1132 [2023-11-29 00:42:14,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2023-11-29 00:42:14,937 INFO L413 NwaCegarLoop]: 592 mSDtfsCounter, 1154 mSDsluCounter, 2156 mSDsCounter, 0 mSdLazyCounter, 1131 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1157 SdHoareTripleChecker+Valid, 2748 SdHoareTripleChecker+Invalid, 1138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 00:42:14,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1157 Valid, 2748 Invalid, 1138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1131 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 00:42:14,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2023-11-29 00:42:14,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 632. [2023-11-29 00:42:14,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 621 states have (on average 1.497584541062802) internal successors, (930), 621 states have internal predecessors, (930), 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-29 00:42:14,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 948 transitions. [2023-11-29 00:42:14,972 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 948 transitions. Word has length 321 [2023-11-29 00:42:14,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:42:14,973 INFO L495 AbstractCegarLoop]: Abstraction has 632 states and 948 transitions. [2023-11-29 00:42:14,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 29.875) internal successors, (239), 8 states have internal predecessors, (239), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 00:42:14,973 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 948 transitions. [2023-11-29 00:42:14,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2023-11-29 00:42:14,976 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:42:14,976 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, 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-29 00:42:14,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-11-29 00:42:14,976 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:42:14,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:42:14,977 INFO L85 PathProgramCache]: Analyzing trace with hash -750776958, now seen corresponding path program 1 times [2023-11-29 00:42:14,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:42:14,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401089557] [2023-11-29 00:42:14,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:42:14,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:42:15,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:16,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 00:42:16,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:16,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 00:42:16,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:16,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 00:42:16,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:16,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2023-11-29 00:42:16,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:16,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2023-11-29 00:42:16,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:16,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2023-11-29 00:42:16,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:16,554 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2023-11-29 00:42:16,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:42:16,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401089557] [2023-11-29 00:42:16,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401089557] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:42:16,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:42:16,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 00:42:16,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906723660] [2023-11-29 00:42:16,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:42:16,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 00:42:16,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:42:16,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 00:42:16,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-29 00:42:16,557 INFO L87 Difference]: Start difference. First operand 632 states and 948 transitions. Second operand has 8 states, 8 states have (on average 33.625) internal successors, (269), 8 states have internal predecessors, (269), 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-29 00:42:17,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:42:17,195 INFO L93 Difference]: Finished difference Result 1592 states and 2373 transitions. [2023-11-29 00:42:17,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 00:42:17,195 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 33.625) internal successors, (269), 8 states have internal predecessors, (269), 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 321 [2023-11-29 00:42:17,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:42:17,201 INFO L225 Difference]: With dead ends: 1592 [2023-11-29 00:42:17,201 INFO L226 Difference]: Without dead ends: 1178 [2023-11-29 00:42:17,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2023-11-29 00:42:17,203 INFO L413 NwaCegarLoop]: 366 mSDtfsCounter, 1738 mSDsluCounter, 1462 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1741 SdHoareTripleChecker+Valid, 1828 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 00:42:17,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1741 Valid, 1828 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 00:42:17,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2023-11-29 00:42:17,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 1171. [2023-11-29 00:42:17,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1171 states, 1151 states have (on average 1.4900086880973067) internal successors, (1715), 1151 states have internal predecessors, (1715), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-29 00:42:17,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 1171 states and 1751 transitions. [2023-11-29 00:42:17,259 INFO L78 Accepts]: Start accepts. Automaton has 1171 states and 1751 transitions. Word has length 321 [2023-11-29 00:42:17,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:42:17,259 INFO L495 AbstractCegarLoop]: Abstraction has 1171 states and 1751 transitions. [2023-11-29 00:42:17,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 33.625) internal successors, (269), 8 states have internal predecessors, (269), 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-29 00:42:17,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 1751 transitions. [2023-11-29 00:42:17,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2023-11-29 00:42:17,271 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:42:17,272 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, 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-29 00:42:17,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-11-29 00:42:17,272 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:42:17,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:42:17,273 INFO L85 PathProgramCache]: Analyzing trace with hash 610942206, now seen corresponding path program 1 times [2023-11-29 00:42:17,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:42:17,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465007503] [2023-11-29 00:42:17,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:42:17,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:42:18,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:18,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 00:42:18,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:18,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 00:42:18,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:18,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 00:42:18,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:18,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2023-11-29 00:42:18,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:18,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2023-11-29 00:42:18,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:18,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2023-11-29 00:42:18,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:18,832 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 72 proven. 4 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2023-11-29 00:42:18,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:42:18,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465007503] [2023-11-29 00:42:18,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465007503] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:42:18,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [373445996] [2023-11-29 00:42:18,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:42:18,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:42:18,834 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f766efd-ade0-4cbc-9675-a57b3c60abdc/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:42:18,840 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f766efd-ade0-4cbc-9675-a57b3c60abdc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:42:18,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f766efd-ade0-4cbc-9675-a57b3c60abdc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 00:42:19,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:19,305 INFO L262 TraceCheckSpWp]: Trace formula consists of 2077 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-29 00:42:19,323 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:42:19,654 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 65 proven. 29 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-11-29 00:42:19,655 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:42:19,774 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2023-11-29 00:42:19,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [373445996] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 00:42:19,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:42:19,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 10] total 17 [2023-11-29 00:42:19,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975467525] [2023-11-29 00:42:19,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:42:19,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:42:19,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:42:19,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:42:19,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2023-11-29 00:42:19,777 INFO L87 Difference]: Start difference. First operand 1171 states and 1751 transitions. Second operand has 6 states, 5 states have (on average 54.6) internal successors, (273), 6 states have internal predecessors, (273), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 00:42:19,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:42:19,875 INFO L93 Difference]: Finished difference Result 2126 states and 3176 transitions. [2023-11-29 00:42:19,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:42:19,875 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 54.6) internal successors, (273), 6 states have internal predecessors, (273), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 321 [2023-11-29 00:42:19,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:42:19,882 INFO L225 Difference]: With dead ends: 2126 [2023-11-29 00:42:19,883 INFO L226 Difference]: Without dead ends: 1171 [2023-11-29 00:42:19,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 645 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2023-11-29 00:42:19,885 INFO L413 NwaCegarLoop]: 451 mSDtfsCounter, 0 mSDsluCounter, 1791 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2242 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:42:19,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2242 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:42:19,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2023-11-29 00:42:19,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 1171. [2023-11-29 00:42:19,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1171 states, 1151 states have (on average 1.4847958297132928) internal successors, (1709), 1151 states have internal predecessors, (1709), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-29 00:42:19,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 1171 states and 1745 transitions. [2023-11-29 00:42:19,946 INFO L78 Accepts]: Start accepts. Automaton has 1171 states and 1745 transitions. Word has length 321 [2023-11-29 00:42:19,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:42:19,946 INFO L495 AbstractCegarLoop]: Abstraction has 1171 states and 1745 transitions. [2023-11-29 00:42:19,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 54.6) internal successors, (273), 6 states have internal predecessors, (273), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 00:42:19,947 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 1745 transitions. [2023-11-29 00:42:19,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2023-11-29 00:42:19,951 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:42:19,951 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, 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-29 00:42:19,965 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f766efd-ade0-4cbc-9675-a57b3c60abdc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 00:42:20,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f766efd-ade0-4cbc-9675-a57b3c60abdc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2023-11-29 00:42:20,155 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:42:20,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:42:20,155 INFO L85 PathProgramCache]: Analyzing trace with hash -148071410, now seen corresponding path program 1 times [2023-11-29 00:42:20,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:42:20,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555750111] [2023-11-29 00:42:20,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:42:20,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:42:21,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:21,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 00:42:21,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:21,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 00:42:21,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:21,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-29 00:42:21,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:21,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2023-11-29 00:42:21,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:21,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2023-11-29 00:42:21,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:21,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2023-11-29 00:42:21,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:21,894 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 73 proven. 4 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2023-11-29 00:42:21,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:42:21,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555750111] [2023-11-29 00:42:21,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555750111] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:42:21,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114626207] [2023-11-29 00:42:21,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:42:21,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:42:21,895 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f766efd-ade0-4cbc-9675-a57b3c60abdc/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:42:21,897 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f766efd-ade0-4cbc-9675-a57b3c60abdc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:42:21,901 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f766efd-ade0-4cbc-9675-a57b3c60abdc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 00:42:22,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:22,426 INFO L262 TraceCheckSpWp]: Trace formula consists of 2085 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 00:42:22,439 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:42:22,705 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-11-29 00:42:22,705 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:42:22,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2114626207] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:42:22,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 00:42:22,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2023-11-29 00:42:22,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744336425] [2023-11-29 00:42:22,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:42:22,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:42:22,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:42:22,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:42:22,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:42:22,708 INFO L87 Difference]: Start difference. First operand 1171 states and 1745 transitions. Second operand has 4 states, 4 states have (on average 68.5) internal successors, (274), 4 states have internal predecessors, (274), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-29 00:42:22,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:42:22,945 INFO L93 Difference]: Finished difference Result 1650 states and 2452 transitions. [2023-11-29 00:42:22,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:42:22,945 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 68.5) internal successors, (274), 4 states have internal predecessors, (274), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 323 [2023-11-29 00:42:22,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:42:22,949 INFO L225 Difference]: With dead ends: 1650 [2023-11-29 00:42:22,949 INFO L226 Difference]: Without dead ends: 635 [2023-11-29 00:42:22,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 00:42:22,951 INFO L413 NwaCegarLoop]: 332 mSDtfsCounter, 366 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:42:22,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 666 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 00:42:22,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2023-11-29 00:42:22,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 635. [2023-11-29 00:42:22,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 624 states have (on average 1.4855769230769231) internal successors, (927), 624 states have internal predecessors, (927), 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-29 00:42:22,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 945 transitions. [2023-11-29 00:42:22,973 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 945 transitions. Word has length 323 [2023-11-29 00:42:22,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:42:22,973 INFO L495 AbstractCegarLoop]: Abstraction has 635 states and 945 transitions. [2023-11-29 00:42:22,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.5) internal successors, (274), 4 states have internal predecessors, (274), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-29 00:42:22,973 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 945 transitions. [2023-11-29 00:42:22,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2023-11-29 00:42:22,975 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:42:22,976 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, 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-29 00:42:22,983 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f766efd-ade0-4cbc-9675-a57b3c60abdc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 00:42:23,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f766efd-ade0-4cbc-9675-a57b3c60abdc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2023-11-29 00:42:23,177 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:42:23,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:42:23,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1847704434, now seen corresponding path program 1 times [2023-11-29 00:42:23,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:42:23,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727412315] [2023-11-29 00:42:23,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:42:23,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:42:24,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:25,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 00:42:25,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:25,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 00:42:25,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:25,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-29 00:42:25,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:25,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2023-11-29 00:42:25,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:25,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2023-11-29 00:42:25,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:25,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2023-11-29 00:42:25,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:25,310 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-29 00:42:25,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:42:25,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727412315] [2023-11-29 00:42:25,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727412315] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:42:25,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:42:25,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 00:42:25,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259920428] [2023-11-29 00:42:25,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:42:25,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 00:42:25,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:42:25,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 00:42:25,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:42:25,314 INFO L87 Difference]: Start difference. First operand 635 states and 945 transitions. Second operand has 9 states, 9 states have (on average 28.77777777777778) internal successors, (259), 9 states have internal predecessors, (259), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-29 00:42:27,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:42:27,093 INFO L93 Difference]: Finished difference Result 1986 states and 2948 transitions. [2023-11-29 00:42:27,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 00:42:27,094 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 28.77777777777778) internal successors, (259), 9 states have internal predecessors, (259), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 323 [2023-11-29 00:42:27,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:42:27,100 INFO L225 Difference]: With dead ends: 1986 [2023-11-29 00:42:27,100 INFO L226 Difference]: Without dead ends: 1541 [2023-11-29 00:42:27,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2023-11-29 00:42:27,101 INFO L413 NwaCegarLoop]: 541 mSDtfsCounter, 2758 mSDsluCounter, 1790 mSDsCounter, 0 mSdLazyCounter, 1030 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2759 SdHoareTripleChecker+Valid, 2331 SdHoareTripleChecker+Invalid, 1042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-29 00:42:27,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2759 Valid, 2331 Invalid, 1042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1030 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-11-29 00:42:27,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1541 states. [2023-11-29 00:42:27,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1541 to 707. [2023-11-29 00:42:27,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 693 states have (on average 1.4891774891774892) internal successors, (1032), 693 states have internal predecessors, (1032), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-29 00:42:27,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 1056 transitions. [2023-11-29 00:42:27,137 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 1056 transitions. Word has length 323 [2023-11-29 00:42:27,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:42:27,137 INFO L495 AbstractCegarLoop]: Abstraction has 707 states and 1056 transitions. [2023-11-29 00:42:27,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 28.77777777777778) internal successors, (259), 9 states have internal predecessors, (259), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-29 00:42:27,138 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 1056 transitions. [2023-11-29 00:42:27,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2023-11-29 00:42:27,141 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:42:27,141 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, 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-29 00:42:27,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-11-29 00:42:27,142 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:42:27,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:42:27,142 INFO L85 PathProgramCache]: Analyzing trace with hash 705959442, now seen corresponding path program 1 times [2023-11-29 00:42:27,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:42:27,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306031757] [2023-11-29 00:42:27,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:42:27,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:42:27,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:28,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 00:42:28,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:28,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 00:42:28,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:28,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-29 00:42:28,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:28,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2023-11-29 00:42:28,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:28,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2023-11-29 00:42:28,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:28,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2023-11-29 00:42:28,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:28,652 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-11-29 00:42:28,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:42:28,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306031757] [2023-11-29 00:42:28,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306031757] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:42:28,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:42:28,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:42:28,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120681533] [2023-11-29 00:42:28,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:42:28,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:42:28,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:42:28,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:42:28,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:42:28,655 INFO L87 Difference]: Start difference. First operand 707 states and 1056 transitions. Second operand has 5 states, 5 states have (on average 59.0) internal successors, (295), 5 states have internal predecessors, (295), 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-29 00:42:28,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:42:28,772 INFO L93 Difference]: Finished difference Result 1613 states and 2385 transitions. [2023-11-29 00:42:28,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 00:42:28,773 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 59.0) internal successors, (295), 5 states have internal predecessors, (295), 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 325 [2023-11-29 00:42:28,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:42:28,779 INFO L225 Difference]: With dead ends: 1613 [2023-11-29 00:42:28,779 INFO L226 Difference]: Without dead ends: 1222 [2023-11-29 00:42:28,780 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-29 00:42:28,780 INFO L413 NwaCegarLoop]: 809 mSDtfsCounter, 725 mSDsluCounter, 1744 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 2553 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:42:28,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [725 Valid, 2553 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:42:28,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2023-11-29 00:42:28,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 803. [2023-11-29 00:42:28,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 789 states have (on average 1.4524714828897338) internal successors, (1146), 789 states have internal predecessors, (1146), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-29 00:42:28,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1170 transitions. [2023-11-29 00:42:28,829 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1170 transitions. Word has length 325 [2023-11-29 00:42:28,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:42:28,829 INFO L495 AbstractCegarLoop]: Abstraction has 803 states and 1170 transitions. [2023-11-29 00:42:28,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 59.0) internal successors, (295), 5 states have internal predecessors, (295), 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-29 00:42:28,830 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1170 transitions. [2023-11-29 00:42:28,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2023-11-29 00:42:28,833 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:42:28,833 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, 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-29 00:42:28,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2023-11-29 00:42:28,834 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:42:28,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:42:28,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1060305266, now seen corresponding path program 1 times [2023-11-29 00:42:28,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:42:28,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260495664] [2023-11-29 00:42:28,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:42:28,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:42:29,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:29,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 00:42:29,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:29,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 00:42:29,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:29,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-29 00:42:29,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:29,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2023-11-29 00:42:29,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:29,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2023-11-29 00:42:29,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:29,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2023-11-29 00:42:29,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:29,451 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2023-11-29 00:42:29,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:42:29,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260495664] [2023-11-29 00:42:29,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260495664] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:42:29,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:42:29,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:42:29,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82643828] [2023-11-29 00:42:29,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:42:29,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:42:29,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:42:29,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:42:29,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:42:29,454 INFO L87 Difference]: Start difference. First operand 803 states and 1170 transitions. Second operand has 5 states, 5 states have (on average 53.2) internal successors, (266), 5 states have internal predecessors, (266), 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-29 00:42:29,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:42:29,538 INFO L93 Difference]: Finished difference Result 1832 states and 2680 transitions. [2023-11-29 00:42:29,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 00:42:29,539 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 53.2) internal successors, (266), 5 states have internal predecessors, (266), 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 327 [2023-11-29 00:42:29,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:42:29,545 INFO L225 Difference]: With dead ends: 1832 [2023-11-29 00:42:29,545 INFO L226 Difference]: Without dead ends: 1341 [2023-11-29 00:42:29,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 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-29 00:42:29,547 INFO L413 NwaCegarLoop]: 534 mSDtfsCounter, 722 mSDsluCounter, 1453 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 1987 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:42:29,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 1987 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:42:29,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2023-11-29 00:42:29,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 869. [2023-11-29 00:42:29,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 855 states have (on average 1.4596491228070176) internal successors, (1248), 855 states have internal predecessors, (1248), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-29 00:42:29,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1272 transitions. [2023-11-29 00:42:29,581 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1272 transitions. Word has length 327 [2023-11-29 00:42:29,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:42:29,582 INFO L495 AbstractCegarLoop]: Abstraction has 869 states and 1272 transitions. [2023-11-29 00:42:29,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 53.2) internal successors, (266), 5 states have internal predecessors, (266), 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-29 00:42:29,582 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1272 transitions. [2023-11-29 00:42:29,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2023-11-29 00:42:29,584 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:42:29,584 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, 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-29 00:42:29,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2023-11-29 00:42:29,585 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:42:29,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:42:29,585 INFO L85 PathProgramCache]: Analyzing trace with hash -64243890, now seen corresponding path program 1 times [2023-11-29 00:42:29,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:42:29,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050064454] [2023-11-29 00:42:29,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:42:29,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:42:30,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:31,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 00:42:31,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:31,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 00:42:31,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:31,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-29 00:42:31,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:31,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2023-11-29 00:42:31,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:31,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2023-11-29 00:42:31,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:31,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2023-11-29 00:42:31,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:31,580 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-29 00:42:31,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:42:31,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050064454] [2023-11-29 00:42:31,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050064454] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:42:31,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:42:31,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 00:42:31,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641634012] [2023-11-29 00:42:31,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:42:31,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 00:42:31,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:42:31,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 00:42:31,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:42:31,582 INFO L87 Difference]: Start difference. First operand 869 states and 1272 transitions. Second operand has 9 states, 9 states have (on average 33.333333333333336) internal successors, (300), 9 states have internal predecessors, (300), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-29 00:42:32,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:42:32,857 INFO L93 Difference]: Finished difference Result 2948 states and 4275 transitions. [2023-11-29 00:42:32,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 00:42:32,857 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 33.333333333333336) internal successors, (300), 9 states have internal predecessors, (300), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 327 [2023-11-29 00:42:32,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:42:32,867 INFO L225 Difference]: With dead ends: 2948 [2023-11-29 00:42:32,868 INFO L226 Difference]: Without dead ends: 2532 [2023-11-29 00:42:32,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2023-11-29 00:42:32,869 INFO L413 NwaCegarLoop]: 534 mSDtfsCounter, 1701 mSDsluCounter, 2001 mSDsCounter, 0 mSdLazyCounter, 1083 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1702 SdHoareTripleChecker+Valid, 2535 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:42:32,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1702 Valid, 2535 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1083 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-29 00:42:32,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2532 states. [2023-11-29 00:42:32,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2532 to 1163. [2023-11-29 00:42:32,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1163 states, 1149 states have (on average 1.4247171453437772) internal successors, (1637), 1149 states have internal predecessors, (1637), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-29 00:42:32,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 1661 transitions. [2023-11-29 00:42:32,912 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 1661 transitions. Word has length 327 [2023-11-29 00:42:32,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:42:32,913 INFO L495 AbstractCegarLoop]: Abstraction has 1163 states and 1661 transitions. [2023-11-29 00:42:32,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 33.333333333333336) internal successors, (300), 9 states have internal predecessors, (300), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-29 00:42:32,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1661 transitions. [2023-11-29 00:42:32,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2023-11-29 00:42:32,915 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:42:32,916 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, 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, 1, 1, 1, 1, 1, 1] [2023-11-29 00:42:32,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2023-11-29 00:42:32,916 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:42:32,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:42:32,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1021181660, now seen corresponding path program 1 times [2023-11-29 00:42:32,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:42:32,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701624532] [2023-11-29 00:42:32,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:42:32,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:42:33,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:33,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 00:42:33,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:33,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 00:42:33,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:33,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 00:42:33,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:33,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2023-11-29 00:42:33,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:33,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2023-11-29 00:42:33,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:33,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2023-11-29 00:42:33,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:33,852 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2023-11-29 00:42:33,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:42:33,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701624532] [2023-11-29 00:42:33,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701624532] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:42:33,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:42:33,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:42:33,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811483699] [2023-11-29 00:42:33,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:42:33,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:42:33,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:42:33,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:42:33,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:42:33,854 INFO L87 Difference]: Start difference. First operand 1163 states and 1661 transitions. Second operand has 4 states, 4 states have (on average 62.25) internal successors, (249), 4 states have internal predecessors, (249), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 00:42:33,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:42:33,921 INFO L93 Difference]: Finished difference Result 2166 states and 3078 transitions. [2023-11-29 00:42:33,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:42:33,921 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.25) internal successors, (249), 4 states have internal predecessors, (249), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 327 [2023-11-29 00:42:33,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:42:33,926 INFO L225 Difference]: With dead ends: 2166 [2023-11-29 00:42:33,927 INFO L226 Difference]: Without dead ends: 1163 [2023-11-29 00:42:33,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:42:33,928 INFO L413 NwaCegarLoop]: 482 mSDtfsCounter, 746 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:42:33,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [746 Valid, 620 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:42:33,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2023-11-29 00:42:33,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 1163. [2023-11-29 00:42:33,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1163 states, 1149 states have (on average 1.4194952132288947) internal successors, (1631), 1149 states have internal predecessors, (1631), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-29 00:42:33,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 1655 transitions. [2023-11-29 00:42:33,965 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 1655 transitions. Word has length 327 [2023-11-29 00:42:33,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:42:33,965 INFO L495 AbstractCegarLoop]: Abstraction has 1163 states and 1655 transitions. [2023-11-29 00:42:33,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.25) internal successors, (249), 4 states have internal predecessors, (249), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 00:42:33,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1655 transitions. [2023-11-29 00:42:33,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2023-11-29 00:42:33,969 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:42:33,970 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, 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, 1, 1, 1, 1, 1, 1] [2023-11-29 00:42:33,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2023-11-29 00:42:33,970 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:42:33,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:42:33,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1108752802, now seen corresponding path program 1 times [2023-11-29 00:42:33,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:42:33,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993673313] [2023-11-29 00:42:33,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:42:33,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:42:35,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:36,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 00:42:36,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:36,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 00:42:36,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:36,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 00:42:36,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:36,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2023-11-29 00:42:36,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:36,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2023-11-29 00:42:36,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:36,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2023-11-29 00:42:36,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:36,711 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 4 proven. 77 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-29 00:42:36,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:42:36,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993673313] [2023-11-29 00:42:36,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993673313] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:42:36,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364669330] [2023-11-29 00:42:36,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:42:36,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:42:36,712 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f766efd-ade0-4cbc-9675-a57b3c60abdc/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:42:36,713 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f766efd-ade0-4cbc-9675-a57b3c60abdc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:42:36,714 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f766efd-ade0-4cbc-9675-a57b3c60abdc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 00:42:37,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:37,218 INFO L262 TraceCheckSpWp]: Trace formula consists of 2098 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-29 00:42:37,225 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:42:37,757 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-29 00:42:37,757 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:42:37,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [364669330] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:42:37,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 00:42:37,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2023-11-29 00:42:37,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873213871] [2023-11-29 00:42:37,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:42:37,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 00:42:37,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:42:37,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 00:42:37,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2023-11-29 00:42:37,760 INFO L87 Difference]: Start difference. First operand 1163 states and 1655 transitions. Second operand has 9 states, 9 states have (on average 33.333333333333336) internal successors, (300), 9 states have internal predecessors, (300), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-29 00:42:38,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:42:38,578 INFO L93 Difference]: Finished difference Result 3152 states and 4524 transitions. [2023-11-29 00:42:38,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 00:42:38,578 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 33.333333333333336) internal successors, (300), 9 states have internal predecessors, (300), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 327 [2023-11-29 00:42:38,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:42:38,585 INFO L225 Difference]: With dead ends: 3152 [2023-11-29 00:42:38,585 INFO L226 Difference]: Without dead ends: 2569 [2023-11-29 00:42:38,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2023-11-29 00:42:38,587 INFO L413 NwaCegarLoop]: 422 mSDtfsCounter, 1304 mSDsluCounter, 2219 mSDsCounter, 0 mSdLazyCounter, 1075 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1307 SdHoareTripleChecker+Valid, 2641 SdHoareTripleChecker+Invalid, 1078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 00:42:38,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1307 Valid, 2641 Invalid, 1078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1075 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 00:42:38,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2569 states. [2023-11-29 00:42:38,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2569 to 1681. [2023-11-29 00:42:38,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1681 states, 1659 states have (on average 1.3942133815551536) internal successors, (2313), 1659 states have internal predecessors, (2313), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-29 00:42:38,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1681 states to 1681 states and 2353 transitions. [2023-11-29 00:42:38,670 INFO L78 Accepts]: Start accepts. Automaton has 1681 states and 2353 transitions. Word has length 327 [2023-11-29 00:42:38,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:42:38,670 INFO L495 AbstractCegarLoop]: Abstraction has 1681 states and 2353 transitions. [2023-11-29 00:42:38,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 33.333333333333336) internal successors, (300), 9 states have internal predecessors, (300), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-29 00:42:38,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1681 states and 2353 transitions. [2023-11-29 00:42:38,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2023-11-29 00:42:38,676 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:42:38,676 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:42:38,686 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f766efd-ade0-4cbc-9675-a57b3c60abdc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 00:42:38,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f766efd-ade0-4cbc-9675-a57b3c60abdc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:42:38,877 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:42:38,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:42:38,877 INFO L85 PathProgramCache]: Analyzing trace with hash 2050270048, now seen corresponding path program 1 times [2023-11-29 00:42:38,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:42:38,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876724110] [2023-11-29 00:42:38,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:42:38,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:42:40,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:42,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 00:42:42,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:42,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 00:42:42,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:42,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 00:42:42,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:42,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2023-11-29 00:42:42,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:42,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2023-11-29 00:42:42,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:42,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2023-11-29 00:42:42,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:42,429 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2023-11-29 00:42:42,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:42:42,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876724110] [2023-11-29 00:42:42,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876724110] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:42:42,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:42:42,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 00:42:42,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633171396] [2023-11-29 00:42:42,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:42:42,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 00:42:42,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:42:42,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 00:42:42,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-29 00:42:42,431 INFO L87 Difference]: Start difference. First operand 1681 states and 2353 transitions. Second operand has 10 states, 10 states have (on average 26.0) internal successors, (260), 10 states have internal predecessors, (260), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-29 00:42:43,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:42:43,181 INFO L93 Difference]: Finished difference Result 3963 states and 5559 transitions. [2023-11-29 00:42:43,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 00:42:43,182 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 26.0) internal successors, (260), 10 states have internal predecessors, (260), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 327 [2023-11-29 00:42:43,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:42:43,186 INFO L225 Difference]: With dead ends: 3963 [2023-11-29 00:42:43,186 INFO L226 Difference]: Without dead ends: 3036 [2023-11-29 00:42:43,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2023-11-29 00:42:43,188 INFO L413 NwaCegarLoop]: 1043 mSDtfsCounter, 2529 mSDsluCounter, 4519 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2534 SdHoareTripleChecker+Valid, 5562 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 00:42:43,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2534 Valid, 5562 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 00:42:43,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3036 states. [2023-11-29 00:42:43,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3036 to 1779. [2023-11-29 00:42:43,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1779 states, 1751 states have (on average 1.3940605368360937) internal successors, (2441), 1751 states have internal predecessors, (2441), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2023-11-29 00:42:43,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1779 states to 1779 states and 2493 transitions. [2023-11-29 00:42:43,282 INFO L78 Accepts]: Start accepts. Automaton has 1779 states and 2493 transitions. Word has length 327 [2023-11-29 00:42:43,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:42:43,282 INFO L495 AbstractCegarLoop]: Abstraction has 1779 states and 2493 transitions. [2023-11-29 00:42:43,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 26.0) internal successors, (260), 10 states have internal predecessors, (260), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-29 00:42:43,283 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 2493 transitions. [2023-11-29 00:42:43,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2023-11-29 00:42:43,288 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:42:43,288 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 00:42:43,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2023-11-29 00:42:43,288 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:42:43,289 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:42:43,289 INFO L85 PathProgramCache]: Analyzing trace with hash 210390278, now seen corresponding path program 1 times [2023-11-29 00:42:43,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:42:43,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997477913] [2023-11-29 00:42:43,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:42:43,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:42:44,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:46,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 00:42:46,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:46,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 00:42:46,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:46,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 00:42:46,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:46,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2023-11-29 00:42:46,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:46,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2023-11-29 00:42:46,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:46,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2023-11-29 00:42:46,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:46,080 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 4 proven. 76 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-29 00:42:46,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:42:46,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997477913] [2023-11-29 00:42:46,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997477913] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:42:46,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881279800] [2023-11-29 00:42:46,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:42:46,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:42:46,081 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f766efd-ade0-4cbc-9675-a57b3c60abdc/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:42:46,082 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f766efd-ade0-4cbc-9675-a57b3c60abdc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:42:46,083 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f766efd-ade0-4cbc-9675-a57b3c60abdc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 00:42:46,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:46,441 INFO L262 TraceCheckSpWp]: Trace formula consists of 2099 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-29 00:42:46,447 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:42:46,730 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2023-11-29 00:42:46,730 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:42:46,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881279800] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:42:46,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 00:42:46,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2023-11-29 00:42:46,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958859248] [2023-11-29 00:42:46,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:42:46,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 00:42:46,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:42:46,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 00:42:46,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2023-11-29 00:42:46,732 INFO L87 Difference]: Start difference. First operand 1779 states and 2493 transitions. Second operand has 10 states, 9 states have (on average 28.11111111111111) internal successors, (253), 10 states have internal predecessors, (253), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2023-11-29 00:42:47,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:42:47,340 INFO L93 Difference]: Finished difference Result 4952 states and 6922 transitions. [2023-11-29 00:42:47,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 00:42:47,340 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 28.11111111111111) internal successors, (253), 10 states have internal predecessors, (253), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 327 [2023-11-29 00:42:47,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:42:47,346 INFO L225 Difference]: With dead ends: 4952 [2023-11-29 00:42:47,347 INFO L226 Difference]: Without dead ends: 3399 [2023-11-29 00:42:47,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2023-11-29 00:42:47,349 INFO L413 NwaCegarLoop]: 378 mSDtfsCounter, 1160 mSDsluCounter, 2207 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1167 SdHoareTripleChecker+Valid, 2585 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 00:42:47,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1167 Valid, 2585 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 00:42:47,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3399 states. [2023-11-29 00:42:47,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3399 to 1970. [2023-11-29 00:42:47,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1970 states, 1938 states have (on average 1.3993808049535603) internal successors, (2712), 1938 states have internal predecessors, (2712), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2023-11-29 00:42:47,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1970 states to 1970 states and 2772 transitions. [2023-11-29 00:42:47,453 INFO L78 Accepts]: Start accepts. Automaton has 1970 states and 2772 transitions. Word has length 327 [2023-11-29 00:42:47,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:42:47,453 INFO L495 AbstractCegarLoop]: Abstraction has 1970 states and 2772 transitions. [2023-11-29 00:42:47,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 28.11111111111111) internal successors, (253), 10 states have internal predecessors, (253), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2023-11-29 00:42:47,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1970 states and 2772 transitions. [2023-11-29 00:42:47,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2023-11-29 00:42:47,459 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:42:47,459 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 00:42:47,468 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f766efd-ade0-4cbc-9675-a57b3c60abdc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 00:42:47,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f766efd-ade0-4cbc-9675-a57b3c60abdc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2023-11-29 00:42:47,664 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:42:47,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:42:47,665 INFO L85 PathProgramCache]: Analyzing trace with hash -963384660, now seen corresponding path program 1 times [2023-11-29 00:42:47,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:42:47,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735011761] [2023-11-29 00:42:47,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:42:47,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:42:48,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:49,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 00:42:49,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:49,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 00:42:49,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:49,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 00:42:49,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:49,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2023-11-29 00:42:49,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:49,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2023-11-29 00:42:49,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:49,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2023-11-29 00:42:49,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:49,784 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2023-11-29 00:42:49,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:42:49,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735011761] [2023-11-29 00:42:49,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735011761] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:42:49,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:42:49,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 00:42:49,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640730545] [2023-11-29 00:42:49,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:42:49,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:42:49,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:42:49,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:42:49,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:42:49,786 INFO L87 Difference]: Start difference. First operand 1970 states and 2772 transitions. Second operand has 6 states, 6 states have (on average 39.5) internal successors, (237), 6 states have internal predecessors, (237), 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-29 00:42:49,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:42:49,976 INFO L93 Difference]: Finished difference Result 5357 states and 7508 transitions. [2023-11-29 00:42:49,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 00:42:49,976 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 39.5) internal successors, (237), 6 states have internal predecessors, (237), 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 327 [2023-11-29 00:42:49,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:42:49,981 INFO L225 Difference]: With dead ends: 5357 [2023-11-29 00:42:49,981 INFO L226 Difference]: Without dead ends: 3608 [2023-11-29 00:42:49,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2023-11-29 00:42:49,983 INFO L413 NwaCegarLoop]: 448 mSDtfsCounter, 2145 mSDsluCounter, 1227 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2148 SdHoareTripleChecker+Valid, 1675 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:42:49,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2148 Valid, 1675 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:42:49,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3608 states. [2023-11-29 00:42:50,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3608 to 1954. [2023-11-29 00:42:50,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1954 states, 1922 states have (on average 1.3943808532778357) internal successors, (2680), 1922 states have internal predecessors, (2680), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2023-11-29 00:42:50,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 1954 states and 2740 transitions. [2023-11-29 00:42:50,065 INFO L78 Accepts]: Start accepts. Automaton has 1954 states and 2740 transitions. Word has length 327 [2023-11-29 00:42:50,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:42:50,065 INFO L495 AbstractCegarLoop]: Abstraction has 1954 states and 2740 transitions. [2023-11-29 00:42:50,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.5) internal successors, (237), 6 states have internal predecessors, (237), 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-29 00:42:50,065 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 2740 transitions. [2023-11-29 00:42:50,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2023-11-29 00:42:50,069 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:42:50,070 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:42:50,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2023-11-29 00:42:50,070 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:42:50,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:42:50,070 INFO L85 PathProgramCache]: Analyzing trace with hash -82491294, now seen corresponding path program 1 times [2023-11-29 00:42:50,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:42:50,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378791615] [2023-11-29 00:42:50,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:42:50,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:42:51,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:51,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 00:42:51,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:51,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-29 00:42:51,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:51,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 00:42:51,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:51,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2023-11-29 00:42:51,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:52,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2023-11-29 00:42:52,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:52,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2023-11-29 00:42:52,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:52,003 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-29 00:42:52,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:42:52,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378791615] [2023-11-29 00:42:52,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378791615] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:42:52,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:42:52,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 00:42:52,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788808910] [2023-11-29 00:42:52,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:42:52,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:42:52,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:42:52,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:42:52,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:42:52,005 INFO L87 Difference]: Start difference. First operand 1954 states and 2740 transitions. Second operand has 6 states, 6 states have (on average 50.0) internal successors, (300), 6 states have internal predecessors, (300), 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-29 00:42:52,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:42:52,361 INFO L93 Difference]: Finished difference Result 2566 states and 3642 transitions. [2023-11-29 00:42:52,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:42:52,361 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 50.0) internal successors, (300), 6 states have internal predecessors, (300), 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 327 [2023-11-29 00:42:52,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:42:52,364 INFO L225 Difference]: With dead ends: 2566 [2023-11-29 00:42:52,364 INFO L226 Difference]: Without dead ends: 2121 [2023-11-29 00:42:52,365 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-29 00:42:52,365 INFO L413 NwaCegarLoop]: 332 mSDtfsCounter, 608 mSDsluCounter, 967 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 1299 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 00:42:52,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [611 Valid, 1299 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 00:42:52,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2121 states. [2023-11-29 00:42:52,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2121 to 1486. [2023-11-29 00:42:52,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1486 states, 1460 states have (on average 1.4123287671232876) internal successors, (2062), 1460 states have internal predecessors, (2062), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-29 00:42:52,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1486 states to 1486 states and 2110 transitions. [2023-11-29 00:42:52,422 INFO L78 Accepts]: Start accepts. Automaton has 1486 states and 2110 transitions. Word has length 327 [2023-11-29 00:42:52,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:42:52,423 INFO L495 AbstractCegarLoop]: Abstraction has 1486 states and 2110 transitions. [2023-11-29 00:42:52,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 50.0) internal successors, (300), 6 states have internal predecessors, (300), 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-29 00:42:52,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1486 states and 2110 transitions. [2023-11-29 00:42:52,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2023-11-29 00:42:52,425 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:42:52,425 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:42:52,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2023-11-29 00:42:52,426 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:42:52,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:42:52,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1598374596, now seen corresponding path program 1 times [2023-11-29 00:42:52,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:42:52,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377894374] [2023-11-29 00:42:52,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:42:52,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:42:52,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:53,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 00:42:53,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:53,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 00:42:53,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:53,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 00:42:53,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:53,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2023-11-29 00:42:53,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:53,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2023-11-29 00:42:53,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:53,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2023-11-29 00:42:53,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:53,285 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2023-11-29 00:42:53,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:42:53,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377894374] [2023-11-29 00:42:53,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377894374] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:42:53,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:42:53,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 00:42:53,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589811399] [2023-11-29 00:42:53,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:42:53,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:42:53,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:42:53,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:42:53,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:42:53,287 INFO L87 Difference]: Start difference. First operand 1486 states and 2110 transitions. Second operand has 6 states, 6 states have (on average 43.833333333333336) internal successors, (263), 6 states have internal predecessors, (263), 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-29 00:42:53,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:42:53,853 INFO L93 Difference]: Finished difference Result 3352 states and 4709 transitions. [2023-11-29 00:42:53,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:42:53,854 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 43.833333333333336) internal successors, (263), 6 states have internal predecessors, (263), 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 328 [2023-11-29 00:42:53,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:42:53,857 INFO L225 Difference]: With dead ends: 3352 [2023-11-29 00:42:53,857 INFO L226 Difference]: Without dead ends: 2449 [2023-11-29 00:42:53,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 00:42:53,859 INFO L413 NwaCegarLoop]: 596 mSDtfsCounter, 776 mSDsluCounter, 1499 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 779 SdHoareTripleChecker+Valid, 2095 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 00:42:53,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [779 Valid, 2095 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 00:42:53,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2449 states. [2023-11-29 00:42:53,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2449 to 1510. [2023-11-29 00:42:53,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1510 states, 1484 states have (on average 1.4056603773584906) internal successors, (2086), 1484 states have internal predecessors, (2086), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-29 00:42:53,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1510 states to 1510 states and 2134 transitions. [2023-11-29 00:42:53,916 INFO L78 Accepts]: Start accepts. Automaton has 1510 states and 2134 transitions. Word has length 328 [2023-11-29 00:42:53,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:42:53,917 INFO L495 AbstractCegarLoop]: Abstraction has 1510 states and 2134 transitions. [2023-11-29 00:42:53,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 43.833333333333336) internal successors, (263), 6 states have internal predecessors, (263), 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-29 00:42:53,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1510 states and 2134 transitions. [2023-11-29 00:42:53,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2023-11-29 00:42:53,919 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:42:53,919 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:42:53,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2023-11-29 00:42:53,920 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:42:53,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:42:53,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1256695682, now seen corresponding path program 1 times [2023-11-29 00:42:53,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:42:53,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381443460] [2023-11-29 00:42:53,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:42:53,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:42:55,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:56,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 00:42:56,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:56,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 00:42:56,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:56,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 00:42:56,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:56,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2023-11-29 00:42:56,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:56,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2023-11-29 00:42:56,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:56,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2023-11-29 00:42:56,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:56,994 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-29 00:42:56,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:42:56,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381443460] [2023-11-29 00:42:56,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381443460] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:42:56,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:42:56,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 00:42:56,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515070495] [2023-11-29 00:42:56,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:42:56,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 00:42:56,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:42:56,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 00:42:56,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 00:42:56,997 INFO L87 Difference]: Start difference. First operand 1510 states and 2134 transitions. Second operand has 8 states, 8 states have (on average 37.625) internal successors, (301), 8 states have internal predecessors, (301), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-29 00:42:57,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:42:57,919 INFO L93 Difference]: Finished difference Result 5170 states and 7289 transitions. [2023-11-29 00:42:57,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 00:42:57,920 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 37.625) internal successors, (301), 8 states have internal predecessors, (301), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 328 [2023-11-29 00:42:57,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:42:57,925 INFO L225 Difference]: With dead ends: 5170 [2023-11-29 00:42:57,926 INFO L226 Difference]: Without dead ends: 4702 [2023-11-29 00:42:57,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2023-11-29 00:42:57,927 INFO L413 NwaCegarLoop]: 1437 mSDtfsCounter, 2034 mSDsluCounter, 4077 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2036 SdHoareTripleChecker+Valid, 5514 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 00:42:57,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2036 Valid, 5514 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 00:42:57,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4702 states. [2023-11-29 00:42:58,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4702 to 2475. [2023-11-29 00:42:58,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2475 states, 2440 states have (on average 1.3959016393442623) internal successors, (3406), 2440 states have internal predecessors, (3406), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2023-11-29 00:42:58,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2475 states to 2475 states and 3472 transitions. [2023-11-29 00:42:58,021 INFO L78 Accepts]: Start accepts. Automaton has 2475 states and 3472 transitions. Word has length 328 [2023-11-29 00:42:58,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:42:58,021 INFO L495 AbstractCegarLoop]: Abstraction has 2475 states and 3472 transitions. [2023-11-29 00:42:58,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 37.625) internal successors, (301), 8 states have internal predecessors, (301), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-29 00:42:58,021 INFO L276 IsEmpty]: Start isEmpty. Operand 2475 states and 3472 transitions. [2023-11-29 00:42:58,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2023-11-29 00:42:58,025 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:42:58,025 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 00:42:58,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2023-11-29 00:42:58,025 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:42:58,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:42:58,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1834209446, now seen corresponding path program 1 times [2023-11-29 00:42:58,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:42:58,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229399029] [2023-11-29 00:42:58,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:42:58,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:42:59,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:00,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 00:43:00,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:00,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-29 00:43:00,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:00,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 00:43:00,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:00,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2023-11-29 00:43:00,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:00,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2023-11-29 00:43:00,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:00,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2023-11-29 00:43:00,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:00,658 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 4 proven. 77 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-29 00:43:00,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:43:00,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229399029] [2023-11-29 00:43:00,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229399029] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:43:00,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628742824] [2023-11-29 00:43:00,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:43:00,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:43:00,658 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f766efd-ade0-4cbc-9675-a57b3c60abdc/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:43:00,659 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f766efd-ade0-4cbc-9675-a57b3c60abdc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:43:00,660 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f766efd-ade0-4cbc-9675-a57b3c60abdc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 00:43:01,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:01,203 INFO L262 TraceCheckSpWp]: Trace formula consists of 2102 conjuncts, 92 conjunts are in the unsatisfiable core [2023-11-29 00:43:01,214 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:43:02,540 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 113 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-29 00:43:02,540 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:43:07,973 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 55 proven. 26 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-29 00:43:07,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628742824] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:43:07,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:43:07,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 23] total 45 [2023-11-29 00:43:07,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717043939] [2023-11-29 00:43:07,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:43:07,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-11-29 00:43:07,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:43:07,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-11-29 00:43:07,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=1755, Unknown=0, NotChecked=0, Total=1980 [2023-11-29 00:43:07,978 INFO L87 Difference]: Start difference. First operand 2475 states and 3472 transitions. Second operand has 45 states, 45 states have (on average 18.88888888888889) internal successors, (850), 45 states have internal predecessors, (850), 9 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 9 states have call predecessors, (18), 9 states have call successors, (18) [2023-11-29 00:43:37,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:43:37,985 INFO L93 Difference]: Finished difference Result 31991 states and 44807 transitions. [2023-11-29 00:43:37,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 238 states. [2023-11-29 00:43:37,985 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 18.88888888888889) internal successors, (850), 45 states have internal predecessors, (850), 9 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 9 states have call predecessors, (18), 9 states have call successors, (18) Word has length 328 [2023-11-29 00:43:37,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:43:38,016 INFO L225 Difference]: With dead ends: 31991 [2023-11-29 00:43:38,016 INFO L226 Difference]: Without dead ends: 30255 [2023-11-29 00:43:38,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 906 GetRequests, 633 SyntacticMatches, 0 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27554 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=8545, Invalid=66805, Unknown=0, NotChecked=0, Total=75350 [2023-11-29 00:43:38,035 INFO L413 NwaCegarLoop]: 1866 mSDtfsCounter, 41712 mSDsluCounter, 39600 mSDsCounter, 0 mSdLazyCounter, 21402 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41717 SdHoareTripleChecker+Valid, 41466 SdHoareTripleChecker+Invalid, 21564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 21402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.7s IncrementalHoareTripleChecker+Time [2023-11-29 00:43:38,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41717 Valid, 41466 Invalid, 21564 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [162 Valid, 21402 Invalid, 0 Unknown, 0 Unchecked, 14.7s Time] [2023-11-29 00:43:38,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30255 states. [2023-11-29 00:43:38,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30255 to 2537. [2023-11-29 00:43:38,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2537 states, 2502 states have (on average 1.3876898481215028) internal successors, (3472), 2502 states have internal predecessors, (3472), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2023-11-29 00:43:38,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2537 states to 2537 states and 3538 transitions. [2023-11-29 00:43:38,313 INFO L78 Accepts]: Start accepts. Automaton has 2537 states and 3538 transitions. Word has length 328 [2023-11-29 00:43:38,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:43:38,313 INFO L495 AbstractCegarLoop]: Abstraction has 2537 states and 3538 transitions. [2023-11-29 00:43:38,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 18.88888888888889) internal successors, (850), 45 states have internal predecessors, (850), 9 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 9 states have call predecessors, (18), 9 states have call successors, (18) [2023-11-29 00:43:38,314 INFO L276 IsEmpty]: Start isEmpty. Operand 2537 states and 3538 transitions. [2023-11-29 00:43:38,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2023-11-29 00:43:38,319 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:43:38,319 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 00:43:38,329 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f766efd-ade0-4cbc-9675-a57b3c60abdc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 00:43:38,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f766efd-ade0-4cbc-9675-a57b3c60abdc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2023-11-29 00:43:38,520 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:43:38,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:43:38,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1020930306, now seen corresponding path program 1 times [2023-11-29 00:43:38,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:43:38,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570104298] [2023-11-29 00:43:38,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:43:38,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:43:39,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:40,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 00:43:40,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:40,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-29 00:43:40,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:40,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 00:43:40,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:40,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2023-11-29 00:43:40,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:40,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2023-11-29 00:43:40,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:40,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2023-11-29 00:43:40,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:40,868 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 77 proven. 3 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-29 00:43:40,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:43:40,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570104298] [2023-11-29 00:43:40,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570104298] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:43:40,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664100341] [2023-11-29 00:43:40,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:43:40,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:43:40,869 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f766efd-ade0-4cbc-9675-a57b3c60abdc/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:43:40,869 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f766efd-ade0-4cbc-9675-a57b3c60abdc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:43:40,870 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f766efd-ade0-4cbc-9675-a57b3c60abdc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 00:43:41,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:41,270 INFO L262 TraceCheckSpWp]: Trace formula consists of 2103 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-29 00:43:41,276 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:43:41,488 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 113 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-29 00:43:41,488 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:43:41,573 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 83 proven. 6 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2023-11-29 00:43:41,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1664100341] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:43:41,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:43:41,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 6] total 19 [2023-11-29 00:43:41,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647312403] [2023-11-29 00:43:41,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:43:41,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 00:43:41,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:43:41,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 00:43:41,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2023-11-29 00:43:41,576 INFO L87 Difference]: Start difference. First operand 2537 states and 3538 transitions. Second operand has 19 states, 17 states have (on average 35.64705882352941) internal successors, (606), 19 states have internal predecessors, (606), 6 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 4 states have call predecessors, (16), 6 states have call successors, (16) [2023-11-29 00:43:43,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:43:43,583 INFO L93 Difference]: Finished difference Result 7160 states and 9917 transitions. [2023-11-29 00:43:43,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 00:43:43,583 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 35.64705882352941) internal successors, (606), 19 states have internal predecessors, (606), 6 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 4 states have call predecessors, (16), 6 states have call successors, (16) Word has length 328 [2023-11-29 00:43:43,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:43:43,589 INFO L225 Difference]: With dead ends: 7160 [2023-11-29 00:43:43,589 INFO L226 Difference]: Without dead ends: 4866 [2023-11-29 00:43:43,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 688 GetRequests, 660 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=156, Invalid=714, Unknown=0, NotChecked=0, Total=870 [2023-11-29 00:43:43,592 INFO L413 NwaCegarLoop]: 557 mSDtfsCounter, 1662 mSDsluCounter, 5866 mSDsCounter, 0 mSdLazyCounter, 2959 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1662 SdHoareTripleChecker+Valid, 6423 SdHoareTripleChecker+Invalid, 2968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-29 00:43:43,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1662 Valid, 6423 Invalid, 2968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2959 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-11-29 00:43:43,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4866 states. [2023-11-29 00:43:43,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4866 to 2537. [2023-11-29 00:43:43,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2537 states, 2502 states have (on average 1.3840927258193445) internal successors, (3463), 2502 states have internal predecessors, (3463), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2023-11-29 00:43:43,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2537 states to 2537 states and 3529 transitions. [2023-11-29 00:43:43,699 INFO L78 Accepts]: Start accepts. Automaton has 2537 states and 3529 transitions. Word has length 328 [2023-11-29 00:43:43,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:43:43,699 INFO L495 AbstractCegarLoop]: Abstraction has 2537 states and 3529 transitions. [2023-11-29 00:43:43,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 35.64705882352941) internal successors, (606), 19 states have internal predecessors, (606), 6 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 4 states have call predecessors, (16), 6 states have call successors, (16) [2023-11-29 00:43:43,700 INFO L276 IsEmpty]: Start isEmpty. Operand 2537 states and 3529 transitions. [2023-11-29 00:43:43,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2023-11-29 00:43:43,703 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:43:43,704 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 00:43:43,711 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f766efd-ade0-4cbc-9675-a57b3c60abdc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 00:43:43,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f766efd-ade0-4cbc-9675-a57b3c60abdc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2023-11-29 00:43:43,905 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:43:43,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:43:43,905 INFO L85 PathProgramCache]: Analyzing trace with hash 798638016, now seen corresponding path program 1 times [2023-11-29 00:43:43,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:43:43,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140641564] [2023-11-29 00:43:43,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:43:43,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:43:45,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:48,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 00:43:48,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:48,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-29 00:43:48,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:48,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 00:43:48,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:48,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2023-11-29 00:43:48,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:48,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2023-11-29 00:43:48,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:48,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2023-11-29 00:43:48,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:48,478 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 35 proven. 46 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-29 00:43:48,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:43:48,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140641564] [2023-11-29 00:43:48,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140641564] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:43:48,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444375073] [2023-11-29 00:43:48,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:43:48,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:43:48,479 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f766efd-ade0-4cbc-9675-a57b3c60abdc/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:43:48,479 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f766efd-ade0-4cbc-9675-a57b3c60abdc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:43:48,480 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f766efd-ade0-4cbc-9675-a57b3c60abdc/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 00:43:49,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:49,133 INFO L262 TraceCheckSpWp]: Trace formula consists of 2106 conjuncts, 153 conjunts are in the unsatisfiable core [2023-11-29 00:43:49,145 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:43:52,414 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-29 00:43:52,414 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:44:01,613 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 41 proven. 40 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-29 00:44:01,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444375073] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:44:01,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:44:01,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 37, 35] total 80 [2023-11-29 00:44:01,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410207834] [2023-11-29 00:44:01,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:44:01,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2023-11-29 00:44:01,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:44:01,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2023-11-29 00:44:01,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=675, Invalid=5645, Unknown=0, NotChecked=0, Total=6320 [2023-11-29 00:44:01,618 INFO L87 Difference]: Start difference. First operand 2537 states and 3529 transitions. Second operand has 80 states, 80 states have (on average 10.625) internal successors, (850), 80 states have internal predecessors, (850), 13 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 13 states have call predecessors, (18), 13 states have call successors, (18)