./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fed1fcc7-a4cc-43eb-870f-cb4d426c22a0/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fed1fcc7-a4cc-43eb-870f-cb4d426c22a0/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fed1fcc7-a4cc-43eb-870f-cb4d426c22a0/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fed1fcc7-a4cc-43eb-870f-cb4d426c22a0/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fed1fcc7-a4cc-43eb-870f-cb4d426c22a0/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fed1fcc7-a4cc-43eb-870f-cb4d426c22a0/bin/uautomizer-verify-qhAvR1uOyd --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 e4ea247b245ebcaf5e735452e89c4110c7b9dc9b43836e98484a894783fc3462 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 15:45:27,903 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 15:45:27,965 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fed1fcc7-a4cc-43eb-870f-cb4d426c22a0/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 15:45:27,971 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 15:45:27,972 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 15:45:27,999 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 15:45:28,000 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 15:45:28,000 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 15:45:28,000 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 15:45:28,001 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 15:45:28,001 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 15:45:28,001 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 15:45:28,001 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 15:45:28,001 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 15:45:28,001 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 15:45:28,002 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 15:45:28,002 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 15:45:28,002 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 15:45:28,002 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 15:45:28,002 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 15:45:28,002 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 15:45:28,002 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 15:45:28,003 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 15:45:28,003 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 15:45:28,004 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 15:45:28,004 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 15:45:28,004 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 15:45:28,004 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 15:45:28,004 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 15:45:28,005 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 15:45:28,005 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 15:45:28,005 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 15:45:28,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:45:28,005 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 15:45:28,005 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 15:45:28,006 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 15:45:28,006 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 15:45:28,006 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 15:45:28,006 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 15:45:28,006 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 15:45:28,006 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 15:45:28,007 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 15:45:28,007 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_fed1fcc7-a4cc-43eb-870f-cb4d426c22a0/bin/uautomizer-verify-qhAvR1uOyd 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 -> e4ea247b245ebcaf5e735452e89c4110c7b9dc9b43836e98484a894783fc3462 [2024-11-13 15:45:28,347 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 15:45:28,358 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 15:45:28,361 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 15:45:28,362 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 15:45:28,363 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 15:45:28,365 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fed1fcc7-a4cc-43eb-870f-cb4d426c22a0/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-2.i Unable to find full path for "g++" [2024-11-13 15:45:30,643 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 15:45:31,239 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 15:45:31,243 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fed1fcc7-a4cc-43eb-870f-cb4d426c22a0/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-2.i [2024-11-13 15:45:31,271 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fed1fcc7-a4cc-43eb-870f-cb4d426c22a0/bin/uautomizer-verify-qhAvR1uOyd/data/9dbbfda07/d17ceffd4ba04b9a996dffa1703c510b/FLAG0daf33707 [2024-11-13 15:45:31,299 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fed1fcc7-a4cc-43eb-870f-cb4d426c22a0/bin/uautomizer-verify-qhAvR1uOyd/data/9dbbfda07/d17ceffd4ba04b9a996dffa1703c510b [2024-11-13 15:45:31,301 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 15:45:31,303 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 15:45:31,307 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 15:45:31,308 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 15:45:31,315 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 15:45:31,316 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:45:31" (1/1) ... [2024-11-13 15:45:31,320 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d19bc0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:45:31, skipping insertion in model container [2024-11-13 15:45:31,320 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:45:31" (1/1) ... [2024-11-13 15:45:31,403 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 15:45:32,222 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_fed1fcc7-a4cc-43eb-870f-cb4d426c22a0/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-2.i[44118,44131] [2024-11-13 15:45:32,248 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_fed1fcc7-a4cc-43eb-870f-cb4d426c22a0/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-2.i[44660,44673] [2024-11-13 15:45:32,417 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_fed1fcc7-a4cc-43eb-870f-cb4d426c22a0/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-2.i[56247,56260] [2024-11-13 15:45:32,418 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_fed1fcc7-a4cc-43eb-870f-cb4d426c22a0/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-2.i[56368,56381] [2024-11-13 15:45:32,457 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:45:32,471 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 15:45:32,555 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_fed1fcc7-a4cc-43eb-870f-cb4d426c22a0/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-2.i[44118,44131] [2024-11-13 15:45:32,561 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_fed1fcc7-a4cc-43eb-870f-cb4d426c22a0/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-2.i[44660,44673] [2024-11-13 15:45:32,651 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_fed1fcc7-a4cc-43eb-870f-cb4d426c22a0/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-2.i[56247,56260] [2024-11-13 15:45:32,652 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_fed1fcc7-a4cc-43eb-870f-cb4d426c22a0/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-2.i[56368,56381] [2024-11-13 15:45:32,676 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:45:32,757 INFO L204 MainTranslator]: Completed translation [2024-11-13 15:45:32,758 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:45:32 WrapperNode [2024-11-13 15:45:32,758 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 15:45:32,759 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 15:45:32,759 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 15:45:32,760 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 15:45:32,767 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:45:32" (1/1) ... [2024-11-13 15:45:32,797 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:45:32" (1/1) ... [2024-11-13 15:45:32,904 INFO L138 Inliner]: procedures = 282, calls = 349, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1607 [2024-11-13 15:45:32,908 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 15:45:32,908 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 15:45:32,908 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 15:45:32,909 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 15:45:32,920 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:45:32" (1/1) ... [2024-11-13 15:45:32,920 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:45:32" (1/1) ... [2024-11-13 15:45:32,941 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:45:32" (1/1) ... [2024-11-13 15:45:33,117 INFO L175 MemorySlicer]: Split 318 memory accesses to 4 slices as follows [2, 270, 12, 34]. 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, 57, 1, 4]. [2024-11-13 15:45:33,117 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:45:32" (1/1) ... [2024-11-13 15:45:33,118 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:45:32" (1/1) ... [2024-11-13 15:45:33,200 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:45:32" (1/1) ... [2024-11-13 15:45:33,215 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:45:32" (1/1) ... [2024-11-13 15:45:33,221 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:45:32" (1/1) ... [2024-11-13 15:45:33,234 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:45:32" (1/1) ... [2024-11-13 15:45:33,254 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 15:45:33,255 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 15:45:33,256 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 15:45:33,256 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 15:45:33,257 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:45:32" (1/1) ... [2024-11-13 15:45:33,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:45:33,291 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fed1fcc7-a4cc-43eb-870f-cb4d426c22a0/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:45:33,307 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fed1fcc7-a4cc-43eb-870f-cb4d426c22a0/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 15:45:33,314 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fed1fcc7-a4cc-43eb-870f-cb4d426c22a0/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 15:45:33,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-13 15:45:33,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-13 15:45:33,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-13 15:45:33,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-13 15:45:33,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-13 15:45:33,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 15:45:33,350 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2024-11-13 15:45:33,350 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2024-11-13 15:45:33,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-13 15:45:33,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-13 15:45:33,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-13 15:45:33,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-13 15:45:33,351 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-13 15:45:33,351 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-13 15:45:33,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-13 15:45:33,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-13 15:45:33,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-13 15:45:33,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-13 15:45:33,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 15:45:33,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 15:45:33,352 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2024-11-13 15:45:33,352 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2024-11-13 15:45:33,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-13 15:45:33,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-13 15:45:33,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-13 15:45:33,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-13 15:45:33,352 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2024-11-13 15:45:33,352 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2024-11-13 15:45:33,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 15:45:33,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 15:45:33,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-13 15:45:33,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-13 15:45:33,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 15:45:33,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 15:45:33,793 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 15:45:33,796 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 15:45:36,379 INFO L? ?]: Removed 365 outVars from TransFormulas that were not future-live. [2024-11-13 15:45:36,379 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 15:45:36,415 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 15:45:36,417 INFO L316 CfgBuilder]: Removed 72 assume(true) statements. [2024-11-13 15:45:36,418 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:45:36 BoogieIcfgContainer [2024-11-13 15:45:36,418 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 15:45:36,421 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 15:45:36,421 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 15:45:36,427 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 15:45:36,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 03:45:31" (1/3) ... [2024-11-13 15:45:36,428 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f182ee2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:45:36, skipping insertion in model container [2024-11-13 15:45:36,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:45:32" (2/3) ... [2024-11-13 15:45:36,429 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f182ee2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:45:36, skipping insertion in model container [2024-11-13 15:45:36,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:45:36" (3/3) ... [2024-11-13 15:45:36,430 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test6-2.i [2024-11-13 15:45:36,452 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 15:45:36,454 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_FNV_test6-2.i that has 5 procedures, 472 locations, 1 initial locations, 41 loop locations, and 4 error locations. [2024-11-13 15:45:36,566 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 15:45:36,584 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;@7a562569, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 15:45:36,584 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-13 15:45:36,594 INFO L276 IsEmpty]: Start isEmpty. Operand has 472 states, 448 states have (on average 1.6004464285714286) internal successors, (717), 452 states have internal predecessors, (717), 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-13 15:45:36,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-13 15:45:36,602 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:45:36,603 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:45:36,603 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-13 15:45:36,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:45:36,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1349958056, now seen corresponding path program 1 times [2024-11-13 15:45:36,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:45:36,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410226090] [2024-11-13 15:45:36,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:45:36,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:45:36,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:45:36,894 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-13 15:45:36,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:45:36,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410226090] [2024-11-13 15:45:36,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410226090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:45:36,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:45:36,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:45:36,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053974313] [2024-11-13 15:45:36,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:45:36,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 15:45:36,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:45:36,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 15:45:36,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 15:45:36,956 INFO L87 Difference]: Start difference. First operand has 472 states, 448 states have (on average 1.6004464285714286) internal successors, (717), 452 states have internal predecessors, (717), 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-13 15:45:37,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:45:37,076 INFO L93 Difference]: Finished difference Result 940 states and 1505 transitions. [2024-11-13 15:45:37,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 15:45:37,081 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-13 15:45:37,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:45:37,093 INFO L225 Difference]: With dead ends: 940 [2024-11-13 15:45:37,093 INFO L226 Difference]: Without dead ends: 466 [2024-11-13 15:45:37,099 INFO L431 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-13 15:45:37,102 INFO L432 NwaCegarLoop]: 666 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, 666 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-13 15:45:37,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 666 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:45:37,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2024-11-13 15:45:37,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 466. [2024-11-13 15:45:37,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 443 states have (on average 1.4266365688487586) internal successors, (632), 447 states have internal predecessors, (632), 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-13 15:45:37,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 662 transitions. [2024-11-13 15:45:37,181 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 662 transitions. Word has length 8 [2024-11-13 15:45:37,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:45:37,182 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 662 transitions. [2024-11-13 15:45:37,182 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-13 15:45:37,182 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 662 transitions. [2024-11-13 15:45:37,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-13 15:45:37,183 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:45:37,183 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:45:37,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 15:45:37,183 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-13 15:45:37,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:45:37,184 INFO L85 PathProgramCache]: Analyzing trace with hash -423923875, now seen corresponding path program 1 times [2024-11-13 15:45:37,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:45:37,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866710657] [2024-11-13 15:45:37,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:45:37,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:45:37,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:45:37,561 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-13 15:45:37,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:45:37,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866710657] [2024-11-13 15:45:37,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866710657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:45:37,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:45:37,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:45:37,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099961987] [2024-11-13 15:45:37,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:45:37,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:45:37,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:45:37,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:45:37,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:45:37,567 INFO L87 Difference]: Start difference. First operand 466 states and 662 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-13 15:45:37,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:45:37,922 INFO L93 Difference]: Finished difference Result 1155 states and 1651 transitions. [2024-11-13 15:45:37,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:45:37,923 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-13 15:45:37,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:45:37,929 INFO L225 Difference]: With dead ends: 1155 [2024-11-13 15:45:37,929 INFO L226 Difference]: Without dead ends: 905 [2024-11-13 15:45:37,931 INFO L431 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-13 15:45:37,932 INFO L432 NwaCegarLoop]: 745 mSDtfsCounter, 605 mSDsluCounter, 1375 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 619 SdHoareTripleChecker+Valid, 2120 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-13 15:45:37,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [619 Valid, 2120 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 15:45:37,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2024-11-13 15:45:38,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 468. [2024-11-13 15:45:38,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 445 states have (on average 1.4247191011235956) internal successors, (634), 449 states have internal predecessors, (634), 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-13 15:45:38,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 664 transitions. [2024-11-13 15:45:38,007 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 664 transitions. Word has length 10 [2024-11-13 15:45:38,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:45:38,007 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 664 transitions. [2024-11-13 15:45:38,008 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-13 15:45:38,008 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 664 transitions. [2024-11-13 15:45:38,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-13 15:45:38,012 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:45:38,013 INFO L215 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] [2024-11-13 15:45:38,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 15:45:38,013 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-13 15:45:38,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:45:38,014 INFO L85 PathProgramCache]: Analyzing trace with hash -484271845, now seen corresponding path program 1 times [2024-11-13 15:45:38,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:45:38,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438598210] [2024-11-13 15:45:38,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:45:38,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:45:38,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:45:38,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-13 15:45:38,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:45:38,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438598210] [2024-11-13 15:45:38,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438598210] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:45:38,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:45:38,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:45:38,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179576382] [2024-11-13 15:45:38,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:45:38,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:45:38,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:45:38,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:45:38,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:45:38,590 INFO L87 Difference]: Start difference. First operand 468 states and 664 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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-13 15:45:38,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:45:38,784 INFO L93 Difference]: Finished difference Result 890 states and 1258 transitions. [2024-11-13 15:45:38,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:45:38,785 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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 66 [2024-11-13 15:45:38,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:45:38,788 INFO L225 Difference]: With dead ends: 890 [2024-11-13 15:45:38,788 INFO L226 Difference]: Without dead ends: 426 [2024-11-13 15:45:38,792 INFO L431 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-13 15:45:38,795 INFO L432 NwaCegarLoop]: 560 mSDtfsCounter, 30 mSDsluCounter, 1101 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1661 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-13 15:45:38,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1661 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:45:38,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2024-11-13 15:45:38,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2024-11-13 15:45:38,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 403 states have (on average 1.382133995037221) internal successors, (557), 407 states have internal predecessors, (557), 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-13 15:45:38,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 587 transitions. [2024-11-13 15:45:38,825 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 587 transitions. Word has length 66 [2024-11-13 15:45:38,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:45:38,830 INFO L471 AbstractCegarLoop]: Abstraction has 426 states and 587 transitions. [2024-11-13 15:45:38,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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-13 15:45:38,830 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 587 transitions. [2024-11-13 15:45:38,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-13 15:45:38,832 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:45:38,832 INFO L215 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] [2024-11-13 15:45:38,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 15:45:38,833 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-13 15:45:38,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:45:38,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1269620879, now seen corresponding path program 1 times [2024-11-13 15:45:38,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:45:38,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659929092] [2024-11-13 15:45:38,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:45:38,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:45:38,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:45:39,681 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-13 15:45:39,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:45:39,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659929092] [2024-11-13 15:45:39,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659929092] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:45:39,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:45:39,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 15:45:39,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628519860] [2024-11-13 15:45:39,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:45:39,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:45:39,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:45:39,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:45:39,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:45:39,684 INFO L87 Difference]: Start difference. First operand 426 states and 587 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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-13 15:45:40,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:45:40,375 INFO L93 Difference]: Finished difference Result 853 states and 1178 transitions. [2024-11-13 15:45:40,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 15:45:40,376 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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 66 [2024-11-13 15:45:40,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:45:40,379 INFO L225 Difference]: With dead ends: 853 [2024-11-13 15:45:40,380 INFO L226 Difference]: Without dead ends: 431 [2024-11-13 15:45:40,381 INFO L431 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-13 15:45:40,381 INFO L432 NwaCegarLoop]: 564 mSDtfsCounter, 14 mSDsluCounter, 1959 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2523 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.6s IncrementalHoareTripleChecker+Time [2024-11-13 15:45:40,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2523 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 15:45:40,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2024-11-13 15:45:40,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 428. [2024-11-13 15:45:40,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 405 states have (on average 1.3802469135802469) internal successors, (559), 409 states have internal predecessors, (559), 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-13 15:45:40,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 589 transitions. [2024-11-13 15:45:40,409 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 589 transitions. Word has length 66 [2024-11-13 15:45:40,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:45:40,410 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 589 transitions. [2024-11-13 15:45:40,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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-13 15:45:40,410 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 589 transitions. [2024-11-13 15:45:40,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-13 15:45:40,414 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:45:40,415 INFO L215 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-13 15:45:40,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 15:45:40,415 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-13 15:45:40,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:45:40,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1999439448, now seen corresponding path program 1 times [2024-11-13 15:45:40,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:45:40,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308307818] [2024-11-13 15:45:40,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:45:40,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:45:40,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:45:40,848 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-13 15:45:40,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:45:40,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308307818] [2024-11-13 15:45:40,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308307818] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:45:40,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:45:40,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 15:45:40,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260038528] [2024-11-13 15:45:40,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:45:40,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 15:45:40,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:45:40,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 15:45:40,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:45:40,852 INFO L87 Difference]: Start difference. First operand 428 states and 589 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 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-13 15:45:41,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:45:41,422 INFO L93 Difference]: Finished difference Result 857 states and 1182 transitions. [2024-11-13 15:45:41,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 15:45:41,423 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 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-13 15:45:41,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:45:41,428 INFO L225 Difference]: With dead ends: 857 [2024-11-13 15:45:41,428 INFO L226 Difference]: Without dead ends: 433 [2024-11-13 15:45:41,429 INFO L431 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-13 15:45:41,431 INFO L432 NwaCegarLoop]: 558 mSDtfsCounter, 15 mSDsluCounter, 2470 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 3028 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-13 15:45:41,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 3028 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 15:45:41,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2024-11-13 15:45:41,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 432. [2024-11-13 15:45:41,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 409 states have (on average 1.3789731051344742) internal successors, (564), 413 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-13 15:45:41,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 594 transitions. [2024-11-13 15:45:41,466 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 594 transitions. Word has length 67 [2024-11-13 15:45:41,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:45:41,466 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 594 transitions. [2024-11-13 15:45:41,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 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-13 15:45:41,468 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 594 transitions. [2024-11-13 15:45:41,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-13 15:45:41,469 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:45:41,470 INFO L215 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-13 15:45:41,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 15:45:41,470 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-13 15:45:41,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:45:41,474 INFO L85 PathProgramCache]: Analyzing trace with hash -460922132, now seen corresponding path program 1 times [2024-11-13 15:45:41,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:45:41,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621524072] [2024-11-13 15:45:41,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:45:41,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:45:41,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:45:42,026 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-13 15:45:42,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:45:42,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621524072] [2024-11-13 15:45:42,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621524072] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:45:42,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:45:42,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:45:42,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83890707] [2024-11-13 15:45:42,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:45:42,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:45:42,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:45:42,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:45:42,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:45:42,029 INFO L87 Difference]: Start difference. First operand 432 states and 594 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-13 15:45:42,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:45:42,244 INFO L93 Difference]: Finished difference Result 860 states and 1184 transitions. [2024-11-13 15:45:42,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:45:42,245 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-13 15:45:42,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:45:42,249 INFO L225 Difference]: With dead ends: 860 [2024-11-13 15:45:42,249 INFO L226 Difference]: Without dead ends: 432 [2024-11-13 15:45:42,253 INFO L431 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-13 15:45:42,256 INFO L432 NwaCegarLoop]: 569 mSDtfsCounter, 17 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1578 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-13 15:45:42,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1578 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 15:45:42,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2024-11-13 15:45:42,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432. [2024-11-13 15:45:42,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 409 states have (on average 1.3765281173594133) internal successors, (563), 413 states have internal predecessors, (563), 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-13 15:45:42,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 593 transitions. [2024-11-13 15:45:42,296 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 593 transitions. Word has length 67 [2024-11-13 15:45:42,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:45:42,296 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 593 transitions. [2024-11-13 15:45:42,296 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-13 15:45:42,296 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 593 transitions. [2024-11-13 15:45:42,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-13 15:45:42,302 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:45:42,302 INFO L215 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-13 15:45:42,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 15:45:42,302 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-13 15:45:42,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:45:42,303 INFO L85 PathProgramCache]: Analyzing trace with hash 706848795, now seen corresponding path program 1 times [2024-11-13 15:45:42,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:45:42,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5219580] [2024-11-13 15:45:42,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:45:42,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:45:42,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:45:43,032 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-13 15:45:43,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:45:43,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5219580] [2024-11-13 15:45:43,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5219580] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:45:43,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:45:43,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 15:45:43,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663853793] [2024-11-13 15:45:43,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:45:43,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 15:45:43,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:45:43,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 15:45:43,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-13 15:45:43,035 INFO L87 Difference]: Start difference. First operand 432 states and 593 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 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-13 15:45:43,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:45:43,881 INFO L93 Difference]: Finished difference Result 873 states and 1203 transitions. [2024-11-13 15:45:43,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 15:45:43,882 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 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-13 15:45:43,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:45:43,885 INFO L225 Difference]: With dead ends: 873 [2024-11-13 15:45:43,885 INFO L226 Difference]: Without dead ends: 445 [2024-11-13 15:45:43,886 INFO L431 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-13 15:45:43,887 INFO L432 NwaCegarLoop]: 559 mSDtfsCounter, 34 mSDsluCounter, 3526 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 4085 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.7s IncrementalHoareTripleChecker+Time [2024-11-13 15:45:43,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 4085 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 15:45:43,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2024-11-13 15:45:43,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 442. [2024-11-13 15:45:43,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 419 states have (on average 1.3770883054892602) internal successors, (577), 423 states have internal predecessors, (577), 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-13 15:45:43,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 607 transitions. [2024-11-13 15:45:43,913 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 607 transitions. Word has length 68 [2024-11-13 15:45:43,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:45:43,913 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 607 transitions. [2024-11-13 15:45:43,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 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-13 15:45:43,917 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 607 transitions. [2024-11-13 15:45:43,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-13 15:45:43,917 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:45:43,918 INFO L215 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-13 15:45:43,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 15:45:43,918 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-13 15:45:43,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:45:43,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1975447500, now seen corresponding path program 1 times [2024-11-13 15:45:43,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:45:43,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769354007] [2024-11-13 15:45:43,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:45:43,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:45:44,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:45:44,730 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-13 15:45:44,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:45:44,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769354007] [2024-11-13 15:45:44,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769354007] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:45:44,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:45:44,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 15:45:44,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691067719] [2024-11-13 15:45:44,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:45:44,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 15:45:44,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:45:44,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 15:45:44,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-13 15:45:44,732 INFO L87 Difference]: Start difference. First operand 442 states and 607 transitions. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 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-13 15:45:45,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:45:45,442 INFO L93 Difference]: Finished difference Result 883 states and 1215 transitions. [2024-11-13 15:45:45,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 15:45:45,443 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 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-13 15:45:45,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:45:45,446 INFO L225 Difference]: With dead ends: 883 [2024-11-13 15:45:45,446 INFO L226 Difference]: Without dead ends: 445 [2024-11-13 15:45:45,450 INFO L431 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-13 15:45:45,451 INFO L432 NwaCegarLoop]: 563 mSDtfsCounter, 27 mSDsluCounter, 3014 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 3577 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.6s IncrementalHoareTripleChecker+Time [2024-11-13 15:45:45,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 3577 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 15:45:45,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2024-11-13 15:45:45,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 445. [2024-11-13 15:45:45,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 422 states have (on average 1.3744075829383886) internal successors, (580), 426 states have internal predecessors, (580), 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-13 15:45:45,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 610 transitions. [2024-11-13 15:45:45,472 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 610 transitions. Word has length 68 [2024-11-13 15:45:45,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:45:45,472 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 610 transitions. [2024-11-13 15:45:45,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 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-13 15:45:45,473 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 610 transitions. [2024-11-13 15:45:45,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-13 15:45:45,474 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:45:45,474 INFO L215 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-13 15:45:45,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 15:45:45,474 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-13 15:45:45,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:45:45,475 INFO L85 PathProgramCache]: Analyzing trace with hash -814148236, now seen corresponding path program 1 times [2024-11-13 15:45:45,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:45:45,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546346076] [2024-11-13 15:45:45,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:45:45,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:45:45,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:45:45,814 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-13 15:45:45,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:45:45,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546346076] [2024-11-13 15:45:45,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546346076] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:45:45,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:45:45,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 15:45:45,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007245608] [2024-11-13 15:45:45,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:45:45,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:45:45,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:45:45,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:45:45,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:45:45,816 INFO L87 Difference]: Start difference. First operand 445 states and 610 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 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-13 15:45:46,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:45:46,161 INFO L93 Difference]: Finished difference Result 889 states and 1221 transitions. [2024-11-13 15:45:46,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 15:45:46,162 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 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-13 15:45:46,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:45:46,165 INFO L225 Difference]: With dead ends: 889 [2024-11-13 15:45:46,165 INFO L226 Difference]: Without dead ends: 448 [2024-11-13 15:45:46,167 INFO L431 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-13 15:45:46,167 INFO L432 NwaCegarLoop]: 569 mSDtfsCounter, 8 mSDsluCounter, 1503 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2072 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 15:45:46,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2072 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 15:45:46,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2024-11-13 15:45:46,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 448. [2024-11-13 15:45:46,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 425 states have (on average 1.371764705882353) internal successors, (583), 429 states have internal predecessors, (583), 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-13 15:45:46,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 613 transitions. [2024-11-13 15:45:46,187 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 613 transitions. Word has length 68 [2024-11-13 15:45:46,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:45:46,188 INFO L471 AbstractCegarLoop]: Abstraction has 448 states and 613 transitions. [2024-11-13 15:45:46,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 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-13 15:45:46,188 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 613 transitions. [2024-11-13 15:45:46,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-13 15:45:46,189 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:45:46,190 INFO L215 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-13 15:45:46,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 15:45:46,190 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-13 15:45:46,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:45:46,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1436413787, now seen corresponding path program 1 times [2024-11-13 15:45:46,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:45:46,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230287415] [2024-11-13 15:45:46,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:45:46,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:45:46,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:45:47,034 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-13 15:45:47,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:45:47,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230287415] [2024-11-13 15:45:47,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230287415] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:45:47,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:45:47,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 15:45:47,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887791237] [2024-11-13 15:45:47,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:45:47,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 15:45:47,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:45:47,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 15:45:47,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-13 15:45:47,037 INFO L87 Difference]: Start difference. First operand 448 states and 613 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-13 15:45:48,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:45:48,655 INFO L93 Difference]: Finished difference Result 1308 states and 1799 transitions. [2024-11-13 15:45:48,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 15:45:48,656 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-13 15:45:48,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:45:48,662 INFO L225 Difference]: With dead ends: 1308 [2024-11-13 15:45:48,662 INFO L226 Difference]: Without dead ends: 864 [2024-11-13 15:45:48,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-11-13 15:45:48,664 INFO L432 NwaCegarLoop]: 561 mSDtfsCounter, 687 mSDsluCounter, 2877 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 3438 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-13 15:45:48,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [699 Valid, 3438 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-13 15:45:48,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2024-11-13 15:45:48,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 486. [2024-11-13 15:45:48,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 463 states have (on average 1.349892008639309) internal successors, (625), 467 states have internal predecessors, (625), 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-13 15:45:48,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 655 transitions. [2024-11-13 15:45:48,693 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 655 transitions. Word has length 69 [2024-11-13 15:45:48,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:45:48,694 INFO L471 AbstractCegarLoop]: Abstraction has 486 states and 655 transitions. [2024-11-13 15:45:48,694 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-13 15:45:48,694 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 655 transitions. [2024-11-13 15:45:48,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-13 15:45:48,695 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:45:48,695 INFO L215 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-13 15:45:48,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 15:45:48,695 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-13 15:45:48,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:45:48,696 INFO L85 PathProgramCache]: Analyzing trace with hash -2121823057, now seen corresponding path program 1 times [2024-11-13 15:45:48,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:45:48,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317004242] [2024-11-13 15:45:48,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:45:48,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:45:48,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:45:49,058 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-13 15:45:49,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:45:49,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317004242] [2024-11-13 15:45:49,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317004242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:45:49,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:45:49,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 15:45:49,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961919108] [2024-11-13 15:45:49,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:45:49,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 15:45:49,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:45:49,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 15:45:49,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:45:49,061 INFO L87 Difference]: Start difference. First operand 486 states and 655 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 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-13 15:45:49,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:45:49,651 INFO L93 Difference]: Finished difference Result 935 states and 1272 transitions. [2024-11-13 15:45:49,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 15:45:49,653 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 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-13 15:45:49,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:45:49,658 INFO L225 Difference]: With dead ends: 935 [2024-11-13 15:45:49,659 INFO L226 Difference]: Without dead ends: 491 [2024-11-13 15:45:49,660 INFO L431 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-13 15:45:49,661 INFO L432 NwaCegarLoop]: 564 mSDtfsCounter, 13 mSDsluCounter, 2470 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 3034 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.5s IncrementalHoareTripleChecker+Time [2024-11-13 15:45:49,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 3034 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 15:45:49,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2024-11-13 15:45:49,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 486. [2024-11-13 15:45:49,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 463 states have (on average 1.349892008639309) internal successors, (625), 467 states have internal predecessors, (625), 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-13 15:45:49,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 655 transitions. [2024-11-13 15:45:49,687 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 655 transitions. Word has length 69 [2024-11-13 15:45:49,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:45:49,687 INFO L471 AbstractCegarLoop]: Abstraction has 486 states and 655 transitions. [2024-11-13 15:45:49,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 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-13 15:45:49,688 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 655 transitions. [2024-11-13 15:45:49,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-13 15:45:49,689 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:45:49,689 INFO L215 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-13 15:45:49,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 15:45:49,689 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-13 15:45:49,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:45:49,690 INFO L85 PathProgramCache]: Analyzing trace with hash -340510784, now seen corresponding path program 1 times [2024-11-13 15:45:49,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:45:49,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426821708] [2024-11-13 15:45:49,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:45:49,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:45:49,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:45:50,083 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-13 15:45:50,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:45:50,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426821708] [2024-11-13 15:45:50,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426821708] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:45:50,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:45:50,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 15:45:50,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279571793] [2024-11-13 15:45:50,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:45:50,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 15:45:50,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:45:50,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 15:45:50,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-13 15:45:50,085 INFO L87 Difference]: Start difference. First operand 486 states and 655 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-13 15:45:50,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:45:50,626 INFO L93 Difference]: Finished difference Result 940 states and 1278 transitions. [2024-11-13 15:45:50,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 15:45:50,627 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-13 15:45:50,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:45:50,630 INFO L225 Difference]: With dead ends: 940 [2024-11-13 15:45:50,630 INFO L226 Difference]: Without dead ends: 496 [2024-11-13 15:45:50,631 INFO L431 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-13 15:45:50,632 INFO L432 NwaCegarLoop]: 558 mSDtfsCounter, 20 mSDsluCounter, 3059 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 3617 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.5s IncrementalHoareTripleChecker+Time [2024-11-13 15:45:50,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 3617 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 15:45:50,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2024-11-13 15:45:50,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 489. [2024-11-13 15:45:50,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 466 states have (on average 1.349785407725322) internal successors, (629), 470 states have internal predecessors, (629), 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-13 15:45:50,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 659 transitions. [2024-11-13 15:45:50,657 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 659 transitions. Word has length 70 [2024-11-13 15:45:50,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:45:50,658 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 659 transitions. [2024-11-13 15:45:50,658 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-13 15:45:50,658 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 659 transitions. [2024-11-13 15:45:50,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-13 15:45:50,659 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:45:50,659 INFO L215 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-13 15:45:50,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-13 15:45:50,659 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-13 15:45:50,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:45:50,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1796730020, now seen corresponding path program 1 times [2024-11-13 15:45:50,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:45:50,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709002284] [2024-11-13 15:45:50,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:45:50,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:45:50,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:45:51,195 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-13 15:45:51,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:45:51,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709002284] [2024-11-13 15:45:51,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709002284] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:45:51,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:45:51,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 15:45:51,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458203085] [2024-11-13 15:45:51,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:45:51,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 15:45:51,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:45:51,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 15:45:51,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-13 15:45:51,198 INFO L87 Difference]: Start difference. First operand 489 states and 659 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-13 15:45:52,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:45:52,027 INFO L93 Difference]: Finished difference Result 958 states and 1298 transitions. [2024-11-13 15:45:52,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 15:45:52,028 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-13 15:45:52,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:45:52,032 INFO L225 Difference]: With dead ends: 958 [2024-11-13 15:45:52,032 INFO L226 Difference]: Without dead ends: 511 [2024-11-13 15:45:52,033 INFO L431 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-13 15:45:52,034 INFO L432 NwaCegarLoop]: 570 mSDtfsCounter, 38 mSDsluCounter, 3492 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 4062 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.7s IncrementalHoareTripleChecker+Time [2024-11-13 15:45:52,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 4062 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 15:45:52,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2024-11-13 15:45:52,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 489. [2024-11-13 15:45:52,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 466 states have (on average 1.349785407725322) internal successors, (629), 470 states have internal predecessors, (629), 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-13 15:45:52,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 659 transitions. [2024-11-13 15:45:52,061 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 659 transitions. Word has length 70 [2024-11-13 15:45:52,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:45:52,061 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 659 transitions. [2024-11-13 15:45:52,061 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-13 15:45:52,061 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 659 transitions. [2024-11-13 15:45:52,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-13 15:45:52,062 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:45:52,062 INFO L215 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-13 15:45:52,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-13 15:45:52,063 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-13 15:45:52,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:45:52,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1077501215, now seen corresponding path program 1 times [2024-11-13 15:45:52,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:45:52,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977661802] [2024-11-13 15:45:52,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:45:52,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:45:52,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:45:52,543 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-13 15:45:52,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:45:52,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977661802] [2024-11-13 15:45:52,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977661802] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:45:52,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:45:52,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 15:45:52,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217041148] [2024-11-13 15:45:52,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:45:52,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 15:45:52,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:45:52,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 15:45:52,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-13 15:45:52,548 INFO L87 Difference]: Start difference. First operand 489 states and 659 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 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-13 15:45:53,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:45:53,272 INFO L93 Difference]: Finished difference Result 952 states and 1295 transitions. [2024-11-13 15:45:53,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 15:45:53,273 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 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-13 15:45:53,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:45:53,276 INFO L225 Difference]: With dead ends: 952 [2024-11-13 15:45:53,276 INFO L226 Difference]: Without dead ends: 505 [2024-11-13 15:45:53,277 INFO L431 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-13 15:45:53,278 INFO L432 NwaCegarLoop]: 565 mSDtfsCounter, 23 mSDsluCounter, 3541 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 4106 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.6s IncrementalHoareTripleChecker+Time [2024-11-13 15:45:53,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 4106 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 15:45:53,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2024-11-13 15:45:53,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 499. [2024-11-13 15:45:53,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 476 states have (on average 1.346638655462185) internal successors, (641), 480 states have internal predecessors, (641), 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-13 15:45:53,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 671 transitions. [2024-11-13 15:45:53,307 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 671 transitions. Word has length 71 [2024-11-13 15:45:53,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:45:53,307 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 671 transitions. [2024-11-13 15:45:53,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 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-13 15:45:53,307 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 671 transitions. [2024-11-13 15:45:53,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-13 15:45:53,308 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:45:53,309 INFO L215 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-13 15:45:53,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-13 15:45:53,309 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-13 15:45:53,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:45:53,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1409403963, now seen corresponding path program 1 times [2024-11-13 15:45:53,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:45:53,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265913574] [2024-11-13 15:45:53,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:45:53,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:45:53,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:45:53,775 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-13 15:45:53,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:45:53,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265913574] [2024-11-13 15:45:53,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265913574] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:45:53,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:45:53,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 15:45:53,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334509831] [2024-11-13 15:45:53,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:45:53,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 15:45:53,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:45:53,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 15:45:53,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:45:53,777 INFO L87 Difference]: Start difference. First operand 499 states and 671 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 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-13 15:45:54,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:45:54,324 INFO L93 Difference]: Finished difference Result 959 states and 1299 transitions. [2024-11-13 15:45:54,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 15:45:54,325 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 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-13 15:45:54,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:45:54,328 INFO L225 Difference]: With dead ends: 959 [2024-11-13 15:45:54,329 INFO L226 Difference]: Without dead ends: 502 [2024-11-13 15:45:54,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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-13 15:45:54,333 INFO L432 NwaCegarLoop]: 559 mSDtfsCounter, 11 mSDsluCounter, 2499 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 3058 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-13 15:45:54,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 3058 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 15:45:54,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2024-11-13 15:45:54,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 499. [2024-11-13 15:45:54,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 476 states have (on average 1.3445378151260505) internal successors, (640), 480 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-13 15:45:54,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 670 transitions. [2024-11-13 15:45:54,360 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 670 transitions. Word has length 71 [2024-11-13 15:45:54,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:45:54,360 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 670 transitions. [2024-11-13 15:45:54,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 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-13 15:45:54,361 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 670 transitions. [2024-11-13 15:45:54,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-13 15:45:54,363 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:45:54,363 INFO L215 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-13 15:45:54,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-13 15:45:54,364 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-13 15:45:54,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:45:54,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1272892332, now seen corresponding path program 1 times [2024-11-13 15:45:54,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:45:54,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856714070] [2024-11-13 15:45:54,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:45:54,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:45:54,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:45:54,861 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-13 15:45:54,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:45:54,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856714070] [2024-11-13 15:45:54,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856714070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:45:54,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:45:54,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 15:45:54,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150862349] [2024-11-13 15:45:54,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:45:54,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 15:45:54,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:45:54,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 15:45:54,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:45:54,866 INFO L87 Difference]: Start difference. First operand 499 states and 670 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 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-13 15:45:55,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:45:55,424 INFO L93 Difference]: Finished difference Result 959 states and 1299 transitions. [2024-11-13 15:45:55,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 15:45:55,425 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 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-13 15:45:55,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:45:55,428 INFO L225 Difference]: With dead ends: 959 [2024-11-13 15:45:55,429 INFO L226 Difference]: Without dead ends: 502 [2024-11-13 15:45:55,430 INFO L431 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-13 15:45:55,431 INFO L432 NwaCegarLoop]: 563 mSDtfsCounter, 8 mSDsluCounter, 2454 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3017 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.5s IncrementalHoareTripleChecker+Time [2024-11-13 15:45:55,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3017 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 15:45:55,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2024-11-13 15:45:55,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 502. [2024-11-13 15:45:55,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 479 states have (on average 1.3423799582463465) internal successors, (643), 483 states have internal predecessors, (643), 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-13 15:45:55,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 673 transitions. [2024-11-13 15:45:55,457 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 673 transitions. Word has length 71 [2024-11-13 15:45:55,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:45:55,458 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 673 transitions. [2024-11-13 15:45:55,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 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-13 15:45:55,458 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 673 transitions. [2024-11-13 15:45:55,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-13 15:45:55,459 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:45:55,459 INFO L215 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-13 15:45:55,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-13 15:45:55,460 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-13 15:45:55,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:45:55,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1387510597, now seen corresponding path program 1 times [2024-11-13 15:45:55,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:45:55,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502271167] [2024-11-13 15:45:55,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:45:55,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:45:55,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:45:55,928 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-13 15:45:55,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:45:55,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502271167] [2024-11-13 15:45:55,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502271167] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:45:55,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:45:55,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 15:45:55,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819352205] [2024-11-13 15:45:55,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:45:55,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 15:45:55,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:45:55,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 15:45:55,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-13 15:45:55,930 INFO L87 Difference]: Start difference. First operand 502 states and 673 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 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-13 15:45:56,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:45:56,723 INFO L93 Difference]: Finished difference Result 978 states and 1323 transitions. [2024-11-13 15:45:56,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 15:45:56,724 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 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-13 15:45:56,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:45:56,728 INFO L225 Difference]: With dead ends: 978 [2024-11-13 15:45:56,729 INFO L226 Difference]: Without dead ends: 518 [2024-11-13 15:45:56,730 INFO L431 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-13 15:45:56,731 INFO L432 NwaCegarLoop]: 551 mSDtfsCounter, 17 mSDsluCounter, 4004 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4555 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.7s IncrementalHoareTripleChecker+Time [2024-11-13 15:45:56,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4555 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 15:45:56,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2024-11-13 15:45:56,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 505. [2024-11-13 15:45:56,760 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-13 15:45:56,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 677 transitions. [2024-11-13 15:45:56,764 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 677 transitions. Word has length 71 [2024-11-13 15:45:56,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:45:56,765 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 677 transitions. [2024-11-13 15:45:56,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 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-13 15:45:56,765 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 677 transitions. [2024-11-13 15:45:56,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-13 15:45:56,766 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:45:56,767 INFO L215 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-13 15:45:56,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-13 15:45:56,767 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-13 15:45:56,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:45:56,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1008770813, now seen corresponding path program 1 times [2024-11-13 15:45:56,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:45:56,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132922619] [2024-11-13 15:45:56,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:45:56,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:45:56,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:45:57,447 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-13 15:45:57,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:45:57,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132922619] [2024-11-13 15:45:57,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132922619] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:45:57,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:45:57,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 15:45:57,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779904413] [2024-11-13 15:45:57,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:45:57,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 15:45:57,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:45:57,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 15:45:57,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-13 15:45:57,451 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-13 15:46:01,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.47s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:46:01,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:46:01,711 INFO L93 Difference]: Finished difference Result 980 states and 1326 transitions. [2024-11-13 15:46:01,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 15:46:01,712 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-13 15:46:01,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:46:01,716 INFO L225 Difference]: With dead ends: 980 [2024-11-13 15:46:01,716 INFO L226 Difference]: Without dead ends: 517 [2024-11-13 15:46:01,717 INFO L431 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-13 15:46:01,718 INFO L432 NwaCegarLoop]: 562 mSDtfsCounter, 13 mSDsluCounter, 3504 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 4066 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:46:01,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 4066 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-13 15:46:01,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2024-11-13 15:46:01,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 509. [2024-11-13 15:46:01,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 486 states have (on average 1.3415637860082306) internal successors, (652), 490 states have internal predecessors, (652), 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-13 15:46:01,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 682 transitions. [2024-11-13 15:46:01,744 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 682 transitions. Word has length 72 [2024-11-13 15:46:01,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:46:01,745 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 682 transitions. [2024-11-13 15:46:01,745 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-13 15:46:01,745 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 682 transitions. [2024-11-13 15:46:01,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-13 15:46:01,746 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:46:01,747 INFO L215 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-13 15:46:01,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-13 15:46:01,747 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-13 15:46:01,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:46:01,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1951188577, now seen corresponding path program 1 times [2024-11-13 15:46:01,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:46:01,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339827741] [2024-11-13 15:46:01,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:46:01,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:46:01,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:46:02,129 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-13 15:46:02,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:46:02,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339827741] [2024-11-13 15:46:02,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339827741] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:46:02,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:46:02,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 15:46:02,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604786007] [2024-11-13 15:46:02,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:46:02,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 15:46:02,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:46:02,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 15:46:02,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-13 15:46:02,131 INFO L87 Difference]: Start difference. First operand 509 states and 682 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 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-13 15:46:02,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:46:02,957 INFO L93 Difference]: Finished difference Result 997 states and 1343 transitions. [2024-11-13 15:46:02,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 15:46:02,958 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 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-13 15:46:02,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:46:02,962 INFO L225 Difference]: With dead ends: 997 [2024-11-13 15:46:02,962 INFO L226 Difference]: Without dead ends: 530 [2024-11-13 15:46:02,964 INFO L431 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-13 15:46:02,964 INFO L432 NwaCegarLoop]: 570 mSDtfsCounter, 34 mSDsluCounter, 3492 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 4062 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.7s IncrementalHoareTripleChecker+Time [2024-11-13 15:46:02,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 4062 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 15:46:02,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2024-11-13 15:46:02,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 506. [2024-11-13 15:46:02,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 483 states have (on average 1.3436853002070392) internal successors, (649), 487 states have internal predecessors, (649), 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-13 15:46:02,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 679 transitions. [2024-11-13 15:46:02,991 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 679 transitions. Word has length 72 [2024-11-13 15:46:02,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:46:02,991 INFO L471 AbstractCegarLoop]: Abstraction has 506 states and 679 transitions. [2024-11-13 15:46:02,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 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-13 15:46:02,992 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 679 transitions. [2024-11-13 15:46:02,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-13 15:46:02,993 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:46:02,993 INFO L215 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-13 15:46:02,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-13 15:46:02,993 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-13 15:46:02,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:46:02,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1740787515, now seen corresponding path program 1 times [2024-11-13 15:46:02,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:46:02,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905783676] [2024-11-13 15:46:02,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:46:02,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:46:03,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:46:19,813 WARN L286 SmtUtils]: Spent 5.21s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:46:23,818 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-13 15:46:23,920 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-13 15:46:23,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:46:23,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905783676] [2024-11-13 15:46:23,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905783676] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:46:23,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:46:23,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-13 15:46:23,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475645484] [2024-11-13 15:46:23,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:46:23,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 15:46:23,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:46:23,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 15:46:23,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=72, Unknown=1, NotChecked=16, Total=110 [2024-11-13 15:46:23,921 INFO L87 Difference]: Start difference. First operand 506 states and 679 transitions. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 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-13 15:46:28,321 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-13 15:46:30,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.41s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:46:33,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.87s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:46:37,737 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-13 15:46:41,746 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-13 15:46:45,750 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-13 15:46:49,764 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (div |c_ULTIMATE.start_main_~_hj_j~0#1| 8192)) (.cse3 (* (div |c_ULTIMATE.start_main_~_hj_j~0#1| 4294967296) 524288))) (let ((.cse0 (+ .cse3 |c_ULTIMATE.start_main_~_ha_hashv~0#1|)) (.cse6 (* 1030789530 |c_ULTIMATE.start_main_~_ha_hashv~0#1|)) (.cse7 (* |c_ULTIMATE.start_main_~_hj_j~0#1| 2061579059)) (.cse2 (* (- 4123158118) |c_ULTIMATE.start_main_~_hj_j~0#1|)) (.cse4 (* (- 2061579059) |c_ULTIMATE.start_main_~_ha_hashv~0#1|)) (.cse5 (* (- 1) .cse1))) (and (or (< .cse0 (+ .cse1 (mod |c_ULTIMATE.start_main_~_hj_i~0#1| 4294967296))) (< 4408680405129836980 (+ (* 1030789529 |c_ULTIMATE.start_main_~_hj_i~0#1|) (* 2147483648 (div (+ .cse2 8817360810260198248 (* (- 2061579059) |c_ULTIMATE.start_main_~_hj_i~0#1|) .cse3 .cse4 .cse5) 4294967296)) .cse6 .cse7 (* (div |c_ULTIMATE.start_main_~_hj_i~0#1| 4294967296) 2147483648)))) (= .cse1 .cse0) (<= 4408680405129836981 (+ .cse6 .cse7 (* (div (+ .cse2 8817360810260198248 .cse3 .cse4 .cse5) 4294967296) 2147483648)))))) is different from false [2024-11-13 15:46:51,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:46:55,907 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-13 15:46:59,912 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-13 15:47:03,917 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-13 15:47:07,924 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-13 15:47:11,932 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-13 15:47:15,936 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-13 15:47:17,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:47:21,878 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-13 15:47:25,883 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-13 15:47:29,887 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-13 15:47:33,890 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-13 15:47:37,894 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-13 15:47:41,896 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-13 15:48:14,815 WARN L286 SmtUtils]: Spent 24.27s 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-13 15:48:18,876 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-13 15:48:22,880 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-13 15:48:26,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.15s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:48:30,052 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-13 15:48:34,064 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-13 15:48:35,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:48:39,268 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-13 15:48:43,273 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-13 15:48:47,289 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-13 15:48:48,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:48:48,057 INFO L93 Difference]: Finished difference Result 997 states and 1354 transitions. [2024-11-13 15:48:48,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 15:48:48,058 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 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-13 15:48:48,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:48:48,061 INFO L225 Difference]: With dead ends: 997 [2024-11-13 15:48:48,061 INFO L226 Difference]: Without dead ends: 533 [2024-11-13 15:48:48,062 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 43.4s TimeCoverageRelationStatistics Valid=27, Invalid=87, Unknown=4, NotChecked=38, Total=156 [2024-11-13 15:48:48,064 INFO L432 NwaCegarLoop]: 563 mSDtfsCounter, 43 mSDsluCounter, 4458 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 3 mSolverCounterUnsat, 23 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 107.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 5021 SdHoareTripleChecker+Invalid, 969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 23 IncrementalHoareTripleChecker+Unknown, 155 IncrementalHoareTripleChecker+Unchecked, 107.7s IncrementalHoareTripleChecker+Time [2024-11-13 15:48:48,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 5021 Invalid, 969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 788 Invalid, 23 Unknown, 155 Unchecked, 107.7s Time] [2024-11-13 15:48:48,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2024-11-13 15:48:48,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 512. [2024-11-13 15:48:48,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 489 states have (on average 1.343558282208589) internal successors, (657), 493 states have internal predecessors, (657), 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-13 15:48:48,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 687 transitions. [2024-11-13 15:48:48,097 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 687 transitions. Word has length 72 [2024-11-13 15:48:48,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:48:48,097 INFO L471 AbstractCegarLoop]: Abstraction has 512 states and 687 transitions. [2024-11-13 15:48:48,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 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-13 15:48:48,098 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 687 transitions. [2024-11-13 15:48:48,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-13 15:48:48,099 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:48:48,099 INFO L215 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-13 15:48:48,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-13 15:48:48,099 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-13 15:48:48,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:48:48,100 INFO L85 PathProgramCache]: Analyzing trace with hash 919802864, now seen corresponding path program 1 times [2024-11-13 15:48:48,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:48:48,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254690010] [2024-11-13 15:48:48,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:48:48,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:48:48,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:48,535 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-13 15:48:48,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:48:48,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254690010] [2024-11-13 15:48:48,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254690010] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:48:48,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:48:48,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-13 15:48:48,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291789942] [2024-11-13 15:48:48,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:48:48,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 15:48:48,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:48:48,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 15:48:48,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-13 15:48:48,537 INFO L87 Difference]: Start difference. First operand 512 states and 687 transitions. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 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-13 15:48:49,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:48:49,532 INFO L93 Difference]: Finished difference Result 995 states and 1346 transitions. [2024-11-13 15:48:49,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 15:48:49,534 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 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-13 15:48:49,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:48:49,539 INFO L225 Difference]: With dead ends: 995 [2024-11-13 15:48:49,539 INFO L226 Difference]: Without dead ends: 525 [2024-11-13 15:48:49,541 INFO L431 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-13 15:48:49,542 INFO L432 NwaCegarLoop]: 559 mSDtfsCounter, 26 mSDsluCounter, 4549 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 5108 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-13 15:48:49,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 5108 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-13 15:48:49,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2024-11-13 15:48:49,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 515. [2024-11-13 15:48:49,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 492 states have (on average 1.3414634146341464) internal successors, (660), 496 states have internal predecessors, (660), 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-13 15:48:49,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 690 transitions. [2024-11-13 15:48:49,569 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 690 transitions. Word has length 72 [2024-11-13 15:48:49,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:48:49,570 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 690 transitions. [2024-11-13 15:48:49,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 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-13 15:48:49,570 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 690 transitions. [2024-11-13 15:48:49,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-13 15:48:49,571 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:48:49,571 INFO L215 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-13 15:48:49,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-13 15:48:49,572 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-13 15:48:49,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:48:49,572 INFO L85 PathProgramCache]: Analyzing trace with hash -114725657, now seen corresponding path program 1 times [2024-11-13 15:48:49,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:48:49,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722250906] [2024-11-13 15:48:49,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:48:49,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:48:49,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:50,325 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-13 15:48:50,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:48:50,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722250906] [2024-11-13 15:48:50,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722250906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:48:50,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:48:50,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 15:48:50,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103945702] [2024-11-13 15:48:50,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:48:50,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 15:48:50,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:48:50,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 15:48:50,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-13 15:48:50,328 INFO L87 Difference]: Start difference. First operand 515 states and 690 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-13 15:48:54,841 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-13 15:48:55,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:48:55,749 INFO L93 Difference]: Finished difference Result 1004 states and 1352 transitions. [2024-11-13 15:48:55,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 15:48:55,754 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-13 15:48:55,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:48:55,757 INFO L225 Difference]: With dead ends: 1004 [2024-11-13 15:48:55,758 INFO L226 Difference]: Without dead ends: 531 [2024-11-13 15:48:55,759 INFO L431 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-13 15:48:55,761 INFO L432 NwaCegarLoop]: 563 mSDtfsCounter, 43 mSDsluCounter, 3469 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 4032 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:48:55,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 4032 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 610 Invalid, 1 Unknown, 0 Unchecked, 5.1s Time] [2024-11-13 15:48:55,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2024-11-13 15:48:55,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 516. [2024-11-13 15:48:55,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 493 states have (on average 1.3407707910750508) internal successors, (661), 497 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-13 15:48:55,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 691 transitions. [2024-11-13 15:48:55,801 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 691 transitions. Word has length 72 [2024-11-13 15:48:55,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:48:55,802 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 691 transitions. [2024-11-13 15:48:55,802 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-13 15:48:55,802 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 691 transitions. [2024-11-13 15:48:55,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-13 15:48:55,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:48:55,803 INFO L215 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-13 15:48:55,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-13 15:48:55,804 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-13 15:48:55,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:48:55,804 INFO L85 PathProgramCache]: Analyzing trace with hash -224165720, now seen corresponding path program 1 times [2024-11-13 15:48:55,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:48:55,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318908716] [2024-11-13 15:48:55,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:48:55,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:48:55,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:56,300 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-13 15:48:56,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:48:56,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318908716] [2024-11-13 15:48:56,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318908716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:48:56,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:48:56,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-13 15:48:56,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810293937] [2024-11-13 15:48:56,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:48:56,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 15:48:56,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:48:56,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 15:48:56,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-13 15:48:56,302 INFO L87 Difference]: Start difference. First operand 516 states and 691 transitions. Second operand has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 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-13 15:48:57,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:48:57,305 INFO L93 Difference]: Finished difference Result 1002 states and 1354 transitions. [2024-11-13 15:48:57,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 15:48:57,307 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 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-13 15:48:57,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:48:57,311 INFO L225 Difference]: With dead ends: 1002 [2024-11-13 15:48:57,311 INFO L226 Difference]: Without dead ends: 528 [2024-11-13 15:48:57,313 INFO L431 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-13 15:48:57,314 INFO L432 NwaCegarLoop]: 562 mSDtfsCounter, 16 mSDsluCounter, 4517 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 5079 SdHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-13 15:48:57,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 5079 Invalid, 866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-13 15:48:57,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2024-11-13 15:48:57,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 523. [2024-11-13 15:48:57,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 500 states have (on average 1.34) internal successors, (670), 504 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-13 15:48:57,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 700 transitions. [2024-11-13 15:48:57,340 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 700 transitions. Word has length 73 [2024-11-13 15:48:57,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:48:57,340 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 700 transitions. [2024-11-13 15:48:57,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 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-13 15:48:57,341 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 700 transitions. [2024-11-13 15:48:57,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-13 15:48:57,341 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:48:57,342 INFO L215 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-13 15:48:57,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-13 15:48:57,342 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-13 15:48:57,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:48:57,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1327088318, now seen corresponding path program 1 times [2024-11-13 15:48:57,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:48:57,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207391421] [2024-11-13 15:48:57,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:48:57,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:48:57,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:57,929 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-13 15:48:57,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:48:57,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207391421] [2024-11-13 15:48:57,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207391421] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:48:57,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:48:57,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-13 15:48:57,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35193646] [2024-11-13 15:48:57,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:48:57,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 15:48:57,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:48:57,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 15:48:57,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-13 15:48:57,931 INFO L87 Difference]: Start difference. First operand 523 states and 700 transitions. Second operand has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 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-13 15:48:59,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:48:59,209 INFO L93 Difference]: Finished difference Result 1020 states and 1379 transitions. [2024-11-13 15:48:59,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 15:48:59,210 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 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-13 15:48:59,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:48:59,214 INFO L225 Difference]: With dead ends: 1020 [2024-11-13 15:48:59,214 INFO L226 Difference]: Without dead ends: 539 [2024-11-13 15:48:59,215 INFO L431 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-13 15:48:59,216 INFO L432 NwaCegarLoop]: 557 mSDtfsCounter, 18 mSDsluCounter, 4986 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 5543 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:48:59,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 5543 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 979 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-13 15:48:59,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2024-11-13 15:48:59,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 524. [2024-11-13 15:48:59,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 501 states have (on average 1.3393213572854292) internal successors, (671), 505 states have internal predecessors, (671), 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-13 15:48:59,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 701 transitions. [2024-11-13 15:48:59,240 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 701 transitions. Word has length 73 [2024-11-13 15:48:59,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:48:59,240 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 701 transitions. [2024-11-13 15:48:59,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 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-13 15:48:59,241 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 701 transitions. [2024-11-13 15:48:59,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-13 15:48:59,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:48:59,242 INFO L215 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-13 15:48:59,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-13 15:48:59,242 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-13 15:48:59,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:48:59,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1608870112, now seen corresponding path program 1 times [2024-11-13 15:48:59,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:48:59,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451052104] [2024-11-13 15:48:59,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:48:59,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:48:59,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:48:59,785 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-13 15:48:59,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:48:59,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451052104] [2024-11-13 15:48:59,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451052104] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:48:59,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:48:59,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 15:48:59,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235463019] [2024-11-13 15:48:59,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:48:59,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 15:48:59,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:48:59,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 15:48:59,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-13 15:48:59,787 INFO L87 Difference]: Start difference. First operand 524 states and 701 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-13 15:49:03,990 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-13 15:49:04,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:49:04,525 INFO L93 Difference]: Finished difference Result 1016 states and 1370 transitions. [2024-11-13 15:49:04,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 15:49:04,526 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-13 15:49:04,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:49:04,529 INFO L225 Difference]: With dead ends: 1016 [2024-11-13 15:49:04,530 INFO L226 Difference]: Without dead ends: 534 [2024-11-13 15:49:04,531 INFO L431 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-13 15:49:04,532 INFO L432 NwaCegarLoop]: 565 mSDtfsCounter, 12 mSDsluCounter, 4020 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 4585 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-11-13 15:49:04,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 4585 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 707 Invalid, 1 Unknown, 0 Unchecked, 4.7s Time] [2024-11-13 15:49:04,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2024-11-13 15:49:04,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 524. [2024-11-13 15:49:04,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 501 states have (on average 1.3393213572854292) internal successors, (671), 505 states have internal predecessors, (671), 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-13 15:49:04,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 701 transitions. [2024-11-13 15:49:04,553 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 701 transitions. Word has length 73 [2024-11-13 15:49:04,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:49:04,553 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 701 transitions. [2024-11-13 15:49:04,554 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-13 15:49:04,554 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 701 transitions. [2024-11-13 15:49:04,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-13 15:49:04,555 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:49:04,555 INFO L215 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-13 15:49:04,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-13 15:49:04,555 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-13 15:49:04,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:49:04,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1734039332, now seen corresponding path program 1 times [2024-11-13 15:49:04,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:49:04,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935669970] [2024-11-13 15:49:04,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:49:04,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:49:04,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:05,250 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-13 15:49:05,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:49:05,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935669970] [2024-11-13 15:49:05,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935669970] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:49:05,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:49:05,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-13 15:49:05,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259347747] [2024-11-13 15:49:05,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:49:05,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-13 15:49:05,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:49:05,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-13 15:49:05,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2024-11-13 15:49:05,253 INFO L87 Difference]: Start difference. First operand 524 states and 701 transitions. Second operand has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 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-13 15:49:06,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:49:06,472 INFO L93 Difference]: Finished difference Result 1038 states and 1399 transitions. [2024-11-13 15:49:06,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 15:49:06,473 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 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-13 15:49:06,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:49:06,476 INFO L225 Difference]: With dead ends: 1038 [2024-11-13 15:49:06,476 INFO L226 Difference]: Without dead ends: 556 [2024-11-13 15:49:06,477 INFO L431 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-13 15:49:06,478 INFO L432 NwaCegarLoop]: 554 mSDtfsCounter, 47 mSDsluCounter, 5515 mSDsCounter, 0 mSdLazyCounter, 1052 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 6069 SdHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:49:06,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 6069 Invalid, 1053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1052 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-13 15:49:06,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2024-11-13 15:49:06,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 533. [2024-11-13 15:49:06,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 510 states have (on average 1.3392156862745097) internal successors, (683), 514 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-13 15:49:06,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 713 transitions. [2024-11-13 15:49:06,502 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 713 transitions. Word has length 73 [2024-11-13 15:49:06,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:49:06,503 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 713 transitions. [2024-11-13 15:49:06,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 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-13 15:49:06,503 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 713 transitions. [2024-11-13 15:49:06,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-13 15:49:06,504 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:49:06,504 INFO L215 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-13 15:49:06,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-13 15:49:06,505 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-13 15:49:06,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:49:06,505 INFO L85 PathProgramCache]: Analyzing trace with hash -887203472, now seen corresponding path program 1 times [2024-11-13 15:49:06,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:49:06,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385402898] [2024-11-13 15:49:06,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:49:06,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:49:06,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:24,659 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-13 15:49:24,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:49:24,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385402898] [2024-11-13 15:49:24,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385402898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:49:24,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:49:24,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-13 15:49:24,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073121345] [2024-11-13 15:49:24,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:49:24,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 15:49:24,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:49:24,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 15:49:24,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-13 15:49:24,662 INFO L87 Difference]: Start difference. First operand 533 states and 713 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-13 15:49:26,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:49:26,890 INFO L93 Difference]: Finished difference Result 1094 states and 1479 transitions. [2024-11-13 15:49:26,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 15:49:26,891 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-13 15:49:26,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:49:26,894 INFO L225 Difference]: With dead ends: 1094 [2024-11-13 15:49:26,894 INFO L226 Difference]: Without dead ends: 603 [2024-11-13 15:49:26,895 INFO L431 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-13 15:49:26,896 INFO L432 NwaCegarLoop]: 580 mSDtfsCounter, 119 mSDsluCounter, 3754 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 4334 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:49:26,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 4334 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 881 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-13 15:49:26,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2024-11-13 15:49:26,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 534. [2024-11-13 15:49:26,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 511 states have (on average 1.340508806262231) internal successors, (685), 515 states have internal predecessors, (685), 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-13 15:49:26,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 715 transitions. [2024-11-13 15:49:26,916 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 715 transitions. Word has length 73 [2024-11-13 15:49:26,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:49:26,917 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 715 transitions. [2024-11-13 15:49:26,917 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-13 15:49:26,918 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 715 transitions. [2024-11-13 15:49:26,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-13 15:49:26,919 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:49:26,920 INFO L215 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-13 15:49:26,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-13 15:49:26,920 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-13 15:49:26,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:49:26,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1173239044, now seen corresponding path program 1 times [2024-11-13 15:49:26,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:49:26,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658938484] [2024-11-13 15:49:26,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:49:26,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:49:26,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:28,371 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-13 15:49:28,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:49:28,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658938484] [2024-11-13 15:49:28,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658938484] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:49:28,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:49:28,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 15:49:28,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011002491] [2024-11-13 15:49:28,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:49:28,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 15:49:28,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:49:28,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 15:49:28,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-13 15:49:28,373 INFO L87 Difference]: Start difference. First operand 534 states and 715 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-13 15:49:32,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.43s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:49:36,088 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-13 15:49:37,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:49:41,429 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-13 15:49:43,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:49:47,860 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-13 15:49:51,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-13 15:49:54,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.89s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:49:58,755 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-13 15:50:02,758 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-13 15:50:06,762 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-13 15:50:07,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:50:11,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.92s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:50:11,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:50:11,965 INFO L93 Difference]: Finished difference Result 1051 states and 1419 transitions. [2024-11-13 15:50:11,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 15:50:11,966 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-13 15:50:11,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:50:11,969 INFO L225 Difference]: With dead ends: 1051 [2024-11-13 15:50:11,969 INFO L226 Difference]: Without dead ends: 559 [2024-11-13 15:50:11,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-13 15:50:11,971 INFO L432 NwaCegarLoop]: 559 mSDtfsCounter, 82 mSDsluCounter, 3479 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 9 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 43.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 4038 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 43.5s IncrementalHoareTripleChecker+Time [2024-11-13 15:50:11,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 4038 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 677 Invalid, 7 Unknown, 0 Unchecked, 43.5s Time] [2024-11-13 15:50:11,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2024-11-13 15:50:11,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 534. [2024-11-13 15:50:11,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 511 states have (on average 1.340508806262231) internal successors, (685), 515 states have internal predecessors, (685), 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-13 15:50:11,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 715 transitions. [2024-11-13 15:50:11,992 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 715 transitions. Word has length 73 [2024-11-13 15:50:11,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:50:11,992 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 715 transitions. [2024-11-13 15:50:11,993 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-13 15:50:11,993 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 715 transitions. [2024-11-13 15:50:11,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-13 15:50:11,994 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:50:11,994 INFO L215 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-13 15:50:11,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-13 15:50:11,995 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-13 15:50:11,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:50:11,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1278573464, now seen corresponding path program 1 times [2024-11-13 15:50:11,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:50:11,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162064592] [2024-11-13 15:50:11,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:50:11,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:50:12,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:12,226 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-13 15:50:12,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:50:12,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162064592] [2024-11-13 15:50:12,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162064592] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:50:12,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:50:12,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 15:50:12,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503629533] [2024-11-13 15:50:12,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:50:12,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 15:50:12,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:50:12,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 15:50:12,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:50:12,229 INFO L87 Difference]: Start difference. First operand 534 states and 715 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 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-13 15:50:12,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:50:12,837 INFO L93 Difference]: Finished difference Result 1062 states and 1428 transitions. [2024-11-13 15:50:12,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 15:50:12,838 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 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-13 15:50:12,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:50:12,841 INFO L225 Difference]: With dead ends: 1062 [2024-11-13 15:50:12,841 INFO L226 Difference]: Without dead ends: 570 [2024-11-13 15:50:12,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-11-13 15:50:12,845 INFO L432 NwaCegarLoop]: 563 mSDtfsCounter, 100 mSDsluCounter, 2003 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 2566 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 15:50:12,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 2566 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 15:50:12,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2024-11-13 15:50:12,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 530. [2024-11-13 15:50:12,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 507 states have (on average 1.3431952662721893) internal successors, (681), 511 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-13 15:50:12,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 711 transitions. [2024-11-13 15:50:12,865 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 711 transitions. Word has length 73 [2024-11-13 15:50:12,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:50:12,865 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 711 transitions. [2024-11-13 15:50:12,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 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-13 15:50:12,868 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 711 transitions. [2024-11-13 15:50:12,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-13 15:50:12,869 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:50:12,869 INFO L215 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-13 15:50:12,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-13 15:50:12,869 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-13 15:50:12,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:50:12,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1360931232, now seen corresponding path program 1 times [2024-11-13 15:50:12,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:50:12,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853003630] [2024-11-13 15:50:12,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:50:12,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:50:12,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:13,208 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-13 15:50:13,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:50:13,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853003630] [2024-11-13 15:50:13,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853003630] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:50:13,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:50:13,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 15:50:13,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175658244] [2024-11-13 15:50:13,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:50:13,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 15:50:13,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:50:13,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 15:50:13,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-13 15:50:13,210 INFO L87 Difference]: Start difference. First operand 530 states and 711 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-13 15:50:13,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:50:13,854 INFO L93 Difference]: Finished difference Result 1032 states and 1393 transitions. [2024-11-13 15:50:13,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 15:50:13,855 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-13 15:50:13,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:50:13,858 INFO L225 Difference]: With dead ends: 1032 [2024-11-13 15:50:13,858 INFO L226 Difference]: Without dead ends: 535 [2024-11-13 15:50:13,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-13 15:50:13,861 INFO L432 NwaCegarLoop]: 566 mSDtfsCounter, 24 mSDsluCounter, 3550 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 4116 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.6s IncrementalHoareTripleChecker+Time [2024-11-13 15:50:13,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 4116 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 15:50:13,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2024-11-13 15:50:13,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 527. [2024-11-13 15:50:13,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 504 states have (on average 1.3432539682539681) internal successors, (677), 508 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-13 15:50:13,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 707 transitions. [2024-11-13 15:50:13,880 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 707 transitions. Word has length 73 [2024-11-13 15:50:13,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:50:13,881 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 707 transitions. [2024-11-13 15:50:13,881 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-13 15:50:13,881 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 707 transitions. [2024-11-13 15:50:13,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-13 15:50:13,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:50:13,882 INFO L215 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-13 15:50:13,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-13 15:50:13,883 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-13 15:50:13,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:50:13,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1659020670, now seen corresponding path program 1 times [2024-11-13 15:50:13,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:50:13,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315567780] [2024-11-13 15:50:13,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:50:13,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:50:13,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:14,163 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-13 15:50:14,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:50:14,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315567780] [2024-11-13 15:50:14,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315567780] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:50:14,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:50:14,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 15:50:14,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041934814] [2024-11-13 15:50:14,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:50:14,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 15:50:14,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:50:14,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 15:50:14,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:50:14,168 INFO L87 Difference]: Start difference. First operand 527 states and 707 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 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-13 15:50:14,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:50:14,556 INFO L93 Difference]: Finished difference Result 1025 states and 1382 transitions. [2024-11-13 15:50:14,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 15:50:14,557 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 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-13 15:50:14,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:50:14,559 INFO L225 Difference]: With dead ends: 1025 [2024-11-13 15:50:14,559 INFO L226 Difference]: Without dead ends: 531 [2024-11-13 15:50:14,560 INFO L431 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-13 15:50:14,561 INFO L432 NwaCegarLoop]: 569 mSDtfsCounter, 53 mSDsluCounter, 2540 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 3109 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.3s IncrementalHoareTripleChecker+Time [2024-11-13 15:50:14,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 3109 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 15:50:14,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2024-11-13 15:50:14,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 524. [2024-11-13 15:50:14,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 501 states have (on average 1.343313373253493) internal successors, (673), 505 states have internal predecessors, (673), 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-13 15:50:14,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 703 transitions. [2024-11-13 15:50:14,578 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 703 transitions. Word has length 73 [2024-11-13 15:50:14,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:50:14,579 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 703 transitions. [2024-11-13 15:50:14,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 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-13 15:50:14,579 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 703 transitions. [2024-11-13 15:50:14,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-13 15:50:14,580 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:50:14,580 INFO L215 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-13 15:50:14,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-13 15:50:14,580 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-13 15:50:14,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:50:14,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1776919823, now seen corresponding path program 1 times [2024-11-13 15:50:14,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:50:14,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958443532] [2024-11-13 15:50:14,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:50:14,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:50:14,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:15,291 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-13 15:50:15,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:50:15,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958443532] [2024-11-13 15:50:15,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958443532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:50:15,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:50:15,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-13 15:50:15,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187114746] [2024-11-13 15:50:15,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:50:15,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 15:50:15,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:50:15,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 15:50:15,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-13 15:50:15,295 INFO L87 Difference]: Start difference. First operand 524 states and 703 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-13 15:50:16,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:50:16,689 INFO L93 Difference]: Finished difference Result 1029 states and 1389 transitions. [2024-11-13 15:50:16,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 15:50:16,689 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-13 15:50:16,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:50:16,692 INFO L225 Difference]: With dead ends: 1029 [2024-11-13 15:50:16,692 INFO L226 Difference]: Without dead ends: 538 [2024-11-13 15:50:16,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2024-11-13 15:50:16,693 INFO L432 NwaCegarLoop]: 557 mSDtfsCounter, 68 mSDsluCounter, 4496 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 5053 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:50:16,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 5053 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 846 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-13 15:50:16,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2024-11-13 15:50:16,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 524. [2024-11-13 15:50:16,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 501 states have (on average 1.341317365269461) internal successors, (672), 505 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-13 15:50:16,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 702 transitions. [2024-11-13 15:50:16,714 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 702 transitions. Word has length 74 [2024-11-13 15:50:16,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:50:16,715 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 702 transitions. [2024-11-13 15:50:16,715 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-13 15:50:16,715 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 702 transitions. [2024-11-13 15:50:16,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-13 15:50:16,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:50:16,716 INFO L215 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-13 15:50:16,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-13 15:50:16,716 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-13 15:50:16,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:50:16,716 INFO L85 PathProgramCache]: Analyzing trace with hash 257643496, now seen corresponding path program 1 times [2024-11-13 15:50:16,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:50:16,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030863395] [2024-11-13 15:50:16,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:50:16,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:50:16,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:17,454 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-13 15:50:17,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:50:17,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030863395] [2024-11-13 15:50:17,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030863395] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:50:17,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:50:17,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-13 15:50:17,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507567888] [2024-11-13 15:50:17,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:50:17,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 15:50:17,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:50:17,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 15:50:17,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-13 15:50:17,457 INFO L87 Difference]: Start difference. First operand 524 states and 702 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-13 15:50:18,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:50:18,153 INFO L93 Difference]: Finished difference Result 1011 states and 1364 transitions. [2024-11-13 15:50:18,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 15:50:18,154 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-13 15:50:18,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:50:18,155 INFO L225 Difference]: With dead ends: 1011 [2024-11-13 15:50:18,155 INFO L226 Difference]: Without dead ends: 520 [2024-11-13 15:50:18,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-13 15:50:18,157 INFO L432 NwaCegarLoop]: 558 mSDtfsCounter, 12 mSDsluCounter, 3949 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 4507 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 15:50:18,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 4507 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 15:50:18,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2024-11-13 15:50:18,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 510. [2024-11-13 15:50:18,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 487 states have (on average 1.3470225872689938) internal successors, (656), 491 states have internal predecessors, (656), 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-13 15:50:18,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 686 transitions. [2024-11-13 15:50:18,180 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 686 transitions. Word has length 74 [2024-11-13 15:50:18,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:50:18,180 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 686 transitions. [2024-11-13 15:50:18,180 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-13 15:50:18,180 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 686 transitions. [2024-11-13 15:50:18,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-13 15:50:18,181 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:50:18,181 INFO L215 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-13 15:50:18,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-13 15:50:18,185 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-13 15:50:18,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:50:18,186 INFO L85 PathProgramCache]: Analyzing trace with hash 2072964239, now seen corresponding path program 1 times [2024-11-13 15:50:18,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:50:18,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822991088] [2024-11-13 15:50:18,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:50:18,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:50:18,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:18,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-13 15:50:18,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:50:18,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822991088] [2024-11-13 15:50:18,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822991088] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:50:18,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:50:18,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 15:50:18,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600244425] [2024-11-13 15:50:18,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:50:18,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 15:50:18,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:50:18,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 15:50:18,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-13 15:50:18,587 INFO L87 Difference]: Start difference. First operand 510 states and 686 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-13 15:50:19,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:50:19,142 INFO L93 Difference]: Finished difference Result 1003 states and 1354 transitions. [2024-11-13 15:50:19,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 15:50:19,143 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-13 15:50:19,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:50:19,145 INFO L225 Difference]: With dead ends: 1003 [2024-11-13 15:50:19,145 INFO L226 Difference]: Without dead ends: 526 [2024-11-13 15:50:19,146 INFO L431 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-13 15:50:19,147 INFO L432 NwaCegarLoop]: 559 mSDtfsCounter, 13 mSDsluCounter, 4001 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 4560 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 15:50:19,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 4560 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 15:50:19,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2024-11-13 15:50:19,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 521. [2024-11-13 15:50:19,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 498 states have (on average 1.3413654618473896) internal successors, (668), 502 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-13 15:50:19,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 698 transitions. [2024-11-13 15:50:19,165 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 698 transitions. Word has length 74 [2024-11-13 15:50:19,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:50:19,166 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 698 transitions. [2024-11-13 15:50:19,166 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-13 15:50:19,166 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 698 transitions. [2024-11-13 15:50:19,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-13 15:50:19,167 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:50:19,167 INFO L215 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-13 15:50:19,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-13 15:50:19,167 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-13 15:50:19,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:50:19,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1673812551, now seen corresponding path program 1 times [2024-11-13 15:50:19,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:50:19,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609797501] [2024-11-13 15:50:19,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:50:19,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:50:19,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:19,710 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-13 15:50:19,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:50:19,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609797501] [2024-11-13 15:50:19,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609797501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:50:19,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:50:19,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-13 15:50:19,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462019786] [2024-11-13 15:50:19,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:50:19,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 15:50:19,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:50:19,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 15:50:19,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2024-11-13 15:50:19,712 INFO L87 Difference]: Start difference. First operand 521 states and 698 transitions. Second operand has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 14 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-13 15:50:24,043 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-13 15:50:24,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:50:24,845 INFO L93 Difference]: Finished difference Result 1033 states and 1392 transitions. [2024-11-13 15:50:24,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 15:50:24,846 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 14 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-13 15:50:24,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:50:24,849 INFO L225 Difference]: With dead ends: 1033 [2024-11-13 15:50:24,849 INFO L226 Difference]: Without dead ends: 545 [2024-11-13 15:50:24,850 INFO L431 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-13 15:50:24,850 INFO L432 NwaCegarLoop]: 564 mSDtfsCounter, 48 mSDsluCounter, 6042 mSDsCounter, 0 mSdLazyCounter, 1301 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 6606 SdHoareTripleChecker+Invalid, 1304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1301 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:50:24,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 6606 Invalid, 1304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1301 Invalid, 1 Unknown, 0 Unchecked, 5.0s Time] [2024-11-13 15:50:24,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2024-11-13 15:50:24,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 521. [2024-11-13 15:50:24,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 498 states have (on average 1.3413654618473896) internal successors, (668), 502 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-13 15:50:24,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 698 transitions. [2024-11-13 15:50:24,869 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 698 transitions. Word has length 74 [2024-11-13 15:50:24,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:50:24,869 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 698 transitions. [2024-11-13 15:50:24,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 14 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-13 15:50:24,870 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 698 transitions. [2024-11-13 15:50:24,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-13 15:50:24,870 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:50:24,870 INFO L215 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-13 15:50:24,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-13 15:50:24,871 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-13 15:50:24,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:50:24,871 INFO L85 PathProgramCache]: Analyzing trace with hash -826976691, now seen corresponding path program 1 times [2024-11-13 15:50:24,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:50:24,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520787766] [2024-11-13 15:50:24,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:50:24,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:50:24,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:25,228 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-13 15:50:25,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:50:25,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520787766] [2024-11-13 15:50:25,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520787766] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:50:25,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:50:25,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-13 15:50:25,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147051009] [2024-11-13 15:50:25,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:50:25,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 15:50:25,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:50:25,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 15:50:25,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-13 15:50:25,230 INFO L87 Difference]: Start difference. First operand 521 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-13 15:50:26,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:50:26,108 INFO L93 Difference]: Finished difference Result 1021 states and 1378 transitions. [2024-11-13 15:50:26,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 15:50:26,108 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-13 15:50:26,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:50:26,111 INFO L225 Difference]: With dead ends: 1021 [2024-11-13 15:50:26,111 INFO L226 Difference]: Without dead ends: 533 [2024-11-13 15:50:26,111 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-13 15:50:26,112 INFO L432 NwaCegarLoop]: 554 mSDtfsCounter, 17 mSDsluCounter, 4980 mSDsCounter, 0 mSdLazyCounter, 958 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 5534 SdHoareTripleChecker+Invalid, 959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-13 15:50:26,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 5534 Invalid, 959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 958 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-13 15:50:26,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2024-11-13 15:50:26,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 519. [2024-11-13 15:50:26,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 496 states have (on average 1.340725806451613) internal successors, (665), 500 states have internal predecessors, (665), 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-13 15:50:26,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 695 transitions. [2024-11-13 15:50:26,130 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 695 transitions. Word has length 74 [2024-11-13 15:50:26,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:50:26,130 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 695 transitions. [2024-11-13 15:50:26,130 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-13 15:50:26,130 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 695 transitions. [2024-11-13 15:50:26,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-13 15:50:26,131 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:50:26,131 INFO L215 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-13 15:50:26,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-13 15:50:26,132 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-13 15:50:26,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:50:26,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1233465825, now seen corresponding path program 1 times [2024-11-13 15:50:26,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:50:26,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13377492] [2024-11-13 15:50:26,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:50:26,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:50:26,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:26,431 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-13 15:50:26,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:50:26,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13377492] [2024-11-13 15:50:26,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13377492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:50:26,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:50:26,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 15:50:26,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97383151] [2024-11-13 15:50:26,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:50:26,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 15:50:26,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:50:26,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 15:50:26,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-13 15:50:26,433 INFO L87 Difference]: Start difference. First operand 519 states and 695 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-13 15:50:27,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:50:27,005 INFO L93 Difference]: Finished difference Result 1014 states and 1367 transitions. [2024-11-13 15:50:27,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 15:50:27,005 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-13 15:50:27,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:50:27,008 INFO L225 Difference]: With dead ends: 1014 [2024-11-13 15:50:27,008 INFO L226 Difference]: Without dead ends: 528 [2024-11-13 15:50:27,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-13 15:50:27,009 INFO L432 NwaCegarLoop]: 554 mSDtfsCounter, 48 mSDsluCounter, 3975 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 4529 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.5s IncrementalHoareTripleChecker+Time [2024-11-13 15:50:27,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 4529 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 15:50:27,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2024-11-13 15:50:27,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 517. [2024-11-13 15:50:27,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 494 states have (on average 1.3400809716599191) internal successors, (662), 498 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-13 15:50:27,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 692 transitions. [2024-11-13 15:50:27,023 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 692 transitions. Word has length 74 [2024-11-13 15:50:27,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:50:27,023 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 692 transitions. [2024-11-13 15:50:27,024 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-13 15:50:27,024 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 692 transitions. [2024-11-13 15:50:27,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-13 15:50:27,025 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:50:27,025 INFO L215 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-13 15:50:27,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-13 15:50:27,025 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-13 15:50:27,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:50:27,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1647374805, now seen corresponding path program 1 times [2024-11-13 15:50:27,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:50:27,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190155063] [2024-11-13 15:50:27,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:50:27,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:50:27,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:27,356 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-13 15:50:27,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:50:27,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190155063] [2024-11-13 15:50:27,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190155063] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:50:27,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:50:27,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-13 15:50:27,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25337178] [2024-11-13 15:50:27,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:50:27,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 15:50:27,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:50:27,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 15:50:27,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-13 15:50:27,358 INFO L87 Difference]: Start difference. First operand 517 states and 692 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-13 15:50:28,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:50:28,100 INFO L93 Difference]: Finished difference Result 1019 states and 1371 transitions. [2024-11-13 15:50:28,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 15:50:28,101 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-13 15:50:28,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:50:28,102 INFO L225 Difference]: With dead ends: 1019 [2024-11-13 15:50:28,103 INFO L226 Difference]: Without dead ends: 535 [2024-11-13 15:50:28,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-11-13 15:50:28,104 INFO L432 NwaCegarLoop]: 571 mSDtfsCounter, 46 mSDsluCounter, 4559 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 5130 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 15:50:28,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 5130 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 15:50:28,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2024-11-13 15:50:28,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 517. [2024-11-13 15:50:28,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 494 states have (on average 1.3400809716599191) internal successors, (662), 498 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-13 15:50:28,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 692 transitions. [2024-11-13 15:50:28,116 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 692 transitions. Word has length 74 [2024-11-13 15:50:28,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:50:28,117 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 692 transitions. [2024-11-13 15:50:28,117 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-13 15:50:28,117 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 692 transitions. [2024-11-13 15:50:28,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-13 15:50:28,117 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:50:28,118 INFO L215 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-13 15:50:28,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-13 15:50:28,118 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-13 15:50:28,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:50:28,118 INFO L85 PathProgramCache]: Analyzing trace with hash 2138619335, now seen corresponding path program 1 times [2024-11-13 15:50:28,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:50:28,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119728061] [2024-11-13 15:50:28,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:50:28,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:50:28,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:28,767 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-13 15:50:28,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:50:28,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119728061] [2024-11-13 15:50:28,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119728061] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:50:28,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:50:28,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-13 15:50:28,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977965064] [2024-11-13 15:50:28,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:50:28,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-13 15:50:28,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:50:28,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-13 15:50:28,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-13 15:50:28,768 INFO L87 Difference]: Start difference. First operand 517 states and 692 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-13 15:50:30,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:50:31,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:50:31,042 INFO L93 Difference]: Finished difference Result 1027 states and 1386 transitions. [2024-11-13 15:50:31,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 15:50:31,042 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-13 15:50:31,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:50:31,045 INFO L225 Difference]: With dead ends: 1027 [2024-11-13 15:50:31,045 INFO L226 Difference]: Without dead ends: 543 [2024-11-13 15:50:31,046 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 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-13 15:50:31,047 INFO L432 NwaCegarLoop]: 541 mSDtfsCounter, 27 mSDsluCounter, 5443 mSDsCounter, 0 mSdLazyCounter, 1027 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 5984 SdHoareTripleChecker+Invalid, 1032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:50:31,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 5984 Invalid, 1032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1027 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-13 15:50:31,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2024-11-13 15:50:31,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 527. [2024-11-13 15:50:31,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 504 states have (on average 1.3392857142857142) internal successors, (675), 508 states have internal predecessors, (675), 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-13 15:50:31,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 705 transitions. [2024-11-13 15:50:31,067 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 705 transitions. Word has length 74 [2024-11-13 15:50:31,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:50:31,068 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 705 transitions. [2024-11-13 15:50:31,068 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-13 15:50:31,068 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 705 transitions. [2024-11-13 15:50:31,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-13 15:50:31,069 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:50:31,069 INFO L215 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-13 15:50:31,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-13 15:50:31,069 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-13 15:50:31,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:50:31,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1022734624, now seen corresponding path program 1 times [2024-11-13 15:50:31,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:50:31,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073132758] [2024-11-13 15:50:31,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:50:31,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:50:31,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat