./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fb7c7f6-91b3-495d-884c-4d04562373b4/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fb7c7f6-91b3-495d-884c-4d04562373b4/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fb7c7f6-91b3-495d-884c-4d04562373b4/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fb7c7f6-91b3-495d-884c-4d04562373b4/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fb7c7f6-91b3-495d-884c-4d04562373b4/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fb7c7f6-91b3-495d-884c-4d04562373b4/bin/uautomizer-verify-aQ6SnzHsRB --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 32bit --witnessprinter.graph.data.programhash bd635b7902366e8a0b08b14a90a1f3949f04bf734a3e09a83f5077ced842f5da --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 04:55:56,289 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 04:55:56,370 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fb7c7f6-91b3-495d-884c-4d04562373b4/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-28 04:55:56,377 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 04:55:56,377 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 04:55:56,408 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 04:55:56,408 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 04:55:56,409 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 04:55:56,409 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 04:55:56,409 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 04:55:56,409 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 04:55:56,409 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 04:55:56,410 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 04:55:56,410 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 04:55:56,410 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 04:55:56,410 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 04:55:56,410 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 04:55:56,411 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 04:55:56,411 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 04:55:56,411 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 04:55:56,411 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 04:55:56,411 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 04:55:56,411 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 04:55:56,411 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 04:55:56,411 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 04:55:56,411 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 04:55:56,412 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 04:55:56,412 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 04:55:56,412 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 04:55:56,412 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 04:55:56,412 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 04:55:56,412 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 04:55:56,412 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:55:56,412 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 04:55:56,413 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 04:55:56,413 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 04:55:56,413 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 04:55:56,413 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:55:56,413 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 04:55:56,413 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 04:55:56,413 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 04:55:56,413 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 04:55:56,414 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 04:55:56,414 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 04:55:56,414 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 04:55:56,414 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 04:55:56,414 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 04:55:56,414 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 04:55:56,414 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_1fb7c7f6-91b3-495d-884c-4d04562373b4/bin/uautomizer-verify-aQ6SnzHsRB 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bd635b7902366e8a0b08b14a90a1f3949f04bf734a3e09a83f5077ced842f5da [2024-11-28 04:55:56,764 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 04:55:56,776 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 04:55:56,779 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 04:55:56,781 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 04:55:56,781 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 04:55:56,783 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fb7c7f6-91b3-495d-884c-4d04562373b4/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-2.i [2024-11-28 04:56:00,754 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fb7c7f6-91b3-495d-884c-4d04562373b4/bin/uautomizer-verify-aQ6SnzHsRB/data/a81347329/b80e251d9cc442f0957751f68ad5ad44/FLAGb6fcc4b38 [2024-11-28 04:56:01,346 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 04:56:01,347 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fb7c7f6-91b3-495d-884c-4d04562373b4/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-2.i [2024-11-28 04:56:01,383 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fb7c7f6-91b3-495d-884c-4d04562373b4/bin/uautomizer-verify-aQ6SnzHsRB/data/a81347329/b80e251d9cc442f0957751f68ad5ad44/FLAGb6fcc4b38 [2024-11-28 04:56:01,409 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fb7c7f6-91b3-495d-884c-4d04562373b4/bin/uautomizer-verify-aQ6SnzHsRB/data/a81347329/b80e251d9cc442f0957751f68ad5ad44 [2024-11-28 04:56:01,416 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 04:56:01,418 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 04:56:01,424 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 04:56:01,424 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 04:56:01,434 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 04:56:01,436 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:56:01" (1/1) ... [2024-11-28 04:56:01,438 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57880fdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:56:01, skipping insertion in model container [2024-11-28 04:56:01,439 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:56:01" (1/1) ... [2024-11-28 04:56:01,533 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 04:56:02,286 WARN L250 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_1fb7c7f6-91b3-495d-884c-4d04562373b4/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-2.i[44118,44131] [2024-11-28 04:56:02,302 WARN L250 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_1fb7c7f6-91b3-495d-884c-4d04562373b4/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-2.i[44660,44673] [2024-11-28 04:56:02,504 WARN L250 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_1fb7c7f6-91b3-495d-884c-4d04562373b4/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-2.i[56247,56260] [2024-11-28 04:56:02,505 WARN L250 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_1fb7c7f6-91b3-495d-884c-4d04562373b4/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-2.i[56368,56381] [2024-11-28 04:56:02,526 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 04:56:02,545 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 04:56:02,619 WARN L250 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_1fb7c7f6-91b3-495d-884c-4d04562373b4/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-2.i[44118,44131] [2024-11-28 04:56:02,623 WARN L250 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_1fb7c7f6-91b3-495d-884c-4d04562373b4/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-2.i[44660,44673] [2024-11-28 04:56:02,758 WARN L250 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_1fb7c7f6-91b3-495d-884c-4d04562373b4/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-2.i[56247,56260] [2024-11-28 04:56:02,759 WARN L250 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_1fb7c7f6-91b3-495d-884c-4d04562373b4/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-2.i[56368,56381] [2024-11-28 04:56:02,775 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 04:56:02,870 INFO L204 MainTranslator]: Completed translation [2024-11-28 04:56:02,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:56:02 WrapperNode [2024-11-28 04:56:02,871 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 04:56:02,873 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 04:56:02,874 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 04:56:02,874 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 04:56:02,887 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:56:02" (1/1) ... [2024-11-28 04:56:02,926 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:56:02" (1/1) ... [2024-11-28 04:56:03,071 INFO L138 Inliner]: procedures = 282, calls = 349, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1607 [2024-11-28 04:56:03,071 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 04:56:03,075 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 04:56:03,076 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 04:56:03,076 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 04:56:03,091 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:56:02" (1/1) ... [2024-11-28 04:56:03,092 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:56:02" (1/1) ... [2024-11-28 04:56:03,116 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:56:02" (1/1) ... [2024-11-28 04:56:03,293 INFO L175 MemorySlicer]: Split 318 memory accesses to 4 slices as follows [2, 34, 12, 270]. 85 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 0, 10, 0]. The 62 writes are split as follows [0, 4, 1, 57]. [2024-11-28 04:56:03,293 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:56:02" (1/1) ... [2024-11-28 04:56:03,293 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:56:02" (1/1) ... [2024-11-28 04:56:03,362 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:56:02" (1/1) ... [2024-11-28 04:56:03,369 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:56:02" (1/1) ... [2024-11-28 04:56:03,405 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:56:02" (1/1) ... [2024-11-28 04:56:03,419 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:56:02" (1/1) ... [2024-11-28 04:56:03,428 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:56:02" (1/1) ... [2024-11-28 04:56:03,454 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 04:56:03,455 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 04:56:03,456 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 04:56:03,456 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 04:56:03,457 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:56:02" (1/1) ... [2024-11-28 04:56:03,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:56:03,491 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fb7c7f6-91b3-495d-884c-4d04562373b4/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:56:03,510 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fb7c7f6-91b3-495d-884c-4d04562373b4/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 04:56:03,521 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fb7c7f6-91b3-495d-884c-4d04562373b4/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 04:56:03,561 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-28 04:56:03,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-28 04:56:03,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-28 04:56:03,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-28 04:56:03,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-28 04:56:03,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 04:56:03,562 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2024-11-28 04:56:03,562 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2024-11-28 04:56:03,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-28 04:56:03,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-28 04:56:03,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-28 04:56:03,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-28 04:56:03,562 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-28 04:56:03,563 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-28 04:56:03,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-28 04:56:03,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-28 04:56:03,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-28 04:56:03,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-28 04:56:03,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 04:56:03,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 04:56:03,563 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2024-11-28 04:56:03,563 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2024-11-28 04:56:03,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-28 04:56:03,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-28 04:56:03,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-28 04:56:03,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-28 04:56:03,564 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2024-11-28 04:56:03,564 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2024-11-28 04:56:03,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 04:56:03,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-28 04:56:03,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-28 04:56:03,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-28 04:56:03,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 04:56:03,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 04:56:03,945 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 04:56:03,948 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 04:56:06,476 INFO L? ?]: Removed 365 outVars from TransFormulas that were not future-live. [2024-11-28 04:56:06,476 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 04:56:06,511 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 04:56:06,512 INFO L312 CfgBuilder]: Removed 41 assume(true) statements. [2024-11-28 04:56:06,512 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:56:06 BoogieIcfgContainer [2024-11-28 04:56:06,513 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 04:56:06,519 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 04:56:06,519 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 04:56:06,528 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 04:56:06,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:56:01" (1/3) ... [2024-11-28 04:56:06,529 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aa5f9cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:56:06, skipping insertion in model container [2024-11-28 04:56:06,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:56:02" (2/3) ... [2024-11-28 04:56:06,530 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aa5f9cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:56:06, skipping insertion in model container [2024-11-28 04:56:06,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:56:06" (3/3) ... [2024-11-28 04:56:06,533 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test6-2.i [2024-11-28 04:56:06,555 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 04:56:06,556 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_OAT_test6-2.i that has 5 procedures, 478 locations, 1 initial locations, 41 loop locations, and 4 error locations. [2024-11-28 04:56:06,685 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 04:56:06,704 INFO L333 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, 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;@35bd756b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 04:56:06,705 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-28 04:56:06,715 INFO L276 IsEmpty]: Start isEmpty. Operand has 478 states, 454 states have (on average 1.592511013215859) internal successors, (723), 458 states have internal predecessors, (723), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-28 04:56:06,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-28 04:56:06,723 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:56:06,724 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:56:06,725 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-28 04:56:06,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:56:06,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1938186709, now seen corresponding path program 1 times [2024-11-28 04:56:06,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:56:06,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837024823] [2024-11-28 04:56:06,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:56:06,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:56:06,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:56:07,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:56:07,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:56:07,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837024823] [2024-11-28 04:56:07,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837024823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:56:07,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:56:07,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:56:07,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525814682] [2024-11-28 04:56:07,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:56:07,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-28 04:56:07,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:56:07,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-28 04:56:07,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 04:56:07,089 INFO L87 Difference]: Start difference. First operand has 478 states, 454 states have (on average 1.592511013215859) internal successors, (723), 458 states have internal predecessors, (723), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:56:07,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:56:07,226 INFO L93 Difference]: Finished difference Result 952 states and 1517 transitions. [2024-11-28 04:56:07,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-28 04:56:07,230 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-28 04:56:07,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:56:07,251 INFO L225 Difference]: With dead ends: 952 [2024-11-28 04:56:07,251 INFO L226 Difference]: Without dead ends: 472 [2024-11-28 04:56:07,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 04:56:07,265 INFO L435 NwaCegarLoop]: 672 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:56:07,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 04:56:07,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2024-11-28 04:56:07,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 472. [2024-11-28 04:56:07,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 449 states have (on average 1.4209354120267261) internal successors, (638), 453 states have internal predecessors, (638), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 04:56:07,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 668 transitions. [2024-11-28 04:56:07,390 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 668 transitions. Word has length 8 [2024-11-28 04:56:07,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:56:07,392 INFO L471 AbstractCegarLoop]: Abstraction has 472 states and 668 transitions. [2024-11-28 04:56:07,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:56:07,392 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 668 transitions. [2024-11-28 04:56:07,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-28 04:56:07,393 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:56:07,393 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:56:07,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 04:56:07,394 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-28 04:56:07,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:56:07,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1937955008, now seen corresponding path program 1 times [2024-11-28 04:56:07,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:56:07,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288352491] [2024-11-28 04:56:07,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:56:07,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:56:07,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:56:07,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:56:07,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:56:07,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288352491] [2024-11-28 04:56:07,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288352491] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:56:07,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:56:07,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 04:56:07,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808707128] [2024-11-28 04:56:07,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:56:07,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 04:56:07,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:56:07,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 04:56:07,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:56:07,860 INFO L87 Difference]: Start difference. First operand 472 states and 668 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:56:08,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:56:08,201 INFO L93 Difference]: Finished difference Result 1169 states and 1665 transitions. [2024-11-28 04:56:08,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 04:56:08,202 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-28 04:56:08,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:56:08,212 INFO L225 Difference]: With dead ends: 1169 [2024-11-28 04:56:08,212 INFO L226 Difference]: Without dead ends: 917 [2024-11-28 04:56:08,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:56:08,219 INFO L435 NwaCegarLoop]: 703 mSDtfsCounter, 611 mSDsluCounter, 1337 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 2040 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:56:08,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 2040 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 04:56:08,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2024-11-28 04:56:08,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 474. [2024-11-28 04:56:08,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 451 states have (on average 1.419068736141907) internal successors, (640), 455 states have internal predecessors, (640), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 04:56:08,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 670 transitions. [2024-11-28 04:56:08,285 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 670 transitions. Word has length 10 [2024-11-28 04:56:08,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:56:08,286 INFO L471 AbstractCegarLoop]: Abstraction has 474 states and 670 transitions. [2024-11-28 04:56:08,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:56:08,288 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 670 transitions. [2024-11-28 04:56:08,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-28 04:56:08,291 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:56:08,292 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:56:08,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 04:56:08,292 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-28 04:56:08,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:56:08,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1917721154, now seen corresponding path program 1 times [2024-11-28 04:56:08,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:56:08,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981519786] [2024-11-28 04:56:08,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:56:08,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:56:08,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:56:08,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:56:08,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:56:08,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981519786] [2024-11-28 04:56:08,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981519786] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:56:08,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:56:08,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 04:56:08,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235262101] [2024-11-28 04:56:08,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:56:08,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 04:56:08,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:56:08,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 04:56:08,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:56:08,872 INFO L87 Difference]: Start difference. First operand 474 states and 670 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:56:09,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:56:09,034 INFO L93 Difference]: Finished difference Result 901 states and 1269 transitions. [2024-11-28 04:56:09,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 04:56:09,034 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-28 04:56:09,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:56:09,039 INFO L225 Difference]: With dead ends: 901 [2024-11-28 04:56:09,043 INFO L226 Difference]: Without dead ends: 431 [2024-11-28 04:56:09,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:56:09,045 INFO L435 NwaCegarLoop]: 565 mSDtfsCounter, 30 mSDsluCounter, 1111 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1676 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:56:09,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1676 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:56:09,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2024-11-28 04:56:09,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 431. [2024-11-28 04:56:09,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 408 states have (on average 1.3774509803921569) internal successors, (562), 412 states have internal predecessors, (562), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 04:56:09,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 592 transitions. [2024-11-28 04:56:09,083 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 592 transitions. Word has length 67 [2024-11-28 04:56:09,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:56:09,083 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 592 transitions. [2024-11-28 04:56:09,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:56:09,084 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 592 transitions. [2024-11-28 04:56:09,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-28 04:56:09,085 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:56:09,085 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:56:09,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 04:56:09,086 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-28 04:56:09,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:56:09,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1732136014, now seen corresponding path program 1 times [2024-11-28 04:56:09,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:56:09,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777887893] [2024-11-28 04:56:09,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:56:09,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:56:09,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:56:09,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:56:09,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:56:09,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777887893] [2024-11-28 04:56:09,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777887893] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:56:09,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:56:09,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 04:56:09,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847017978] [2024-11-28 04:56:09,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:56:09,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 04:56:09,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:56:09,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 04:56:09,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:56:09,794 INFO L87 Difference]: Start difference. First operand 431 states and 592 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:56:10,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:56:10,391 INFO L93 Difference]: Finished difference Result 863 states and 1188 transitions. [2024-11-28 04:56:10,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 04:56:10,392 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-28 04:56:10,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:56:10,395 INFO L225 Difference]: With dead ends: 863 [2024-11-28 04:56:10,396 INFO L226 Difference]: Without dead ends: 436 [2024-11-28 04:56:10,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-28 04:56:10,397 INFO L435 NwaCegarLoop]: 569 mSDtfsCounter, 14 mSDsluCounter, 1979 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2548 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-28 04:56:10,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2548 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-28 04:56:10,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2024-11-28 04:56:10,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 433. [2024-11-28 04:56:10,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 410 states have (on average 1.3756097560975609) internal successors, (564), 414 states have internal predecessors, (564), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 04:56:10,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 594 transitions. [2024-11-28 04:56:10,456 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 594 transitions. Word has length 67 [2024-11-28 04:56:10,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:56:10,457 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 594 transitions. [2024-11-28 04:56:10,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:56:10,457 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 594 transitions. [2024-11-28 04:56:10,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-28 04:56:10,462 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:56:10,463 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:56:10,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 04:56:10,463 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-28 04:56:10,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:56:10,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1162689855, now seen corresponding path program 1 times [2024-11-28 04:56:10,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:56:10,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54033860] [2024-11-28 04:56:10,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:56:10,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:56:10,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:56:10,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:56:10,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:56:10,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54033860] [2024-11-28 04:56:10,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54033860] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:56:10,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:56:10,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 04:56:10,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80822315] [2024-11-28 04:56:10,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:56:10,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 04:56:10,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:56:10,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 04:56:10,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-28 04:56:10,980 INFO L87 Difference]: Start difference. First operand 433 states and 594 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:56:11,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:56:11,538 INFO L93 Difference]: Finished difference Result 867 states and 1192 transitions. [2024-11-28 04:56:11,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 04:56:11,539 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-11-28 04:56:11,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:56:11,542 INFO L225 Difference]: With dead ends: 867 [2024-11-28 04:56:11,542 INFO L226 Difference]: Without dead ends: 438 [2024-11-28 04:56:11,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-28 04:56:11,545 INFO L435 NwaCegarLoop]: 563 mSDtfsCounter, 15 mSDsluCounter, 2495 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 3058 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-28 04:56:11,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 3058 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-28 04:56:11,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2024-11-28 04:56:11,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 437. [2024-11-28 04:56:11,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 414 states have (on average 1.3743961352657006) internal successors, (569), 418 states have internal predecessors, (569), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 04:56:11,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 599 transitions. [2024-11-28 04:56:11,567 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 599 transitions. Word has length 68 [2024-11-28 04:56:11,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:56:11,572 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 599 transitions. [2024-11-28 04:56:11,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:56:11,573 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 599 transitions. [2024-11-28 04:56:11,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-28 04:56:11,577 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:56:11,577 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:56:11,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 04:56:11,577 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-28 04:56:11,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:56:11,578 INFO L85 PathProgramCache]: Analyzing trace with hash 671915861, now seen corresponding path program 1 times [2024-11-28 04:56:11,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:56:11,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123138956] [2024-11-28 04:56:11,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:56:11,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:56:11,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:56:12,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:56:12,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:56:12,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123138956] [2024-11-28 04:56:12,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123138956] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:56:12,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:56:12,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 04:56:12,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792835711] [2024-11-28 04:56:12,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:56:12,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 04:56:12,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:56:12,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 04:56:12,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:56:12,051 INFO L87 Difference]: Start difference. First operand 437 states and 599 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:56:12,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:56:12,236 INFO L93 Difference]: Finished difference Result 870 states and 1194 transitions. [2024-11-28 04:56:12,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 04:56:12,237 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-11-28 04:56:12,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:56:12,241 INFO L225 Difference]: With dead ends: 870 [2024-11-28 04:56:12,242 INFO L226 Difference]: Without dead ends: 437 [2024-11-28 04:56:12,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:56:12,245 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 17 mSDsluCounter, 1019 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1593 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:56:12,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1593 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 04:56:12,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2024-11-28 04:56:12,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437. [2024-11-28 04:56:12,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 414 states have (on average 1.3719806763285025) internal successors, (568), 418 states have internal predecessors, (568), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 04:56:12,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 598 transitions. [2024-11-28 04:56:12,282 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 598 transitions. Word has length 68 [2024-11-28 04:56:12,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:56:12,283 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 598 transitions. [2024-11-28 04:56:12,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:56:12,284 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 598 transitions. [2024-11-28 04:56:12,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-28 04:56:12,285 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:56:12,285 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:56:12,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 04:56:12,286 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-28 04:56:12,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:56:12,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1163109374, now seen corresponding path program 1 times [2024-11-28 04:56:12,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:56:12,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703527085] [2024-11-28 04:56:12,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:56:12,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:56:12,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:56:12,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:56:12,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:56:12,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703527085] [2024-11-28 04:56:12,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703527085] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:56:12,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:56:12,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-28 04:56:12,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785465656] [2024-11-28 04:56:12,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:56:12,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 04:56:12,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:56:12,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 04:56:12,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-28 04:56:12,954 INFO L87 Difference]: Start difference. First operand 437 states and 598 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:56:13,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:56:13,897 INFO L93 Difference]: Finished difference Result 883 states and 1213 transitions. [2024-11-28 04:56:13,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 04:56:13,898 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-28 04:56:13,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:56:13,902 INFO L225 Difference]: With dead ends: 883 [2024-11-28 04:56:13,902 INFO L226 Difference]: Without dead ends: 450 [2024-11-28 04:56:13,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-28 04:56:13,906 INFO L435 NwaCegarLoop]: 564 mSDtfsCounter, 34 mSDsluCounter, 3561 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 4125 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-28 04:56:13,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 4125 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-28 04:56:13,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2024-11-28 04:56:13,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 447. [2024-11-28 04:56:13,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 424 states have (on average 1.3726415094339623) internal successors, (582), 428 states have internal predecessors, (582), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 04:56:13,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 612 transitions. [2024-11-28 04:56:13,944 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 612 transitions. Word has length 69 [2024-11-28 04:56:13,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:56:13,947 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 612 transitions. [2024-11-28 04:56:13,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:56:13,947 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 612 transitions. [2024-11-28 04:56:13,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-28 04:56:13,948 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:56:13,948 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:56:13,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 04:56:13,949 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-28 04:56:13,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:56:13,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1519186921, now seen corresponding path program 1 times [2024-11-28 04:56:13,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:56:13,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999540261] [2024-11-28 04:56:13,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:56:13,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:56:14,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:56:14,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:56:14,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:56:14,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999540261] [2024-11-28 04:56:14,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999540261] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:56:14,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:56:14,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 04:56:14,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568503060] [2024-11-28 04:56:14,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:56:14,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 04:56:14,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:56:14,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 04:56:14,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-28 04:56:14,805 INFO L87 Difference]: Start difference. First operand 447 states and 612 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:56:15,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:56:15,615 INFO L93 Difference]: Finished difference Result 893 states and 1225 transitions. [2024-11-28 04:56:15,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 04:56:15,618 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-28 04:56:15,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:56:15,622 INFO L225 Difference]: With dead ends: 893 [2024-11-28 04:56:15,622 INFO L226 Difference]: Without dead ends: 450 [2024-11-28 04:56:15,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-28 04:56:15,627 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 27 mSDsluCounter, 3044 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 3612 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-28 04:56:15,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 3612 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-28 04:56:15,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2024-11-28 04:56:15,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450. [2024-11-28 04:56:15,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 427 states have (on average 1.370023419203747) internal successors, (585), 431 states have internal predecessors, (585), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 04:56:15,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 615 transitions. [2024-11-28 04:56:15,653 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 615 transitions. Word has length 69 [2024-11-28 04:56:15,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:56:15,654 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 615 transitions. [2024-11-28 04:56:15,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:56:15,654 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 615 transitions. [2024-11-28 04:56:15,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-28 04:56:15,655 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:56:15,655 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:56:15,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 04:56:15,657 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-28 04:56:15,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:56:15,657 INFO L85 PathProgramCache]: Analyzing trace with hash -357887657, now seen corresponding path program 1 times [2024-11-28 04:56:15,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:56:15,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917477610] [2024-11-28 04:56:15,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:56:15,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:56:15,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:56:16,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:56:16,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:56:16,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917477610] [2024-11-28 04:56:16,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917477610] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:56:16,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:56:16,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 04:56:16,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376767251] [2024-11-28 04:56:16,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:56:16,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 04:56:16,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:56:16,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 04:56:16,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:56:16,064 INFO L87 Difference]: Start difference. First operand 450 states and 615 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:56:16,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:56:16,526 INFO L93 Difference]: Finished difference Result 899 states and 1231 transitions. [2024-11-28 04:56:16,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 04:56:16,527 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-28 04:56:16,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:56:16,530 INFO L225 Difference]: With dead ends: 899 [2024-11-28 04:56:16,530 INFO L226 Difference]: Without dead ends: 453 [2024-11-28 04:56:16,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:56:16,532 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 8 mSDsluCounter, 1996 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2570 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 04:56:16,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2570 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 04:56:16,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2024-11-28 04:56:16,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 453. [2024-11-28 04:56:16,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 430 states have (on average 1.3674418604651162) internal successors, (588), 434 states have internal predecessors, (588), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 04:56:16,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 618 transitions. [2024-11-28 04:56:16,554 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 618 transitions. Word has length 69 [2024-11-28 04:56:16,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:56:16,554 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 618 transitions. [2024-11-28 04:56:16,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:56:16,555 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 618 transitions. [2024-11-28 04:56:16,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-28 04:56:16,556 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:56:16,556 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:56:16,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 04:56:16,556 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-28 04:56:16,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:56:16,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1901356284, now seen corresponding path program 1 times [2024-11-28 04:56:16,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:56:16,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449152825] [2024-11-28 04:56:16,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:56:16,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:56:16,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:56:17,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:56:17,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:56:17,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449152825] [2024-11-28 04:56:17,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449152825] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:56:17,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:56:17,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-28 04:56:17,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355077654] [2024-11-28 04:56:17,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:56:17,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 04:56:17,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:56:17,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 04:56:17,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-28 04:56:17,565 INFO L87 Difference]: Start difference. First operand 453 states and 618 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:56:19,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:56:19,185 INFO L93 Difference]: Finished difference Result 1323 states and 1814 transitions. [2024-11-28 04:56:19,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 04:56:19,186 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-11-28 04:56:19,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:56:19,193 INFO L225 Difference]: With dead ends: 1323 [2024-11-28 04:56:19,193 INFO L226 Difference]: Without dead ends: 874 [2024-11-28 04:56:19,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-11-28 04:56:19,195 INFO L435 NwaCegarLoop]: 609 mSDtfsCounter, 692 mSDsluCounter, 2632 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 3241 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-28 04:56:19,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 3241 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-28 04:56:19,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2024-11-28 04:56:19,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 492. [2024-11-28 04:56:19,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 469 states have (on average 1.3454157782515992) internal successors, (631), 473 states have internal predecessors, (631), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 04:56:19,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 661 transitions. [2024-11-28 04:56:19,230 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 661 transitions. Word has length 70 [2024-11-28 04:56:19,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:56:19,231 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 661 transitions. [2024-11-28 04:56:19,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:56:19,232 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 661 transitions. [2024-11-28 04:56:19,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-28 04:56:19,232 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:56:19,233 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:56:19,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 04:56:19,233 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-28 04:56:19,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:56:19,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1164625832, now seen corresponding path program 1 times [2024-11-28 04:56:19,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:56:19,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243809160] [2024-11-28 04:56:19,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:56:19,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:56:19,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:56:19,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:56:19,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:56:19,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243809160] [2024-11-28 04:56:19,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243809160] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:56:19,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:56:19,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 04:56:19,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129233973] [2024-11-28 04:56:19,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:56:19,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 04:56:19,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:56:19,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 04:56:19,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-28 04:56:19,650 INFO L87 Difference]: Start difference. First operand 492 states and 661 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:56:20,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:56:20,321 INFO L93 Difference]: Finished difference Result 946 states and 1283 transitions. [2024-11-28 04:56:20,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 04:56:20,322 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-11-28 04:56:20,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:56:20,326 INFO L225 Difference]: With dead ends: 946 [2024-11-28 04:56:20,327 INFO L226 Difference]: Without dead ends: 497 [2024-11-28 04:56:20,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-28 04:56:20,329 INFO L435 NwaCegarLoop]: 569 mSDtfsCounter, 13 mSDsluCounter, 2495 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 3064 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 04:56:20,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 3064 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 04:56:20,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2024-11-28 04:56:20,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 492. [2024-11-28 04:56:20,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 469 states have (on average 1.3454157782515992) internal successors, (631), 473 states have internal predecessors, (631), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 04:56:20,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 661 transitions. [2024-11-28 04:56:20,362 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 661 transitions. Word has length 70 [2024-11-28 04:56:20,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:56:20,362 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 661 transitions. [2024-11-28 04:56:20,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:56:20,363 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 661 transitions. [2024-11-28 04:56:20,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-28 04:56:20,364 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:56:20,364 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:56:20,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 04:56:20,364 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-28 04:56:20,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:56:20,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1034146717, now seen corresponding path program 1 times [2024-11-28 04:56:20,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:56:20,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812794855] [2024-11-28 04:56:20,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:56:20,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:56:20,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:56:20,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:56:20,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:56:20,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812794855] [2024-11-28 04:56:20,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812794855] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:56:20,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:56:20,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-28 04:56:20,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803070810] [2024-11-28 04:56:20,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:56:20,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 04:56:20,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:56:20,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 04:56:20,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-28 04:56:20,804 INFO L87 Difference]: Start difference. First operand 492 states and 661 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:56:21,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:56:21,379 INFO L93 Difference]: Finished difference Result 951 states and 1289 transitions. [2024-11-28 04:56:21,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 04:56:21,380 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-11-28 04:56:21,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:56:21,384 INFO L225 Difference]: With dead ends: 951 [2024-11-28 04:56:21,385 INFO L226 Difference]: Without dead ends: 502 [2024-11-28 04:56:21,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-28 04:56:21,387 INFO L435 NwaCegarLoop]: 563 mSDtfsCounter, 20 mSDsluCounter, 3075 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 3638 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-28 04:56:21,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 3638 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-28 04:56:21,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2024-11-28 04:56:21,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 495. [2024-11-28 04:56:21,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 472 states have (on average 1.3453389830508475) internal successors, (635), 476 states have internal predecessors, (635), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 04:56:21,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 665 transitions. [2024-11-28 04:56:21,440 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 665 transitions. Word has length 71 [2024-11-28 04:56:21,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:56:21,441 INFO L471 AbstractCegarLoop]: Abstraction has 495 states and 665 transitions. [2024-11-28 04:56:21,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:56:21,442 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 665 transitions. [2024-11-28 04:56:21,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-28 04:56:21,442 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:56:21,443 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:56:21,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 04:56:21,443 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-28 04:56:21,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:56:21,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1103094087, now seen corresponding path program 1 times [2024-11-28 04:56:21,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:56:21,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509061803] [2024-11-28 04:56:21,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:56:21,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:56:21,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:56:22,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:56:22,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:56:22,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509061803] [2024-11-28 04:56:22,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509061803] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:56:22,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:56:22,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-28 04:56:22,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188088709] [2024-11-28 04:56:22,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:56:22,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 04:56:22,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:56:22,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 04:56:22,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-28 04:56:22,014 INFO L87 Difference]: Start difference. First operand 495 states and 665 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:56:22,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:56:22,969 INFO L93 Difference]: Finished difference Result 969 states and 1309 transitions. [2024-11-28 04:56:22,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 04:56:22,970 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-11-28 04:56:22,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:56:22,974 INFO L225 Difference]: With dead ends: 969 [2024-11-28 04:56:22,974 INFO L226 Difference]: Without dead ends: 517 [2024-11-28 04:56:22,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-28 04:56:22,976 INFO L435 NwaCegarLoop]: 575 mSDtfsCounter, 38 mSDsluCounter, 3527 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 4102 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-28 04:56:22,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 4102 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-28 04:56:22,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2024-11-28 04:56:23,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 495. [2024-11-28 04:56:23,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 472 states have (on average 1.3453389830508475) internal successors, (635), 476 states have internal predecessors, (635), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 04:56:23,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 665 transitions. [2024-11-28 04:56:23,008 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 665 transitions. Word has length 71 [2024-11-28 04:56:23,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:56:23,009 INFO L471 AbstractCegarLoop]: Abstraction has 495 states and 665 transitions. [2024-11-28 04:56:23,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:56:23,010 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 665 transitions. [2024-11-28 04:56:23,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-28 04:56:23,011 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:56:23,013 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:56:23,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 04:56:23,013 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-28 04:56:23,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:56:23,014 INFO L85 PathProgramCache]: Analyzing trace with hash 747644936, now seen corresponding path program 1 times [2024-11-28 04:56:23,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:56:23,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882741137] [2024-11-28 04:56:23,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:56:23,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:56:23,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:56:23,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:56:23,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:56:23,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882741137] [2024-11-28 04:56:23,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882741137] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:56:23,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:56:23,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 04:56:23,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647155771] [2024-11-28 04:56:23,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:56:23,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 04:56:23,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:56:23,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 04:56:23,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-28 04:56:23,667 INFO L87 Difference]: Start difference. First operand 495 states and 665 transitions. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:56:24,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:56:24,499 INFO L93 Difference]: Finished difference Result 963 states and 1306 transitions. [2024-11-28 04:56:24,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 04:56:24,501 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-11-28 04:56:24,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:56:24,504 INFO L225 Difference]: With dead ends: 963 [2024-11-28 04:56:24,505 INFO L226 Difference]: Without dead ends: 511 [2024-11-28 04:56:24,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-28 04:56:24,507 INFO L435 NwaCegarLoop]: 570 mSDtfsCounter, 23 mSDsluCounter, 3576 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 4146 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-28 04:56:24,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 4146 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-28 04:56:24,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2024-11-28 04:56:24,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 505. [2024-11-28 04:56:24,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 482 states have (on average 1.342323651452282) internal successors, (647), 486 states have internal predecessors, (647), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 04:56:24,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 677 transitions. [2024-11-28 04:56:24,536 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 677 transitions. Word has length 72 [2024-11-28 04:56:24,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:56:24,536 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 677 transitions. [2024-11-28 04:56:24,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:56:24,537 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 677 transitions. [2024-11-28 04:56:24,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-28 04:56:24,538 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:56:24,538 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:56:24,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-28 04:56:24,538 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-28 04:56:24,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:56:24,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1717366876, now seen corresponding path program 1 times [2024-11-28 04:56:24,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:56:24,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379601098] [2024-11-28 04:56:24,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:56:24,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:56:24,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:56:25,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:56:25,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:56:25,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379601098] [2024-11-28 04:56:25,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379601098] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:56:25,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:56:25,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 04:56:25,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353820050] [2024-11-28 04:56:25,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:56:25,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 04:56:25,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:56:25,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 04:56:25,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-28 04:56:25,069 INFO L87 Difference]: Start difference. First operand 505 states and 677 transitions. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:56:25,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:56:25,886 INFO L93 Difference]: Finished difference Result 983 states and 1330 transitions. [2024-11-28 04:56:25,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 04:56:25,887 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-11-28 04:56:25,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:56:25,891 INFO L225 Difference]: With dead ends: 983 [2024-11-28 04:56:25,891 INFO L226 Difference]: Without dead ends: 521 [2024-11-28 04:56:25,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-28 04:56:25,895 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 17 mSDsluCounter, 4044 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4600 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-28 04:56:25,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4600 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-28 04:56:25,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2024-11-28 04:56:25,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 508. [2024-11-28 04:56:25,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 485 states have (on average 1.3422680412371133) internal successors, (651), 489 states have internal predecessors, (651), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 04:56:25,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 681 transitions. [2024-11-28 04:56:25,930 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 681 transitions. Word has length 72 [2024-11-28 04:56:25,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:56:25,931 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 681 transitions. [2024-11-28 04:56:25,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:56:25,931 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 681 transitions. [2024-11-28 04:56:25,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-28 04:56:25,932 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:56:25,932 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:56:25,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-28 04:56:25,933 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-28 04:56:25,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:56:25,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1079547684, now seen corresponding path program 1 times [2024-11-28 04:56:25,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:56:25,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46101190] [2024-11-28 04:56:25,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:56:25,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:56:26,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:56:26,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:56:26,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:56:26,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46101190] [2024-11-28 04:56:26,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46101190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:56:26,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:56:26,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 04:56:26,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369389845] [2024-11-28 04:56:26,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:56:26,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 04:56:26,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:56:26,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 04:56:26,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-28 04:56:26,409 INFO L87 Difference]: Start difference. First operand 508 states and 681 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:56:26,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:56:26,940 INFO L93 Difference]: Finished difference Result 978 states and 1320 transitions. [2024-11-28 04:56:26,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 04:56:26,943 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-11-28 04:56:26,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:56:26,947 INFO L225 Difference]: With dead ends: 978 [2024-11-28 04:56:26,947 INFO L226 Difference]: Without dead ends: 513 [2024-11-28 04:56:26,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-28 04:56:26,949 INFO L435 NwaCegarLoop]: 564 mSDtfsCounter, 11 mSDsluCounter, 2524 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 3088 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-28 04:56:26,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 3088 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-28 04:56:26,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2024-11-28 04:56:26,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 508. [2024-11-28 04:56:26,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 485 states have (on average 1.3402061855670102) internal successors, (650), 489 states have internal predecessors, (650), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 04:56:26,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 680 transitions. [2024-11-28 04:56:26,981 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 680 transitions. Word has length 72 [2024-11-28 04:56:26,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:56:26,982 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 680 transitions. [2024-11-28 04:56:26,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:56:26,982 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 680 transitions. [2024-11-28 04:56:26,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-28 04:56:26,984 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:56:26,985 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:56:26,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-28 04:56:26,985 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-28 04:56:26,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:56:26,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1602748611, now seen corresponding path program 1 times [2024-11-28 04:56:26,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:56:26,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435633631] [2024-11-28 04:56:26,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:56:26,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:56:27,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:56:27,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:56:27,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:56:27,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435633631] [2024-11-28 04:56:27,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435633631] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:56:27,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:56:27,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 04:56:27,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847374065] [2024-11-28 04:56:27,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:56:27,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 04:56:27,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:56:27,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 04:56:27,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-28 04:56:27,438 INFO L87 Difference]: Start difference. First operand 508 states and 680 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:56:28,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:56:28,076 INFO L93 Difference]: Finished difference Result 976 states and 1318 transitions. [2024-11-28 04:56:28,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 04:56:28,077 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-11-28 04:56:28,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:56:28,081 INFO L225 Difference]: With dead ends: 976 [2024-11-28 04:56:28,081 INFO L226 Difference]: Without dead ends: 511 [2024-11-28 04:56:28,083 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-28 04:56:28,084 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 8 mSDsluCounter, 2479 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3047 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 04:56:28,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3047 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 04:56:28,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2024-11-28 04:56:28,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 511. [2024-11-28 04:56:28,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 488 states have (on average 1.3381147540983607) internal successors, (653), 492 states have internal predecessors, (653), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 04:56:28,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 683 transitions. [2024-11-28 04:56:28,124 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 683 transitions. Word has length 72 [2024-11-28 04:56:28,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:56:28,124 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 683 transitions. [2024-11-28 04:56:28,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:56:28,125 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 683 transitions. [2024-11-28 04:56:28,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-28 04:56:28,130 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:56:28,130 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:56:28,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-28 04:56:28,131 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-28 04:56:28,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:56:28,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1348607590, now seen corresponding path program 1 times [2024-11-28 04:56:28,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:56:28,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725068482] [2024-11-28 04:56:28,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:56:28,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:56:28,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:56:28,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:56:28,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:56:28,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725068482] [2024-11-28 04:56:28,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725068482] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:56:28,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:56:28,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 04:56:28,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562712578] [2024-11-28 04:56:28,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:56:28,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 04:56:28,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:56:28,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 04:56:28,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-28 04:56:28,893 INFO L87 Difference]: Start difference. First operand 511 states and 683 transitions. Second operand has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:56:30,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:56:30,367 INFO L93 Difference]: Finished difference Result 991 states and 1337 transitions. [2024-11-28 04:56:30,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 04:56:30,368 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-11-28 04:56:30,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:56:30,372 INFO L225 Difference]: With dead ends: 991 [2024-11-28 04:56:30,372 INFO L226 Difference]: Without dead ends: 523 [2024-11-28 04:56:30,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-28 04:56:30,374 INFO L435 NwaCegarLoop]: 567 mSDtfsCounter, 13 mSDsluCounter, 3539 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 4106 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-28 04:56:30,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 4106 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-28 04:56:30,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2024-11-28 04:56:30,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 515. [2024-11-28 04:56:30,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 492 states have (on average 1.3373983739837398) internal successors, (658), 496 states have internal predecessors, (658), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 04:56:30,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 688 transitions. [2024-11-28 04:56:30,404 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 688 transitions. Word has length 73 [2024-11-28 04:56:30,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:56:30,404 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 688 transitions. [2024-11-28 04:56:30,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:56:30,405 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 688 transitions. [2024-11-28 04:56:30,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-28 04:56:30,406 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:56:30,407 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:56:30,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-28 04:56:30,407 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-28 04:56:30,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:56:30,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1017786029, now seen corresponding path program 1 times [2024-11-28 04:56:30,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:56:30,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292547534] [2024-11-28 04:56:30,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:56:30,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:56:30,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:56:30,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:56:30,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:56:30,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292547534] [2024-11-28 04:56:30,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292547534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:56:30,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:56:30,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-28 04:56:30,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589436109] [2024-11-28 04:56:30,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:56:30,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 04:56:30,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:56:30,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 04:56:30,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-28 04:56:30,917 INFO L87 Difference]: Start difference. First operand 515 states and 688 transitions. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:56:31,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:56:31,878 INFO L93 Difference]: Finished difference Result 1000 states and 1347 transitions. [2024-11-28 04:56:31,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 04:56:31,879 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-11-28 04:56:31,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:56:31,883 INFO L225 Difference]: With dead ends: 1000 [2024-11-28 04:56:31,883 INFO L226 Difference]: Without dead ends: 528 [2024-11-28 04:56:31,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-28 04:56:31,886 INFO L435 NwaCegarLoop]: 564 mSDtfsCounter, 26 mSDsluCounter, 4594 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 5158 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-28 04:56:31,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 5158 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-28 04:56:31,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2024-11-28 04:56:31,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 518. [2024-11-28 04:56:31,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 495 states have (on average 1.3353535353535353) internal successors, (661), 499 states have internal predecessors, (661), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 04:56:31,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 691 transitions. [2024-11-28 04:56:31,932 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 691 transitions. Word has length 73 [2024-11-28 04:56:31,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:56:31,932 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 691 transitions. [2024-11-28 04:56:31,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:56:31,933 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 691 transitions. [2024-11-28 04:56:31,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-28 04:56:31,934 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:56:31,934 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:56:31,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-28 04:56:31,934 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-28 04:56:31,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:56:31,937 INFO L85 PathProgramCache]: Analyzing trace with hash -2052314550, now seen corresponding path program 1 times [2024-11-28 04:56:31,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:56:31,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4893651] [2024-11-28 04:56:31,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:56:31,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:56:32,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:56:32,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:56:32,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:56:32,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4893651] [2024-11-28 04:56:32,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4893651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:56:32,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:56:32,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 04:56:32,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819190901] [2024-11-28 04:56:32,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:56:32,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 04:56:32,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:56:32,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 04:56:32,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-28 04:56:32,721 INFO L87 Difference]: Start difference. First operand 518 states and 691 transitions. Second operand has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:56:37,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 04:56:38,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:56:38,316 INFO L93 Difference]: Finished difference Result 1009 states and 1353 transitions. [2024-11-28 04:56:38,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 04:56:38,318 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-11-28 04:56:38,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:56:38,322 INFO L225 Difference]: With dead ends: 1009 [2024-11-28 04:56:38,322 INFO L226 Difference]: Without dead ends: 534 [2024-11-28 04:56:38,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-11-28 04:56:38,324 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 43 mSDsluCounter, 4006 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 4574 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-11-28 04:56:38,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 4574 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 700 Invalid, 1 Unknown, 0 Unchecked, 5.3s Time] [2024-11-28 04:56:38,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2024-11-28 04:56:38,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 519. [2024-11-28 04:56:38,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 496 states have (on average 1.3346774193548387) internal successors, (662), 500 states have internal predecessors, (662), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 04:56:38,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 692 transitions. [2024-11-28 04:56:38,352 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 692 transitions. Word has length 73 [2024-11-28 04:56:38,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:56:38,353 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 692 transitions. [2024-11-28 04:56:38,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:56:38,353 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 692 transitions. [2024-11-28 04:56:38,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-28 04:56:38,354 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:56:38,354 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:56:38,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-28 04:56:38,355 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-28 04:56:38,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:56:38,356 INFO L85 PathProgramCache]: Analyzing trace with hash -196801378, now seen corresponding path program 1 times [2024-11-28 04:56:38,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:56:38,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122055592] [2024-11-28 04:56:38,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:56:38,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:56:38,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:56:52,297 WARN L286 SmtUtils]: Spent 5.17s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-28 04:57:05,243 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* (div |c_ULTIMATE.start_main_~_hj_j~0#1| 4294967296) 524288)) (.cse0 (div |c_ULTIMATE.start_main_~_hj_j~0#1| 8192))) (and (= .cse0 (+ .cse1 |c_ULTIMATE.start_main_~_ha_hashv~0#1|)) (<= 4408680405129836981 (+ (* 1030789530 |c_ULTIMATE.start_main_~_ha_hashv~0#1|) (* |c_ULTIMATE.start_main_~_hj_j~0#1| 2061579059) (* (div (+ (* (- 4123158118) |c_ULTIMATE.start_main_~_hj_j~0#1|) 8817360810260198248 .cse1 (* (- 2061579059) |c_ULTIMATE.start_main_~_ha_hashv~0#1|) (* (- 1) .cse0)) 4294967296) 2147483648))))) is different from false [2024-11-28 04:57:05,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:57:05,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:57:05,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122055592] [2024-11-28 04:57:05,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122055592] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:57:05,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:57:05,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-28 04:57:05,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526908721] [2024-11-28 04:57:05,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:57:05,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 04:57:05,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:57:05,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 04:57:05,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=72, Unknown=1, NotChecked=16, Total=110 [2024-11-28 04:57:05,353 INFO L87 Difference]: Start difference. First operand 519 states and 692 transitions. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:57:09,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 04:57:13,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 04:57:17,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 04:57:21,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 04:57:25,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 04:57:29,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 04:57:33,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 04:57:37,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 04:58:19,600 WARN L286 SmtUtils]: Spent 12.16s on a formula simplification. DAG size of input: 45 DAG size of output: 29 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-28 04:58:23,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 04:58:27,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 04:58:33,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 04:58:37,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 04:58:41,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 04:58:45,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 04:58:49,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 04:58:53,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 04:58:57,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 04:59:01,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 04:59:05,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 04:59:09,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 04:59:13,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 04:59:17,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 04:59:21,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 04:59:25,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 04:59:29,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 04:59:33,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 04:59:37,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 04:59:41,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 04:59:45,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 04:59:49,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 04:59:53,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 04:59:57,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:00:31,894 WARN L286 SmtUtils]: Spent 22.01s on a formula simplification. DAG size of input: 42 DAG size of output: 41 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-28 05:00:35,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:00:39,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:00:43,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:00:47,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:00:51,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:00:55,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:00:59,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:01:04,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:01:08,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:01:12,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:01:16,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:01:17,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:01:21,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:01:25,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:01:26,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:01:26,569 INFO L93 Difference]: Finished difference Result 1022 states and 1379 transitions. [2024-11-28 05:01:26,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 05:01:26,570 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-11-28 05:01:26,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:01:26,574 INFO L225 Difference]: With dead ends: 1022 [2024-11-28 05:01:26,574 INFO L226 Difference]: Without dead ends: 546 [2024-11-28 05:01:26,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 85.5s TimeCoverageRelationStatistics Valid=28, Invalid=97, Unknown=11, NotChecked=20, Total=156 [2024-11-28 05:01:26,578 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 52 mSDsluCounter, 3525 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 3 mSolverCounterUnsat, 44 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 184.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 4093 SdHoareTripleChecker+Invalid, 873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 44 IncrementalHoareTripleChecker+Unknown, 147 IncrementalHoareTripleChecker+Unchecked, 185.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:01:26,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 4093 Invalid, 873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 679 Invalid, 44 Unknown, 147 Unchecked, 185.0s Time] [2024-11-28 05:01:26,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2024-11-28 05:01:26,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 525. [2024-11-28 05:01:26,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 502 states have (on average 1.3346613545816732) internal successors, (670), 506 states have internal predecessors, (670), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 05:01:26,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 700 transitions. [2024-11-28 05:01:26,604 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 700 transitions. Word has length 73 [2024-11-28 05:01:26,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:01:26,604 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 700 transitions. [2024-11-28 05:01:26,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:01:26,605 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 700 transitions. [2024-11-28 05:01:26,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-28 05:01:26,606 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:01:26,606 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:01:26,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-28 05:01:26,606 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-28 05:01:26,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:01:26,607 INFO L85 PathProgramCache]: Analyzing trace with hash 406189826, now seen corresponding path program 1 times [2024-11-28 05:01:26,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:01:26,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935275461] [2024-11-28 05:01:26,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:01:26,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:01:26,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:01:27,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:01:27,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:01:27,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935275461] [2024-11-28 05:01:27,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935275461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:01:27,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:01:27,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-28 05:01:27,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410699835] [2024-11-28 05:01:27,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:01:27,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 05:01:27,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:01:27,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 05:01:27,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-28 05:01:27,011 INFO L87 Difference]: Start difference. First operand 525 states and 700 transitions. Second operand has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:01:27,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:01:27,880 INFO L93 Difference]: Finished difference Result 1028 states and 1378 transitions. [2024-11-28 05:01:27,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 05:01:27,885 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-11-28 05:01:27,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:01:27,889 INFO L225 Difference]: With dead ends: 1028 [2024-11-28 05:01:27,891 INFO L226 Difference]: Without dead ends: 546 [2024-11-28 05:01:27,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-28 05:01:27,896 INFO L435 NwaCegarLoop]: 575 mSDtfsCounter, 34 mSDsluCounter, 3527 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 4102 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-28 05:01:27,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 4102 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-28 05:01:27,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2024-11-28 05:01:27,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 522. [2024-11-28 05:01:27,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 499 states have (on average 1.3366733466933867) internal successors, (667), 503 states have internal predecessors, (667), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 05:01:27,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 697 transitions. [2024-11-28 05:01:27,925 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 697 transitions. Word has length 73 [2024-11-28 05:01:27,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:01:27,926 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 697 transitions. [2024-11-28 05:01:27,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:01:27,926 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 697 transitions. [2024-11-28 05:01:27,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-28 05:01:27,927 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:01:27,927 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:01:27,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-28 05:01:27,928 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-28 05:01:27,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:01:27,929 INFO L85 PathProgramCache]: Analyzing trace with hash -461858095, now seen corresponding path program 1 times [2024-11-28 05:01:27,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:01:27,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313474325] [2024-11-28 05:01:27,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:01:27,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:01:28,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:01:28,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:01:28,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:01:28,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313474325] [2024-11-28 05:01:28,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313474325] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:01:28,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:01:28,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-28 05:01:28,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450947070] [2024-11-28 05:01:28,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:01:28,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 05:01:28,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:01:28,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 05:01:28,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-28 05:01:28,511 INFO L87 Difference]: Start difference. First operand 522 states and 697 transitions. Second operand has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:01:29,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:01:29,642 INFO L93 Difference]: Finished difference Result 1013 states and 1365 transitions. [2024-11-28 05:01:29,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 05:01:29,643 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2024-11-28 05:01:29,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:01:29,646 INFO L225 Difference]: With dead ends: 1013 [2024-11-28 05:01:29,646 INFO L226 Difference]: Without dead ends: 534 [2024-11-28 05:01:29,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-11-28 05:01:29,649 INFO L435 NwaCegarLoop]: 567 mSDtfsCounter, 16 mSDsluCounter, 4562 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 5129 SdHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:01:29,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 5129 Invalid, 866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-28 05:01:29,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2024-11-28 05:01:29,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 529. [2024-11-28 05:01:29,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 506 states have (on average 1.3359683794466404) internal successors, (676), 510 states have internal predecessors, (676), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 05:01:29,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 706 transitions. [2024-11-28 05:01:29,680 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 706 transitions. Word has length 74 [2024-11-28 05:01:29,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:01:29,681 INFO L471 AbstractCegarLoop]: Abstraction has 529 states and 706 transitions. [2024-11-28 05:01:29,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:01:29,681 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 706 transitions. [2024-11-28 05:01:29,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-28 05:01:29,682 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:01:29,682 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:01:29,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-28 05:01:29,683 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-28 05:01:29,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:01:29,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1123238857, now seen corresponding path program 1 times [2024-11-28 05:01:29,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:01:29,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024308958] [2024-11-28 05:01:29,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:01:29,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:01:29,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:01:30,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:01:30,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:01:30,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024308958] [2024-11-28 05:01:30,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024308958] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:01:30,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:01:30,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-28 05:01:30,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484194651] [2024-11-28 05:01:30,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:01:30,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 05:01:30,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:01:30,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 05:01:30,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-28 05:01:30,150 INFO L87 Difference]: Start difference. First operand 529 states and 706 transitions. Second operand has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 states have internal predecessors, (72), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:01:31,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:01:31,008 INFO L93 Difference]: Finished difference Result 1020 states and 1373 transitions. [2024-11-28 05:01:31,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 05:01:31,009 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 states have internal predecessors, (72), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2024-11-28 05:01:31,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:01:31,012 INFO L225 Difference]: With dead ends: 1020 [2024-11-28 05:01:31,013 INFO L226 Difference]: Without dead ends: 534 [2024-11-28 05:01:31,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-28 05:01:31,015 INFO L435 NwaCegarLoop]: 571 mSDtfsCounter, 24 mSDsluCounter, 3585 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 4156 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-28 05:01:31,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 4156 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-28 05:01:31,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2024-11-28 05:01:31,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 526. [2024-11-28 05:01:31,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 503 states have (on average 1.3359840954274353) internal successors, (672), 507 states have internal predecessors, (672), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 05:01:31,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 702 transitions. [2024-11-28 05:01:31,058 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 702 transitions. Word has length 74 [2024-11-28 05:01:31,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:01:31,058 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 702 transitions. [2024-11-28 05:01:31,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 states have internal predecessors, (72), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:01:31,059 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 702 transitions. [2024-11-28 05:01:31,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-28 05:01:31,060 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:01:31,060 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:01:31,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-28 05:01:31,061 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-28 05:01:31,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:01:31,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1421328295, now seen corresponding path program 1 times [2024-11-28 05:01:31,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:01:31,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56749443] [2024-11-28 05:01:31,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:01:31,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:01:31,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:01:31,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:01:31,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:01:31,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56749443] [2024-11-28 05:01:31,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56749443] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:01:31,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:01:31,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 05:01:31,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456585090] [2024-11-28 05:01:31,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:01:31,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 05:01:31,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:01:31,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 05:01:31,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-28 05:01:31,438 INFO L87 Difference]: Start difference. First operand 526 states and 702 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:01:31,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:01:31,996 INFO L93 Difference]: Finished difference Result 1010 states and 1358 transitions. [2024-11-28 05:01:31,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 05:01:31,997 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2024-11-28 05:01:31,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:01:32,001 INFO L225 Difference]: With dead ends: 1010 [2024-11-28 05:01:32,002 INFO L226 Difference]: Without dead ends: 527 [2024-11-28 05:01:32,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-28 05:01:32,004 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 53 mSDsluCounter, 2565 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 3139 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-28 05:01:32,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 3139 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-28 05:01:32,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2024-11-28 05:01:32,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 523. [2024-11-28 05:01:32,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 500 states have (on average 1.336) internal successors, (668), 504 states have internal predecessors, (668), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 05:01:32,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 698 transitions. [2024-11-28 05:01:32,037 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 698 transitions. Word has length 74 [2024-11-28 05:01:32,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:01:32,038 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 698 transitions. [2024-11-28 05:01:32,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:01:32,039 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 698 transitions. [2024-11-28 05:01:32,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-28 05:01:32,040 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:01:32,040 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:01:32,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-28 05:01:32,040 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-28 05:01:32,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:01:32,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1089395943, now seen corresponding path program 1 times [2024-11-28 05:01:32,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:01:32,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687177152] [2024-11-28 05:01:32,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:01:32,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:01:32,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:01:32,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:01:32,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:01:32,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687177152] [2024-11-28 05:01:32,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687177152] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:01:32,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:01:32,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-28 05:01:32,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035975022] [2024-11-28 05:01:32,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:01:32,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 05:01:32,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:01:32,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 05:01:32,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-28 05:01:32,632 INFO L87 Difference]: Start difference. First operand 523 states and 698 transitions. Second operand has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:01:33,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:01:33,742 INFO L93 Difference]: Finished difference Result 1019 states and 1374 transitions. [2024-11-28 05:01:33,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 05:01:33,743 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2024-11-28 05:01:33,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:01:33,745 INFO L225 Difference]: With dead ends: 1019 [2024-11-28 05:01:33,746 INFO L226 Difference]: Without dead ends: 539 [2024-11-28 05:01:33,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-28 05:01:33,748 INFO L435 NwaCegarLoop]: 550 mSDtfsCounter, 18 mSDsluCounter, 5019 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 5569 SdHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:01:33,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 5569 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-28 05:01:33,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2024-11-28 05:01:33,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 524. [2024-11-28 05:01:33,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 501 states have (on average 1.3353293413173652) internal successors, (669), 505 states have internal predecessors, (669), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 05:01:33,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 699 transitions. [2024-11-28 05:01:33,771 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 699 transitions. Word has length 74 [2024-11-28 05:01:33,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:01:33,771 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 699 transitions. [2024-11-28 05:01:33,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:01:33,772 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 699 transitions. [2024-11-28 05:01:33,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-28 05:01:33,772 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:01:33,773 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:01:33,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-28 05:01:33,773 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-28 05:01:33,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:01:33,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1971731707, now seen corresponding path program 1 times [2024-11-28 05:01:33,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:01:33,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549716492] [2024-11-28 05:01:33,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:01:33,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:01:33,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:01:34,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:01:34,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:01:34,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549716492] [2024-11-28 05:01:34,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549716492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:01:34,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:01:34,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-28 05:01:34,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043753084] [2024-11-28 05:01:34,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:01:34,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-28 05:01:34,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:01:34,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-28 05:01:34,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2024-11-28 05:01:34,587 INFO L87 Difference]: Start difference. First operand 524 states and 699 transitions. Second operand has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:01:35,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:01:35,599 INFO L93 Difference]: Finished difference Result 1037 states and 1394 transitions. [2024-11-28 05:01:35,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 05:01:35,600 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2024-11-28 05:01:35,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:01:35,603 INFO L225 Difference]: With dead ends: 1037 [2024-11-28 05:01:35,603 INFO L226 Difference]: Without dead ends: 556 [2024-11-28 05:01:35,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2024-11-28 05:01:35,604 INFO L435 NwaCegarLoop]: 559 mSDtfsCounter, 47 mSDsluCounter, 5570 mSDsCounter, 0 mSdLazyCounter, 1052 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 6129 SdHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-28 05:01:35,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 6129 Invalid, 1053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1052 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-28 05:01:35,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2024-11-28 05:01:35,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 533. [2024-11-28 05:01:35,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 510 states have (on average 1.3352941176470587) internal successors, (681), 514 states have internal predecessors, (681), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 05:01:35,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 711 transitions. [2024-11-28 05:01:35,623 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 711 transitions. Word has length 74 [2024-11-28 05:01:35,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:01:35,623 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 711 transitions. [2024-11-28 05:01:35,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:01:35,624 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 711 transitions. [2024-11-28 05:01:35,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-28 05:01:35,626 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:01:35,626 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:01:35,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-28 05:01:35,626 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-28 05:01:35,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:01:35,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1124895847, now seen corresponding path program 1 times [2024-11-28 05:01:35,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:01:35,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185941560] [2024-11-28 05:01:35,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:01:35,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:01:35,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:01:36,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:01:36,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:01:36,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185941560] [2024-11-28 05:01:36,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185941560] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:01:36,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:01:36,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-28 05:01:36,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904127707] [2024-11-28 05:01:36,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:01:36,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 05:01:36,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:01:36,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 05:01:36,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-28 05:01:36,526 INFO L87 Difference]: Start difference. First operand 533 states and 711 transitions. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:01:39,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:01:39,042 INFO L93 Difference]: Finished difference Result 1095 states and 1476 transitions. [2024-11-28 05:01:39,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 05:01:39,042 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2024-11-28 05:01:39,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:01:39,046 INFO L225 Difference]: With dead ends: 1095 [2024-11-28 05:01:39,046 INFO L226 Difference]: Without dead ends: 605 [2024-11-28 05:01:39,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-28 05:01:39,048 INFO L435 NwaCegarLoop]: 633 mSDtfsCounter, 112 mSDsluCounter, 4573 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 5206 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-28 05:01:39,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 5206 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 925 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-28 05:01:39,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2024-11-28 05:01:39,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 534. [2024-11-28 05:01:39,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 511 states have (on average 1.3365949119373777) internal successors, (683), 515 states have internal predecessors, (683), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 05:01:39,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 713 transitions. [2024-11-28 05:01:39,073 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 713 transitions. Word has length 74 [2024-11-28 05:01:39,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:01:39,073 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 713 transitions. [2024-11-28 05:01:39,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:01:39,074 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 713 transitions. [2024-11-28 05:01:39,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-28 05:01:39,075 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:01:39,075 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:01:39,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-28 05:01:39,076 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-28 05:01:39,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:01:39,076 INFO L85 PathProgramCache]: Analyzing trace with hash 935546669, now seen corresponding path program 1 times [2024-11-28 05:01:39,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:01:39,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823269445] [2024-11-28 05:01:39,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:01:39,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:01:39,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:01:39,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:01:39,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:01:39,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823269445] [2024-11-28 05:01:39,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823269445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:01:39,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:01:39,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-28 05:01:39,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849778789] [2024-11-28 05:01:39,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:01:39,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 05:01:39,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:01:39,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 05:01:39,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-28 05:01:39,771 INFO L87 Difference]: Start difference. First operand 534 states and 713 transitions. Second operand has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 states have internal predecessors, (72), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:01:44,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:01:45,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:01:49,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:01:53,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:01:57,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:01:59,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:02:03,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:02:07,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:02:11,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:02:12,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:02:12,338 INFO L93 Difference]: Finished difference Result 1046 states and 1409 transitions. [2024-11-28 05:02:12,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 05:02:12,339 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 states have internal predecessors, (72), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2024-11-28 05:02:12,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:02:12,342 INFO L225 Difference]: With dead ends: 1046 [2024-11-28 05:02:12,343 INFO L226 Difference]: Without dead ends: 555 [2024-11-28 05:02:12,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-28 05:02:12,345 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 82 mSDsluCounter, 3508 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 9 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 4065 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.4s IncrementalHoareTripleChecker+Time [2024-11-28 05:02:12,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 4065 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 637 Invalid, 7 Unknown, 0 Unchecked, 32.4s Time] [2024-11-28 05:02:12,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2024-11-28 05:02:12,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 534. [2024-11-28 05:02:12,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 511 states have (on average 1.3365949119373777) internal successors, (683), 515 states have internal predecessors, (683), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 05:02:12,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 713 transitions. [2024-11-28 05:02:12,370 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 713 transitions. Word has length 74 [2024-11-28 05:02:12,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:02:12,370 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 713 transitions. [2024-11-28 05:02:12,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 states have internal predecessors, (72), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:02:12,371 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 713 transitions. [2024-11-28 05:02:12,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-28 05:02:12,385 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:02:12,385 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:02:12,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-28 05:02:12,386 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-28 05:02:12,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:02:12,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1040881089, now seen corresponding path program 1 times [2024-11-28 05:02:12,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:02:12,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104613466] [2024-11-28 05:02:12,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:02:12,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:02:12,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:02:12,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:02:12,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:02:12,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104613466] [2024-11-28 05:02:12,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104613466] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:02:12,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:02:12,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 05:02:12,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288110989] [2024-11-28 05:02:12,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:02:12,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 05:02:12,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:02:12,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 05:02:12,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-28 05:02:12,846 INFO L87 Difference]: Start difference. First operand 534 states and 713 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:02:13,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:02:13,713 INFO L93 Difference]: Finished difference Result 1059 states and 1421 transitions. [2024-11-28 05:02:13,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 05:02:13,714 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2024-11-28 05:02:13,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:02:13,718 INFO L225 Difference]: With dead ends: 1059 [2024-11-28 05:02:13,718 INFO L226 Difference]: Without dead ends: 568 [2024-11-28 05:02:13,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-11-28 05:02:13,720 INFO L435 NwaCegarLoop]: 571 mSDtfsCounter, 99 mSDsluCounter, 2513 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 3084 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-28 05:02:13,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 3084 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-28 05:02:13,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2024-11-28 05:02:13,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 530. [2024-11-28 05:02:13,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 507 states have (on average 1.339250493096647) internal successors, (679), 511 states have internal predecessors, (679), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 05:02:13,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 709 transitions. [2024-11-28 05:02:13,750 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 709 transitions. Word has length 74 [2024-11-28 05:02:13,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:02:13,751 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 709 transitions. [2024-11-28 05:02:13,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:02:13,751 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 709 transitions. [2024-11-28 05:02:13,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-28 05:02:13,752 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:02:13,752 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:02:13,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-28 05:02:13,753 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-28 05:02:13,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:02:13,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1846562487, now seen corresponding path program 1 times [2024-11-28 05:02:13,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:02:13,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227686558] [2024-11-28 05:02:13,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:02:13,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:02:13,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:02:14,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:02:14,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:02:14,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227686558] [2024-11-28 05:02:14,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227686558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:02:14,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:02:14,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 05:02:14,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050677247] [2024-11-28 05:02:14,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:02:14,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 05:02:14,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:02:14,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 05:02:14,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-28 05:02:14,342 INFO L87 Difference]: Start difference. First operand 530 states and 709 transitions. Second operand has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:02:18,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:02:19,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:02:19,116 INFO L93 Difference]: Finished difference Result 1036 states and 1394 transitions. [2024-11-28 05:02:19,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 05:02:19,117 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2024-11-28 05:02:19,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:02:19,120 INFO L225 Difference]: With dead ends: 1036 [2024-11-28 05:02:19,121 INFO L226 Difference]: Without dead ends: 540 [2024-11-28 05:02:19,122 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-28 05:02:19,123 INFO L435 NwaCegarLoop]: 569 mSDtfsCounter, 12 mSDsluCounter, 4059 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 4628 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-11-28 05:02:19,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 4628 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 701 Invalid, 1 Unknown, 0 Unchecked, 4.7s Time] [2024-11-28 05:02:19,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2024-11-28 05:02:19,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 530. [2024-11-28 05:02:19,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 507 states have (on average 1.339250493096647) internal successors, (679), 511 states have internal predecessors, (679), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 05:02:19,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 709 transitions. [2024-11-28 05:02:19,147 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 709 transitions. Word has length 74 [2024-11-28 05:02:19,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:02:19,147 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 709 transitions. [2024-11-28 05:02:19,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:02:19,148 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 709 transitions. [2024-11-28 05:02:19,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-28 05:02:19,149 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:02:19,149 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:02:19,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-28 05:02:19,149 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-28 05:02:19,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:02:19,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1177135627, now seen corresponding path program 1 times [2024-11-28 05:02:19,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:02:19,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303564264] [2024-11-28 05:02:19,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:02:19,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:02:19,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:02:20,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:02:20,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:02:20,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303564264] [2024-11-28 05:02:20,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303564264] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:02:20,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:02:20,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-28 05:02:20,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075947998] [2024-11-28 05:02:20,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:02:20,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 05:02:20,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:02:20,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 05:02:20,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-28 05:02:20,095 INFO L87 Difference]: Start difference. First operand 530 states and 709 transitions. Second operand has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:02:20,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:02:20,859 INFO L93 Difference]: Finished difference Result 1022 states and 1376 transitions. [2024-11-28 05:02:20,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 05:02:20,864 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2024-11-28 05:02:20,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:02:20,868 INFO L225 Difference]: With dead ends: 1022 [2024-11-28 05:02:20,868 INFO L226 Difference]: Without dead ends: 526 [2024-11-28 05:02:20,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-28 05:02:20,873 INFO L435 NwaCegarLoop]: 563 mSDtfsCounter, 12 mSDsluCounter, 3512 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 4075 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-28 05:02:20,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 4075 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-28 05:02:20,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2024-11-28 05:02:20,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 516. [2024-11-28 05:02:20,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 493 states have (on average 1.3427991886409736) internal successors, (662), 497 states have internal predecessors, (662), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 05:02:20,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 692 transitions. [2024-11-28 05:02:20,904 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 692 transitions. Word has length 75 [2024-11-28 05:02:20,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:02:20,905 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 692 transitions. [2024-11-28 05:02:20,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:02:20,906 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 692 transitions. [2024-11-28 05:02:20,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-28 05:02:20,907 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:02:20,908 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:02:20,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-28 05:02:20,908 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-28 05:02:20,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:02:20,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1302510926, now seen corresponding path program 1 times [2024-11-28 05:02:20,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:02:20,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931256263] [2024-11-28 05:02:20,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:02:20,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:02:20,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:02:21,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:02:21,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:02:21,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931256263] [2024-11-28 05:02:21,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931256263] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:02:21,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:02:21,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 05:02:21,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913628304] [2024-11-28 05:02:21,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:02:21,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 05:02:21,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:02:21,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 05:02:21,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-28 05:02:21,531 INFO L87 Difference]: Start difference. First operand 516 states and 692 transitions. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:02:22,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:02:22,193 INFO L93 Difference]: Finished difference Result 1014 states and 1365 transitions. [2024-11-28 05:02:22,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 05:02:22,194 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2024-11-28 05:02:22,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:02:22,197 INFO L225 Difference]: With dead ends: 1014 [2024-11-28 05:02:22,197 INFO L226 Difference]: Without dead ends: 532 [2024-11-28 05:02:22,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-28 05:02:22,199 INFO L435 NwaCegarLoop]: 564 mSDtfsCounter, 13 mSDsluCounter, 3564 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 4128 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 05:02:22,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 4128 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 05:02:22,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2024-11-28 05:02:22,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 527. [2024-11-28 05:02:22,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 504 states have (on average 1.3373015873015872) internal successors, (674), 508 states have internal predecessors, (674), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 05:02:22,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 704 transitions. [2024-11-28 05:02:22,223 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 704 transitions. Word has length 75 [2024-11-28 05:02:22,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:02:22,223 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 704 transitions. [2024-11-28 05:02:22,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:02:22,223 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 704 transitions. [2024-11-28 05:02:22,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-28 05:02:22,224 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:02:22,225 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:02:22,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-28 05:02:22,225 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-28 05:02:22,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:02:22,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1118575210, now seen corresponding path program 1 times [2024-11-28 05:02:22,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:02:22,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617241184] [2024-11-28 05:02:22,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:02:22,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:02:22,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:02:22,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:02:22,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:02:22,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617241184] [2024-11-28 05:02:22,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617241184] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:02:22,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:02:22,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-28 05:02:22,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952935543] [2024-11-28 05:02:22,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:02:22,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 05:02:22,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:02:22,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 05:02:22,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-28 05:02:22,796 INFO L87 Difference]: Start difference. First operand 527 states and 704 transitions. Second operand has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 states have internal predecessors, (73), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:02:23,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:02:23,874 INFO L93 Difference]: Finished difference Result 1035 states and 1391 transitions. [2024-11-28 05:02:23,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 05:02:23,874 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 states have internal predecessors, (73), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2024-11-28 05:02:23,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:02:23,877 INFO L225 Difference]: With dead ends: 1035 [2024-11-28 05:02:23,877 INFO L226 Difference]: Without dead ends: 542 [2024-11-28 05:02:23,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-28 05:02:23,879 INFO L435 NwaCegarLoop]: 570 mSDtfsCounter, 17 mSDsluCounter, 5044 mSDsCounter, 0 mSdLazyCounter, 1012 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 5614 SdHoareTripleChecker+Invalid, 1013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:02:23,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 5614 Invalid, 1013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1012 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-28 05:02:23,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2024-11-28 05:02:23,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 532. [2024-11-28 05:02:23,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 509 states have (on average 1.3359528487229861) internal successors, (680), 513 states have internal predecessors, (680), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 05:02:23,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 710 transitions. [2024-11-28 05:02:23,902 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 710 transitions. Word has length 75 [2024-11-28 05:02:23,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:02:23,902 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 710 transitions. [2024-11-28 05:02:23,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 states have internal predecessors, (73), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:02:23,903 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 710 transitions. [2024-11-28 05:02:23,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-28 05:02:23,904 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:02:23,904 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:02:23,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-28 05:02:23,905 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-28 05:02:23,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:02:23,905 INFO L85 PathProgramCache]: Analyzing trace with hash -754320420, now seen corresponding path program 1 times [2024-11-28 05:02:23,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:02:23,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668242734] [2024-11-28 05:02:23,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:02:23,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:02:24,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:02:24,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:02:24,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:02:24,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668242734] [2024-11-28 05:02:24,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668242734] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:02:24,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:02:24,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-28 05:02:24,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659873182] [2024-11-28 05:02:24,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:02:24,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-28 05:02:24,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:02:24,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-28 05:02:24,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2024-11-28 05:02:24,600 INFO L87 Difference]: Start difference. First operand 532 states and 710 transitions. Second operand has 14 states, 14 states have (on average 5.214285714285714) internal successors, (73), 14 states have internal predecessors, (73), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:02:27,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:02:27,196 INFO L93 Difference]: Finished difference Result 1053 states and 1414 transitions. [2024-11-28 05:02:27,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 05:02:27,197 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.214285714285714) internal successors, (73), 14 states have internal predecessors, (73), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2024-11-28 05:02:27,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:02:27,202 INFO L225 Difference]: With dead ends: 1053 [2024-11-28 05:02:27,202 INFO L226 Difference]: Without dead ends: 555 [2024-11-28 05:02:27,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2024-11-28 05:02:27,204 INFO L435 NwaCegarLoop]: 569 mSDtfsCounter, 49 mSDsluCounter, 6102 mSDsCounter, 0 mSdLazyCounter, 1300 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 6671 SdHoareTripleChecker+Invalid, 1303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-28 05:02:27,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 6671 Invalid, 1303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1300 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-28 05:02:27,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2024-11-28 05:02:27,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 532. [2024-11-28 05:02:27,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 509 states have (on average 1.3359528487229861) internal successors, (680), 513 states have internal predecessors, (680), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 05:02:27,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 710 transitions. [2024-11-28 05:02:27,235 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 710 transitions. Word has length 75 [2024-11-28 05:02:27,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:02:27,236 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 710 transitions. [2024-11-28 05:02:27,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.214285714285714) internal successors, (73), 14 states have internal predecessors, (73), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:02:27,236 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 710 transitions. [2024-11-28 05:02:27,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-28 05:02:27,238 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:02:27,238 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:02:27,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-28 05:02:27,238 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-28 05:02:27,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:02:27,239 INFO L85 PathProgramCache]: Analyzing trace with hash 92515440, now seen corresponding path program 1 times [2024-11-28 05:02:27,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:02:27,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911173677] [2024-11-28 05:02:27,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:02:27,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:02:27,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:02:27,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:02:27,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:02:27,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911173677] [2024-11-28 05:02:27,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911173677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:02:27,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:02:27,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-28 05:02:27,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106377817] [2024-11-28 05:02:27,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:02:27,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 05:02:27,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:02:27,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 05:02:27,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-28 05:02:27,964 INFO L87 Difference]: Start difference. First operand 532 states and 710 transitions. Second operand has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 states have internal predecessors, (73), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:02:29,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:02:29,156 INFO L93 Difference]: Finished difference Result 1042 states and 1401 transitions. [2024-11-28 05:02:29,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 05:02:29,157 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 states have internal predecessors, (73), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2024-11-28 05:02:29,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:02:29,159 INFO L225 Difference]: With dead ends: 1042 [2024-11-28 05:02:29,159 INFO L226 Difference]: Without dead ends: 544 [2024-11-28 05:02:29,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-28 05:02:29,161 INFO L435 NwaCegarLoop]: 559 mSDtfsCounter, 17 mSDsluCounter, 5030 mSDsCounter, 0 mSdLazyCounter, 958 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 5589 SdHoareTripleChecker+Invalid, 959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:02:29,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 5589 Invalid, 959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 958 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-28 05:02:29,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2024-11-28 05:02:29,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 530. [2024-11-28 05:02:29,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 507 states have (on average 1.3353057199211045) internal successors, (677), 511 states have internal predecessors, (677), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 05:02:29,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 707 transitions. [2024-11-28 05:02:29,190 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 707 transitions. Word has length 75 [2024-11-28 05:02:29,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:02:29,190 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 707 transitions. [2024-11-28 05:02:29,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 states have internal predecessors, (73), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:02:29,191 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 707 transitions. [2024-11-28 05:02:29,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-28 05:02:29,192 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:02:29,192 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:02:29,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-28 05:02:29,193 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-28 05:02:29,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:02:29,193 INFO L85 PathProgramCache]: Analyzing trace with hash -2142009340, now seen corresponding path program 1 times [2024-11-28 05:02:29,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:02:29,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180210507] [2024-11-28 05:02:29,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:02:29,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:02:29,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:02:29,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:02:29,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:02:29,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180210507] [2024-11-28 05:02:29,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180210507] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:02:29,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:02:29,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 05:02:29,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837149233] [2024-11-28 05:02:29,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:02:29,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 05:02:29,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:02:29,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 05:02:29,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-28 05:02:29,728 INFO L87 Difference]: Start difference. First operand 530 states and 707 transitions. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:02:30,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:02:30,707 INFO L93 Difference]: Finished difference Result 1035 states and 1390 transitions. [2024-11-28 05:02:30,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 05:02:30,709 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2024-11-28 05:02:30,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:02:30,713 INFO L225 Difference]: With dead ends: 1035 [2024-11-28 05:02:30,714 INFO L226 Difference]: Without dead ends: 539 [2024-11-28 05:02:30,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-28 05:02:30,716 INFO L435 NwaCegarLoop]: 559 mSDtfsCounter, 48 mSDsluCounter, 4015 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 4574 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-28 05:02:30,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 4574 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-28 05:02:30,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2024-11-28 05:02:30,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 528. [2024-11-28 05:02:30,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 505 states have (on average 1.3346534653465347) internal successors, (674), 509 states have internal predecessors, (674), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 05:02:30,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 704 transitions. [2024-11-28 05:02:30,758 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 704 transitions. Word has length 75 [2024-11-28 05:02:30,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:02:30,759 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 704 transitions. [2024-11-28 05:02:30,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:02:30,759 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 704 transitions. [2024-11-28 05:02:30,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-28 05:02:30,761 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:02:30,761 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:02:30,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-28 05:02:30,762 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-28 05:02:30,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:02:30,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1236855830, now seen corresponding path program 1 times [2024-11-28 05:02:30,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:02:30,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873083903] [2024-11-28 05:02:30,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:02:30,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:02:30,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:02:31,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:02:31,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:02:31,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873083903] [2024-11-28 05:02:31,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873083903] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:02:31,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:02:31,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-28 05:02:31,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057160407] [2024-11-28 05:02:31,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:02:31,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-28 05:02:31,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:02:31,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-28 05:02:31,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-28 05:02:31,855 INFO L87 Difference]: Start difference. First operand 528 states and 704 transitions. Second operand has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:02:33,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:02:33,393 INFO L93 Difference]: Finished difference Result 1048 states and 1409 transitions. [2024-11-28 05:02:33,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 05:02:33,394 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2024-11-28 05:02:33,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:02:33,398 INFO L225 Difference]: With dead ends: 1048 [2024-11-28 05:02:33,398 INFO L226 Difference]: Without dead ends: 554 [2024-11-28 05:02:33,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-28 05:02:33,400 INFO L435 NwaCegarLoop]: 546 mSDtfsCounter, 36 mSDsluCounter, 4534 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 5080 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-28 05:02:33,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 5080 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 911 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-28 05:02:33,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2024-11-28 05:02:33,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 538. [2024-11-28 05:02:33,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 515 states have (on average 1.3339805825242719) internal successors, (687), 519 states have internal predecessors, (687), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 05:02:33,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 717 transitions. [2024-11-28 05:02:33,429 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 717 transitions. Word has length 75 [2024-11-28 05:02:33,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:02:33,429 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 717 transitions. [2024-11-28 05:02:33,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:02:33,429 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 717 transitions. [2024-11-28 05:02:33,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-28 05:02:33,431 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:02:33,431 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:02:33,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-28 05:02:33,431 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-28 05:02:33,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:02:33,432 INFO L85 PathProgramCache]: Analyzing trace with hash -103242493, now seen corresponding path program 1 times [2024-11-28 05:02:33,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:02:33,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306907954] [2024-11-28 05:02:33,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:02:33,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:02:33,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:02:39,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:02:39,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:02:39,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306907954] [2024-11-28 05:02:39,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306907954] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:02:39,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:02:39,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-28 05:02:39,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157792986] [2024-11-28 05:02:39,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:02:39,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-28 05:02:39,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:02:39,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-28 05:02:39,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2024-11-28 05:02:39,589 INFO L87 Difference]: Start difference. First operand 538 states and 717 transitions. Second operand has 14 states, 14 states have (on average 5.214285714285714) internal successors, (73), 14 states have internal predecessors, (73), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:02:41,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:02:46,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:02:50,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:02:54,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:02:58,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:03:02,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:03:06,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:03:10,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:03:14,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:03:18,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:03:22,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:03:26,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:03:30,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:03:31,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:03:32,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:03:32,343 INFO L93 Difference]: Finished difference Result 1053 states and 1414 transitions. [2024-11-28 05:03:32,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 05:03:32,344 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.214285714285714) internal successors, (73), 14 states have internal predecessors, (73), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2024-11-28 05:03:32,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:03:32,348 INFO L225 Difference]: With dead ends: 1053 [2024-11-28 05:03:32,349 INFO L226 Difference]: Without dead ends: 549 [2024-11-28 05:03:32,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2024-11-28 05:03:32,351 INFO L435 NwaCegarLoop]: 551 mSDtfsCounter, 22 mSDsluCounter, 5495 mSDsCounter, 0 mSdLazyCounter, 1003 mSolverCounterSat, 1 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 52.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 6046 SdHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1003 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 52.7s IncrementalHoareTripleChecker+Time [2024-11-28 05:03:32,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 6046 Invalid, 1016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1003 Invalid, 12 Unknown, 0 Unchecked, 52.7s Time] [2024-11-28 05:03:32,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2024-11-28 05:03:32,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 542. [2024-11-28 05:03:32,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 519 states have (on average 1.3333333333333333) internal successors, (692), 523 states have internal predecessors, (692), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 05:03:32,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 722 transitions. [2024-11-28 05:03:32,376 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 722 transitions. Word has length 75 [2024-11-28 05:03:32,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:03:32,376 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 722 transitions. [2024-11-28 05:03:32,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.214285714285714) internal successors, (73), 14 states have internal predecessors, (73), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:03:32,377 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 722 transitions. [2024-11-28 05:03:32,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-28 05:03:32,378 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:03:32,378 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:03:32,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-28 05:03:32,379 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-28 05:03:32,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:03:32,379 INFO L85 PathProgramCache]: Analyzing trace with hash 2097801795, now seen corresponding path program 1 times [2024-11-28 05:03:32,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:03:32,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240606874] [2024-11-28 05:03:32,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:03:32,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:03:32,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:03:48,860 WARN L286 SmtUtils]: Spent 5.23s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-28 05:03:53,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:03:53,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:03:53,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240606874] [2024-11-28 05:03:53,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240606874] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:03:53,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:03:53,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-28 05:03:53,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083296161] [2024-11-28 05:03:53,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:03:53,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 05:03:53,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:03:53,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 05:03:53,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=89, Unknown=2, NotChecked=0, Total=110 [2024-11-28 05:03:53,623 INFO L87 Difference]: Start difference. First operand 542 states and 722 transitions. Second operand has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:03:57,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:03:59,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:04:03,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:04:07,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:04:11,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:04:15,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:04:19,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:04:23,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:04:24,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:04:28,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:04:32,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:04:37,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:04:41,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:04:45,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:04:49,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:04:53,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:04:57,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:05:00,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:05:04,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:05:08,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:05:12,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:05:16,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:05:18,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:05:22,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:05:26,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:05:30,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:05:31,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:05:32,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:05:32,220 INFO L93 Difference]: Finished difference Result 1059 states and 1421 transitions. [2024-11-28 05:05:32,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 05:05:32,221 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2024-11-28 05:05:32,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:05:32,224 INFO L225 Difference]: With dead ends: 1059 [2024-11-28 05:05:32,224 INFO L226 Difference]: Without dead ends: 551 [2024-11-28 05:05:32,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=19, Invalid=89, Unknown=2, NotChecked=0, Total=110 [2024-11-28 05:05:32,226 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 17 mSDsluCounter, 4503 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 1 mSolverCounterUnsat, 22 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 98.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 5060 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 22 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 98.5s IncrementalHoareTripleChecker+Time [2024-11-28 05:05:32,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 5060 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 795 Invalid, 22 Unknown, 0 Unchecked, 98.5s Time] [2024-11-28 05:05:32,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2024-11-28 05:05:32,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 547. [2024-11-28 05:05:32,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 524 states have (on average 1.333969465648855) internal successors, (699), 528 states have internal predecessors, (699), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 05:05:32,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 729 transitions. [2024-11-28 05:05:32,246 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 729 transitions. Word has length 75 [2024-11-28 05:05:32,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:05:32,246 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 729 transitions. [2024-11-28 05:05:32,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:05:32,247 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 729 transitions. [2024-11-28 05:05:32,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-28 05:05:32,248 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:05:32,248 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:05:32,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-28 05:05:32,248 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-28 05:05:32,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:05:32,249 INFO L85 PathProgramCache]: Analyzing trace with hash -677889174, now seen corresponding path program 1 times [2024-11-28 05:05:32,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:05:32,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294043892] [2024-11-28 05:05:32,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:05:32,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:05:32,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:05:32,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:05:32,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:05:32,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294043892] [2024-11-28 05:05:32,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294043892] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:05:32,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:05:32,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-28 05:05:32,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513129866] [2024-11-28 05:05:32,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:05:32,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 05:05:32,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:05:32,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 05:05:32,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-28 05:05:32,726 INFO L87 Difference]: Start difference. First operand 547 states and 729 transitions. Second operand has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 9 states have internal predecessors, (73), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:05:34,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:05:34,154 INFO L93 Difference]: Finished difference Result 1127 states and 1513 transitions. [2024-11-28 05:05:34,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-28 05:05:34,155 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 9 states have internal predecessors, (73), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2024-11-28 05:05:34,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:05:34,159 INFO L225 Difference]: With dead ends: 1127 [2024-11-28 05:05:34,159 INFO L226 Difference]: Without dead ends: 614 [2024-11-28 05:05:34,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2024-11-28 05:05:34,161 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 133 mSDsluCounter, 3066 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 3634 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-28 05:05:34,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 3634 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 897 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-28 05:05:34,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2024-11-28 05:05:34,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 550. [2024-11-28 05:05:34,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 527 states have (on average 1.333965844402277) internal successors, (703), 531 states have internal predecessors, (703), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 05:05:34,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 733 transitions. [2024-11-28 05:05:34,180 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 733 transitions. Word has length 75 [2024-11-28 05:05:34,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:05:34,180 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 733 transitions. [2024-11-28 05:05:34,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 9 states have internal predecessors, (73), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:05:34,181 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 733 transitions. [2024-11-28 05:05:34,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-28 05:05:34,181 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:05:34,182 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:05:34,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-28 05:05:34,182 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-28 05:05:34,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:05:34,182 INFO L85 PathProgramCache]: Analyzing trace with hash -381844758, now seen corresponding path program 1 times [2024-11-28 05:05:34,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:05:34,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780949522] [2024-11-28 05:05:34,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:05:34,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:05:34,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:05:35,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:05:35,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:05:35,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780949522] [2024-11-28 05:05:35,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780949522] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:05:35,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:05:35,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-28 05:05:35,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303671530] [2024-11-28 05:05:35,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:05:35,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-28 05:05:35,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:05:35,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-28 05:05:35,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2024-11-28 05:05:35,006 INFO L87 Difference]: Start difference. First operand 550 states and 733 transitions. Second operand has 17 states, 17 states have (on average 4.294117647058823) internal successors, (73), 17 states have internal predecessors, (73), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:05:39,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:05:39,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:05:39,894 INFO L93 Difference]: Finished difference Result 1094 states and 1472 transitions. [2024-11-28 05:05:39,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-28 05:05:39,895 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.294117647058823) internal successors, (73), 17 states have internal predecessors, (73), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2024-11-28 05:05:39,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:05:39,898 INFO L225 Difference]: With dead ends: 1094 [2024-11-28 05:05:39,899 INFO L226 Difference]: Without dead ends: 578 [2024-11-28 05:05:39,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2024-11-28 05:05:39,900 INFO L435 NwaCegarLoop]: 549 mSDtfsCounter, 37 mSDsluCounter, 6511 mSDsCounter, 0 mSdLazyCounter, 1465 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 7060 SdHoareTripleChecker+Invalid, 1465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-11-28 05:05:39,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 7060 Invalid, 1465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1465 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-11-28 05:05:39,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2024-11-28 05:05:39,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 562. [2024-11-28 05:05:39,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 539 states have (on average 1.3358070500927643) internal successors, (720), 543 states have internal predecessors, (720), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 05:05:39,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 750 transitions. [2024-11-28 05:05:39,921 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 750 transitions. Word has length 75 [2024-11-28 05:05:39,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:05:39,922 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 750 transitions. [2024-11-28 05:05:39,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.294117647058823) internal successors, (73), 17 states have internal predecessors, (73), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:05:39,922 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 750 transitions. [2024-11-28 05:05:39,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-28 05:05:39,923 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:05:39,923 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:05:39,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-28 05:05:39,923 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-28 05:05:39,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:05:39,924 INFO L85 PathProgramCache]: Analyzing trace with hash -117514365, now seen corresponding path program 1 times [2024-11-28 05:05:39,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:05:39,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009234934] [2024-11-28 05:05:39,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:05:39,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:05:39,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat