./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-10.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e6ad9e-6abf-4ef7-9387-141ddca55e06/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e6ad9e-6abf-4ef7-9387-141ddca55e06/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e6ad9e-6abf-4ef7-9387-141ddca55e06/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e6ad9e-6abf-4ef7-9387-141ddca55e06/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-10.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e6ad9e-6abf-4ef7-9387-141ddca55e06/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e6ad9e-6abf-4ef7-9387-141ddca55e06/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4d936c2bc359502c9cc80babbbddc5f5ec41bb334054fc0df7f5bb21f4158f99 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:16:19,553 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:16:19,614 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e6ad9e-6abf-4ef7-9387-141ddca55e06/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 00:16:19,619 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:16:19,619 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:16:19,641 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:16:19,642 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:16:19,642 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:16:19,643 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 00:16:19,643 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 00:16:19,644 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:16:19,644 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:16:19,645 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:16:19,646 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:16:19,646 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:16:19,647 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:16:19,647 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 00:16:19,648 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 00:16:19,649 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 00:16:19,649 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 00:16:19,649 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:16:19,650 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 00:16:19,651 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:16:19,651 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 00:16:19,652 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 00:16:19,652 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 00:16:19,652 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:16:19,653 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:16:19,653 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:16:19,654 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 00:16:19,654 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:16:19,655 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:16:19,655 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:16:19,656 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:16:19,656 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 00:16:19,656 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 00:16:19,656 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 00:16:19,664 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:16:19,664 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:16:19,665 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 00:16:19,665 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:16:19,665 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:16:19,665 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e6ad9e-6abf-4ef7-9387-141ddca55e06/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e6ad9e-6abf-4ef7-9387-141ddca55e06/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4d936c2bc359502c9cc80babbbddc5f5ec41bb334054fc0df7f5bb21f4158f99 [2023-11-29 00:16:19,899 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:16:19,919 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:16:19,922 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:16:19,923 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:16:19,923 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:16:19,924 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e6ad9e-6abf-4ef7-9387-141ddca55e06/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-10.i [2023-11-29 00:16:22,646 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:16:22,818 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:16:22,819 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e6ad9e-6abf-4ef7-9387-141ddca55e06/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-10.i [2023-11-29 00:16:22,829 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e6ad9e-6abf-4ef7-9387-141ddca55e06/bin/uautomizer-verify-BQ2R08f2Ya/data/6d1e0ab09/8dc81432ef0b42ae9ec2872b27469115/FLAG20f9b9e70 [2023-11-29 00:16:22,841 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e6ad9e-6abf-4ef7-9387-141ddca55e06/bin/uautomizer-verify-BQ2R08f2Ya/data/6d1e0ab09/8dc81432ef0b42ae9ec2872b27469115 [2023-11-29 00:16:22,843 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:16:22,844 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:16:22,845 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:16:22,846 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:16:22,851 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:16:22,851 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:16:22" (1/1) ... [2023-11-29 00:16:22,852 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49ec25dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:16:22, skipping insertion in model container [2023-11-29 00:16:22,852 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:16:22" (1/1) ... [2023-11-29 00:16:22,883 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:16:22,999 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e6ad9e-6abf-4ef7-9387-141ddca55e06/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-10.i[915,928] [2023-11-29 00:16:23,072 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:16:23,084 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 00:16:23,094 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e6ad9e-6abf-4ef7-9387-141ddca55e06/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-10.i[915,928] [2023-11-29 00:16:23,131 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:16:23,145 INFO L206 MainTranslator]: Completed translation [2023-11-29 00:16:23,146 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:16:23 WrapperNode [2023-11-29 00:16:23,146 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:16:23,147 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 00:16:23,147 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 00:16:23,147 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 00:16:23,152 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:16:23" (1/1) ... [2023-11-29 00:16:23,165 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:16:23" (1/1) ... [2023-11-29 00:16:23,211 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 230 [2023-11-29 00:16:23,212 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 00:16:23,212 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 00:16:23,212 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 00:16:23,212 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 00:16:23,221 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:16:23" (1/1) ... [2023-11-29 00:16:23,221 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:16:23" (1/1) ... [2023-11-29 00:16:23,226 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:16:23" (1/1) ... [2023-11-29 00:16:23,247 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-29 00:16:23,247 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:16:23" (1/1) ... [2023-11-29 00:16:23,248 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:16:23" (1/1) ... [2023-11-29 00:16:23,262 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:16:23" (1/1) ... [2023-11-29 00:16:23,266 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:16:23" (1/1) ... [2023-11-29 00:16:23,270 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:16:23" (1/1) ... [2023-11-29 00:16:23,274 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:16:23" (1/1) ... [2023-11-29 00:16:23,279 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 00:16:23,280 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 00:16:23,281 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 00:16:23,281 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 00:16:23,282 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:16:23" (1/1) ... [2023-11-29 00:16:23,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:16:23,296 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e6ad9e-6abf-4ef7-9387-141ddca55e06/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:16:23,309 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e6ad9e-6abf-4ef7-9387-141ddca55e06/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 00:16:23,322 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e6ad9e-6abf-4ef7-9387-141ddca55e06/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 00:16:23,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 00:16:23,347 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 00:16:23,347 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 00:16:23,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 00:16:23,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 00:16:23,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 00:16:23,437 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 00:16:23,439 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 00:16:23,857 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 00:16:23,889 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 00:16:23,890 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 00:16:23,890 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:16:23 BoogieIcfgContainer [2023-11-29 00:16:23,890 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 00:16:23,893 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 00:16:23,893 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 00:16:23,895 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 00:16:23,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:16:22" (1/3) ... [2023-11-29 00:16:23,896 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37c61aef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:16:23, skipping insertion in model container [2023-11-29 00:16:23,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:16:23" (2/3) ... [2023-11-29 00:16:23,897 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37c61aef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:16:23, skipping insertion in model container [2023-11-29 00:16:23,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:16:23" (3/3) ... [2023-11-29 00:16:23,898 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-10.i [2023-11-29 00:16:23,913 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 00:16:23,913 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 00:16:23,958 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:16:23,964 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@59a072b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:16:23,964 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 00:16:23,968 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 61 states have internal predecessors, (85), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-29 00:16:23,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2023-11-29 00:16:23,985 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:16:23,986 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:16:23,986 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:16:23,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:16:23,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1839602287, now seen corresponding path program 1 times [2023-11-29 00:16:23,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:16:23,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007444513] [2023-11-29 00:16:23,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:16:23,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:16:24,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:24,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:16:24,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:24,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:16:24,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:24,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:16:24,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:24,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 00:16:24,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:24,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 00:16:24,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:24,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:16:24,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:24,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:16:24,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:24,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 00:16:24,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:24,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 00:16:24,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:24,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 00:16:24,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:24,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:16:24,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:24,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:16:24,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:24,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:16:24,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:24,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 00:16:24,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:24,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 00:16:24,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:24,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 00:16:24,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:24,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 00:16:24,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:24,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 00:16:24,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:24,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:16:24,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:24,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 00:16:24,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:24,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 00:16:24,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:24,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 00:16:24,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:24,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-29 00:16:24,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:24,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-11-29 00:16:24,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:24,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-11-29 00:16:24,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:24,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-11-29 00:16:24,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:24,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-11-29 00:16:24,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:24,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-29 00:16:24,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:24,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-11-29 00:16:24,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:24,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2023-11-29 00:16:24,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:24,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-11-29 00:16:24,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:24,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2023-11-29 00:16:24,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:24,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2023-11-29 00:16:24,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:16:24,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007444513] [2023-11-29 00:16:24,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007444513] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:16:24,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:16:24,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:16:24,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716387719] [2023-11-29 00:16:24,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:16:24,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 00:16:24,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:16:24,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 00:16:24,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 00:16:24,499 INFO L87 Difference]: Start difference. First operand has 95 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 61 states have internal predecessors, (85), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2023-11-29 00:16:24,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:16:24,543 INFO L93 Difference]: Finished difference Result 187 states and 328 transitions. [2023-11-29 00:16:24,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 00:16:24,546 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) Word has length 204 [2023-11-29 00:16:24,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:16:24,555 INFO L225 Difference]: With dead ends: 187 [2023-11-29 00:16:24,555 INFO L226 Difference]: Without dead ends: 93 [2023-11-29 00:16:24,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 00:16:24,563 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:16:24,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:16:24,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-11-29 00:16:24,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2023-11-29 00:16:24,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 59 states have (on average 1.3559322033898304) internal successors, (80), 59 states have internal predecessors, (80), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-29 00:16:24,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 144 transitions. [2023-11-29 00:16:24,616 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 144 transitions. Word has length 204 [2023-11-29 00:16:24,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:16:24,616 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 144 transitions. [2023-11-29 00:16:24,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2023-11-29 00:16:24,617 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 144 transitions. [2023-11-29 00:16:24,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2023-11-29 00:16:24,622 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:16:24,623 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:16:24,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 00:16:24,623 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:16:24,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:16:24,624 INFO L85 PathProgramCache]: Analyzing trace with hash -299177455, now seen corresponding path program 1 times [2023-11-29 00:16:24,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:16:24,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133000106] [2023-11-29 00:16:24,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:16:24,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:16:24,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:25,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:16:25,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:25,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:16:25,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:25,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:16:25,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:25,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 00:16:25,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:25,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 00:16:25,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:25,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:16:25,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:25,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:16:25,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:25,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 00:16:25,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:25,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 00:16:25,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:25,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 00:16:25,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:25,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:16:25,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:25,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:16:25,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:25,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:16:25,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:25,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 00:16:25,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:25,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 00:16:25,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:25,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 00:16:25,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:25,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 00:16:25,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:25,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 00:16:25,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:25,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:16:25,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:25,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 00:16:25,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:25,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 00:16:25,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:25,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 00:16:25,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:25,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-29 00:16:25,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:25,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-11-29 00:16:25,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:25,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-11-29 00:16:25,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:25,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-11-29 00:16:25,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:25,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-11-29 00:16:25,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:25,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-29 00:16:25,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:25,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-11-29 00:16:25,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:25,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2023-11-29 00:16:25,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:25,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-11-29 00:16:25,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:25,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2023-11-29 00:16:25,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:25,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2023-11-29 00:16:25,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:16:25,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133000106] [2023-11-29 00:16:25,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133000106] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:16:25,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:16:25,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:16:25,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638517593] [2023-11-29 00:16:25,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:16:25,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:16:25,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:16:25,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:16:25,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:16:25,236 INFO L87 Difference]: Start difference. First operand 93 states and 144 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-11-29 00:16:25,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:16:25,473 INFO L93 Difference]: Finished difference Result 278 states and 431 transitions. [2023-11-29 00:16:25,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:16:25,473 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 204 [2023-11-29 00:16:25,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:16:25,478 INFO L225 Difference]: With dead ends: 278 [2023-11-29 00:16:25,478 INFO L226 Difference]: Without dead ends: 186 [2023-11-29 00:16:25,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 00:16:25,481 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 118 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:16:25,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 546 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 00:16:25,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2023-11-29 00:16:25,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 157. [2023-11-29 00:16:25,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 90 states have (on average 1.2777777777777777) internal successors, (115), 90 states have internal predecessors, (115), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2023-11-29 00:16:25,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 243 transitions. [2023-11-29 00:16:25,521 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 243 transitions. Word has length 204 [2023-11-29 00:16:25,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:16:25,523 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 243 transitions. [2023-11-29 00:16:25,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-11-29 00:16:25,523 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 243 transitions. [2023-11-29 00:16:25,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2023-11-29 00:16:25,527 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:16:25,527 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:16:25,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 00:16:25,528 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:16:25,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:16:25,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1107695185, now seen corresponding path program 1 times [2023-11-29 00:16:25,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:16:25,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993502297] [2023-11-29 00:16:25,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:16:25,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:16:25,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:53,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:16:53,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:53,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:16:53,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:53,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:16:53,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:53,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 00:16:53,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:53,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 00:16:53,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:53,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:16:53,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:53,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:16:53,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:53,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 00:16:53,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:53,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 00:16:53,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:53,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 00:16:53,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:53,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:16:53,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:53,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:16:53,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:53,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:16:53,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:53,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 00:16:53,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:53,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 00:16:53,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:53,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 00:16:53,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:53,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 00:16:53,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:53,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 00:16:53,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:53,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:16:53,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:53,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 00:16:53,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:53,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 00:16:53,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:53,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 00:16:53,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:53,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-29 00:16:53,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:53,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-11-29 00:16:53,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:53,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-11-29 00:16:53,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:53,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-11-29 00:16:53,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:53,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-11-29 00:16:53,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:53,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-29 00:16:53,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:53,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-11-29 00:16:53,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:53,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2023-11-29 00:16:53,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:53,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-11-29 00:16:53,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:53,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2023-11-29 00:16:53,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:53,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2023-11-29 00:16:53,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:16:53,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993502297] [2023-11-29 00:16:53,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993502297] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:16:53,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:16:53,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 00:16:53,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971441865] [2023-11-29 00:16:53,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:16:53,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 00:16:53,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:16:53,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 00:16:53,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-11-29 00:16:53,977 INFO L87 Difference]: Start difference. First operand 157 states and 243 transitions. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-11-29 00:16:58,631 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 [] [2023-11-29 00:17:00,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:17:03,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.73s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:17:05,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:17:05,416 INFO L93 Difference]: Finished difference Result 428 states and 652 transitions. [2023-11-29 00:17:05,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-29 00:17:05,417 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 205 [2023-11-29 00:17:05,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:17:05,420 INFO L225 Difference]: With dead ends: 428 [2023-11-29 00:17:05,420 INFO L226 Difference]: Without dead ends: 336 [2023-11-29 00:17:05,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2023-11-29 00:17:05,423 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 349 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 111 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:17:05,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 824 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 737 Invalid, 1 Unknown, 0 Unchecked, 10.2s Time] [2023-11-29 00:17:05,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2023-11-29 00:17:05,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 257. [2023-11-29 00:17:05,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 156 states have (on average 1.294871794871795) internal successors, (202), 157 states have internal predecessors, (202), 96 states have call successors, (96), 4 states have call predecessors, (96), 4 states have return successors, (96), 95 states have call predecessors, (96), 96 states have call successors, (96) [2023-11-29 00:17:05,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 394 transitions. [2023-11-29 00:17:05,482 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 394 transitions. Word has length 205 [2023-11-29 00:17:05,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:17:05,484 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 394 transitions. [2023-11-29 00:17:05,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-11-29 00:17:05,484 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 394 transitions. [2023-11-29 00:17:05,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2023-11-29 00:17:05,487 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:17:05,488 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:17:05,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 00:17:05,488 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:17:05,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:17:05,489 INFO L85 PathProgramCache]: Analyzing trace with hash 298348559, now seen corresponding path program 1 times [2023-11-29 00:17:05,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:17:05,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856727141] [2023-11-29 00:17:05,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:17:05,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:17:05,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:20:02,759 WARN L293 SmtUtils]: Spent 5.39s on a formula simplification. DAG size of input: 166 DAG size of output: 143 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 00:20:02,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:20:02,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:20:02,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:20:02,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:20:02,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:20:02,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:20:02,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 00:20:02,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:20:02,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 00:20:02,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:20:02,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:20:02,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:20:02,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:20:02,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:20:02,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 00:20:02,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:20:02,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 00:20:02,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:20:02,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 00:20:02,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:20:02,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:20:02,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:20:02,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:20:02,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:20:02,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:20:02,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:20:02,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 00:20:02,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:20:02,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 00:20:02,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:20:02,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 00:20:02,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:20:02,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 00:20:02,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:20:02,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 00:20:02,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:20:02,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:20:02,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:20:02,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 00:20:02,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:20:02,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 00:20:02,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:20:02,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 00:20:02,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:20:02,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-29 00:20:02,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:20:02,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-11-29 00:20:02,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:20:02,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-11-29 00:20:02,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:20:02,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-11-29 00:20:02,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:20:02,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-11-29 00:20:02,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:20:02,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-29 00:20:02,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:20:02,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-11-29 00:20:02,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:20:02,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2023-11-29 00:20:02,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:20:02,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-11-29 00:20:02,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:20:02,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2023-11-29 00:20:02,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:20:02,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2023-11-29 00:20:02,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:20:02,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856727141] [2023-11-29 00:20:02,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856727141] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:20:02,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:20:02,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-29 00:20:02,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522674300] [2023-11-29 00:20:02,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:20:02,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 00:20:02,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:20:02,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 00:20:02,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2023-11-29 00:20:02,885 INFO L87 Difference]: Start difference. First operand 257 states and 394 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-11-29 00:20:07,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:20:07,901 INFO L93 Difference]: Finished difference Result 532 states and 804 transitions. [2023-11-29 00:20:07,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 00:20:07,902 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 205 [2023-11-29 00:20:07,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:20:07,906 INFO L225 Difference]: With dead ends: 532 [2023-11-29 00:20:07,907 INFO L226 Difference]: Without dead ends: 332 [2023-11-29 00:20:07,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=187, Invalid=569, Unknown=0, NotChecked=0, Total=756 [2023-11-29 00:20:07,909 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 468 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-29 00:20:07,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 784 Invalid, 831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-11-29 00:20:07,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2023-11-29 00:20:07,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 260. [2023-11-29 00:20:07,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 159 states have (on average 1.2893081761006289) internal successors, (205), 160 states have internal predecessors, (205), 96 states have call successors, (96), 4 states have call predecessors, (96), 4 states have return successors, (96), 95 states have call predecessors, (96), 96 states have call successors, (96) [2023-11-29 00:20:07,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 397 transitions. [2023-11-29 00:20:07,939 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 397 transitions. Word has length 205 [2023-11-29 00:20:07,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:20:07,940 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 397 transitions. [2023-11-29 00:20:07,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-11-29 00:20:07,941 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 397 transitions. [2023-11-29 00:20:07,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2023-11-29 00:20:07,943 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:20:07,943 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:20:07,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 00:20:07,943 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:20:07,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:20:07,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1624848209, now seen corresponding path program 1 times [2023-11-29 00:20:07,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:20:07,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493636074] [2023-11-29 00:20:07,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:20:07,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:20:08,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:22:59,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:22:59,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:22:59,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:22:59,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:22:59,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:22:59,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:22:59,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 00:22:59,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:22:59,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 00:22:59,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:22:59,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:22:59,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:22:59,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:22:59,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:22:59,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 00:22:59,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:22:59,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 00:22:59,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:22:59,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 00:22:59,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:22:59,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:22:59,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:22:59,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:22:59,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:22:59,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:22:59,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:22:59,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 00:22:59,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:22:59,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 00:22:59,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:22:59,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 00:22:59,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:22:59,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 00:22:59,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:22:59,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 00:22:59,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:22:59,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:22:59,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:22:59,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 00:22:59,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:22:59,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 00:22:59,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:22:59,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 00:22:59,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:22:59,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-29 00:22:59,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:22:59,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-11-29 00:22:59,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:22:59,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-11-29 00:22:59,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:22:59,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-11-29 00:22:59,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:22:59,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-11-29 00:22:59,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:22:59,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-29 00:22:59,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:22:59,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-11-29 00:22:59,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:22:59,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2023-11-29 00:22:59,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:22:59,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-11-29 00:22:59,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:22:59,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2023-11-29 00:22:59,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:22:59,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2023-11-29 00:22:59,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:22:59,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493636074] [2023-11-29 00:22:59,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493636074] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:22:59,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:22:59,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 00:22:59,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966772866] [2023-11-29 00:22:59,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:22:59,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 00:22:59,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:22:59,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 00:22:59,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2023-11-29 00:22:59,278 INFO L87 Difference]: Start difference. First operand 260 states and 397 transitions. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-11-29 00:23:04,336 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 [] [2023-11-29 00:23:08,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.86s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:23:09,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:23:09,359 INFO L93 Difference]: Finished difference Result 408 states and 617 transitions. [2023-11-29 00:23:09,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-29 00:23:09,360 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 205 [2023-11-29 00:23:09,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:23:09,362 INFO L225 Difference]: With dead ends: 408 [2023-11-29 00:23:09,362 INFO L226 Difference]: Without dead ends: 316 [2023-11-29 00:23:09,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=139, Invalid=413, Unknown=0, NotChecked=0, Total=552 [2023-11-29 00:23:09,363 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 348 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 101 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:23:09,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 678 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 519 Invalid, 1 Unknown, 0 Unchecked, 8.2s Time] [2023-11-29 00:23:09,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2023-11-29 00:23:09,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 258. [2023-11-29 00:23:09,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 157 states have (on average 1.286624203821656) internal successors, (202), 158 states have internal predecessors, (202), 96 states have call successors, (96), 4 states have call predecessors, (96), 4 states have return successors, (96), 95 states have call predecessors, (96), 96 states have call successors, (96) [2023-11-29 00:23:09,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 394 transitions. [2023-11-29 00:23:09,388 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 394 transitions. Word has length 205 [2023-11-29 00:23:09,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:23:09,389 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 394 transitions. [2023-11-29 00:23:09,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-11-29 00:23:09,389 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 394 transitions. [2023-11-29 00:23:09,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2023-11-29 00:23:09,392 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:23:09,392 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:23:09,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 00:23:09,392 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:23:09,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:23:09,393 INFO L85 PathProgramCache]: Analyzing trace with hash -981515119, now seen corresponding path program 1 times [2023-11-29 00:23:09,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:23:09,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897214212] [2023-11-29 00:23:09,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:23:09,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:23:09,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:24,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:24:24,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:24,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:24:24,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:24,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:24:24,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:24,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 00:24:24,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:24,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 00:24:24,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:24,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:24:24,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:24,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:24:24,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:24,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 00:24:24,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:24,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 00:24:24,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:24,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 00:24:24,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:24,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:24:24,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:24,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:24:24,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:24,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:24:24,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:24,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 00:24:24,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:24,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 00:24:24,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:24,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 00:24:24,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:24,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 00:24:24,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:24,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 00:24:24,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:24,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:24:24,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:24,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 00:24:24,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:24,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 00:24:24,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:24,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 00:24:24,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:24,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-29 00:24:24,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:24,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-11-29 00:24:24,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:24,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-11-29 00:24:24,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:24,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-11-29 00:24:24,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:24,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-11-29 00:24:24,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:24,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-29 00:24:24,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:24,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-11-29 00:24:24,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:24,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2023-11-29 00:24:24,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:24,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-11-29 00:24:24,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:24,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2023-11-29 00:24:24,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:24,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2023-11-29 00:24:24,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:24:24,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897214212] [2023-11-29 00:24:24,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897214212] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:24:24,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:24:24,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-29 00:24:24,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490255261] [2023-11-29 00:24:24,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:24:24,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 00:24:24,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:24:24,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 00:24:24,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2023-11-29 00:24:24,967 INFO L87 Difference]: Start difference. First operand 258 states and 394 transitions. Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2023-11-29 00:24:28,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:24:30,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:24:30,574 INFO L93 Difference]: Finished difference Result 523 states and 783 transitions. [2023-11-29 00:24:30,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-29 00:24:30,574 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 205 [2023-11-29 00:24:30,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:24:30,578 INFO L225 Difference]: With dead ends: 523 [2023-11-29 00:24:30,578 INFO L226 Difference]: Without dead ends: 322 [2023-11-29 00:24:30,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=243, Invalid=569, Unknown=0, NotChecked=0, Total=812 [2023-11-29 00:24:30,580 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 362 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2023-11-29 00:24:30,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 950 Invalid, 927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2023-11-29 00:24:30,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2023-11-29 00:24:30,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 268. [2023-11-29 00:24:30,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 165 states have (on average 1.2727272727272727) internal successors, (210), 166 states have internal predecessors, (210), 96 states have call successors, (96), 6 states have call predecessors, (96), 6 states have return successors, (96), 95 states have call predecessors, (96), 96 states have call successors, (96) [2023-11-29 00:24:30,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 402 transitions. [2023-11-29 00:24:30,607 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 402 transitions. Word has length 205 [2023-11-29 00:24:30,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:24:30,608 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 402 transitions. [2023-11-29 00:24:30,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2023-11-29 00:24:30,608 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 402 transitions. [2023-11-29 00:24:30,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2023-11-29 00:24:30,610 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:24:30,610 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:24:30,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 00:24:30,610 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:24:30,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:24:30,611 INFO L85 PathProgramCache]: Analyzing trace with hash -480652717, now seen corresponding path program 1 times [2023-11-29 00:24:30,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:24:30,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797172874] [2023-11-29 00:24:30,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:24:30,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:24:30,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:42,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:24:42,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:42,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:24:42,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:42,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:24:42,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:42,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 00:24:42,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:42,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 00:24:42,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:42,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:24:42,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:42,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:24:42,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:42,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 00:24:42,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:42,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 00:24:42,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:42,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 00:24:42,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:42,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:24:42,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:42,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:24:42,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:42,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:24:42,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:42,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 00:24:42,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:42,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 00:24:42,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:42,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 00:24:42,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:42,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 00:24:42,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:42,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 00:24:42,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:42,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:24:42,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:42,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 00:24:42,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:42,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 00:24:42,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:42,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 00:24:42,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:42,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-29 00:24:42,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:42,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-11-29 00:24:42,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:42,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-11-29 00:24:42,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:42,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-11-29 00:24:42,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:42,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-11-29 00:24:42,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:42,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-29 00:24:42,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:42,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-11-29 00:24:42,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:42,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2023-11-29 00:24:42,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:42,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-11-29 00:24:42,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:42,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2023-11-29 00:24:42,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:42,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2023-11-29 00:24:42,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:24:42,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797172874] [2023-11-29 00:24:42,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797172874] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:24:42,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:24:42,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-29 00:24:42,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186692671] [2023-11-29 00:24:42,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:24:42,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 00:24:42,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:24:42,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 00:24:42,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-11-29 00:24:42,680 INFO L87 Difference]: Start difference. First operand 268 states and 402 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-11-29 00:24:45,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:24:47,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:24:47,020 INFO L93 Difference]: Finished difference Result 516 states and 775 transitions. [2023-11-29 00:24:47,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 00:24:47,021 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 205 [2023-11-29 00:24:47,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:24:47,025 INFO L225 Difference]: With dead ends: 516 [2023-11-29 00:24:47,025 INFO L226 Difference]: Without dead ends: 424 [2023-11-29 00:24:47,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=152, Invalid=354, Unknown=0, NotChecked=0, Total=506 [2023-11-29 00:24:47,026 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 323 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2023-11-29 00:24:47,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 756 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2023-11-29 00:24:47,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2023-11-29 00:24:47,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 374. [2023-11-29 00:24:47,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 237 states have (on average 1.2953586497890295) internal successors, (307), 238 states have internal predecessors, (307), 128 states have call successors, (128), 8 states have call predecessors, (128), 8 states have return successors, (128), 127 states have call predecessors, (128), 128 states have call successors, (128) [2023-11-29 00:24:47,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 563 transitions. [2023-11-29 00:24:47,066 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 563 transitions. Word has length 205 [2023-11-29 00:24:47,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:24:47,067 INFO L495 AbstractCegarLoop]: Abstraction has 374 states and 563 transitions. [2023-11-29 00:24:47,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-11-29 00:24:47,067 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 563 transitions. [2023-11-29 00:24:47,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2023-11-29 00:24:47,069 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:24:47,069 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:24:47,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 00:24:47,070 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:24:47,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:24:47,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1289999343, now seen corresponding path program 1 times [2023-11-29 00:24:47,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:24:47,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956990104] [2023-11-29 00:24:47,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:24:47,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:24:47,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:57,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:24:57,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:57,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:24:57,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:57,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:24:57,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:57,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 00:24:57,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:57,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 00:24:57,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:57,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:24:57,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:57,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:24:57,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:57,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 00:24:57,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:57,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 00:24:57,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:57,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 00:24:57,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:57,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:24:57,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:57,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:24:57,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:57,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:24:57,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:57,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 00:24:57,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:57,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 00:24:57,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:57,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 00:24:57,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:57,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 00:24:57,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:57,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 00:24:57,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:57,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:24:57,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:57,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 00:24:57,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:57,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 00:24:57,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:57,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 00:24:57,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:57,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-29 00:24:57,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:57,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-11-29 00:24:57,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:57,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-11-29 00:24:57,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:57,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-11-29 00:24:57,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:57,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-11-29 00:24:57,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:57,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-29 00:24:57,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:57,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-11-29 00:24:57,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:57,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2023-11-29 00:24:57,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:57,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-11-29 00:24:57,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:57,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2023-11-29 00:24:57,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:24:57,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2023-11-29 00:24:57,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:24:57,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956990104] [2023-11-29 00:24:57,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956990104] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:24:57,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:24:57,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-29 00:24:57,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569193166] [2023-11-29 00:24:57,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:24:57,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 00:24:57,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:24:57,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 00:24:57,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-11-29 00:24:57,801 INFO L87 Difference]: Start difference. First operand 374 states and 563 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-11-29 00:25:00,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:25:01,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:25:01,063 INFO L93 Difference]: Finished difference Result 518 states and 774 transitions. [2023-11-29 00:25:01,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 00:25:01,063 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 205 [2023-11-29 00:25:01,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:25:01,066 INFO L225 Difference]: With dead ends: 518 [2023-11-29 00:25:01,066 INFO L226 Difference]: Without dead ends: 426 [2023-11-29 00:25:01,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=152, Invalid=354, Unknown=0, NotChecked=0, Total=506 [2023-11-29 00:25:01,067 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 325 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-11-29 00:25:01,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 772 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-11-29 00:25:01,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2023-11-29 00:25:01,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 374. [2023-11-29 00:25:01,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 237 states have (on average 1.2953586497890295) internal successors, (307), 238 states have internal predecessors, (307), 128 states have call successors, (128), 8 states have call predecessors, (128), 8 states have return successors, (128), 127 states have call predecessors, (128), 128 states have call successors, (128) [2023-11-29 00:25:01,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 563 transitions. [2023-11-29 00:25:01,097 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 563 transitions. Word has length 205 [2023-11-29 00:25:01,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:25:01,097 INFO L495 AbstractCegarLoop]: Abstraction has 374 states and 563 transitions. [2023-11-29 00:25:01,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-11-29 00:25:01,097 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 563 transitions. [2023-11-29 00:25:01,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2023-11-29 00:25:01,098 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:25:01,099 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:25:01,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 00:25:01,099 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:25:01,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:25:01,099 INFO L85 PathProgramCache]: Analyzing trace with hash 36500307, now seen corresponding path program 1 times [2023-11-29 00:25:01,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:25:01,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854603619] [2023-11-29 00:25:01,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:25:01,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:25:01,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:28:26,590 WARN L293 SmtUtils]: Spent 20.02s on a formula simplification. DAG size of input: 216 DAG size of output: 190 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 00:28:26,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:28:26,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:28:26,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:28:26,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:28:26,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:28:26,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:28:26,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 00:28:26,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:28:26,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 00:28:26,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:28:26,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:28:26,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:28:26,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:28:26,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:28:26,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 00:28:26,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:28:26,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 00:28:26,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:28:26,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 00:28:26,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:28:26,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:28:26,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:28:26,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:28:26,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:28:26,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:28:26,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:28:26,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 00:28:26,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:28:26,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 00:28:26,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:28:26,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 00:28:26,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:28:26,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 00:28:26,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:28:26,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 00:28:26,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:28:26,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:28:26,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:28:26,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 00:28:26,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:28:26,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 00:28:26,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:28:26,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 00:28:26,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:28:26,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-29 00:28:26,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:28:26,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-11-29 00:28:26,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:28:26,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-11-29 00:28:26,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:28:26,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-11-29 00:28:26,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:28:26,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-11-29 00:28:26,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:28:26,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-29 00:28:26,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:28:26,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-11-29 00:28:26,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:28:26,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2023-11-29 00:28:26,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:28:26,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-11-29 00:28:26,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:28:26,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2023-11-29 00:28:26,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:28:26,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2023-11-29 00:28:26,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:28:26,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854603619] [2023-11-29 00:28:26,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854603619] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:28:26,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:28:26,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-29 00:28:26,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551802989] [2023-11-29 00:28:26,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:28:26,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 00:28:26,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:28:26,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 00:28:26,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-11-29 00:28:26,775 INFO L87 Difference]: Start difference. First operand 374 states and 563 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2023-11-29 00:28:32,968 WARN L293 SmtUtils]: Spent 5.21s on a formula simplification that was a NOOP. DAG size: 194 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 00:28:37,389 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 [] [2023-11-29 00:28:41,403 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 [] [2023-11-29 00:28:45,416 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 [] [2023-11-29 00:28:50,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:28:50,638 INFO L93 Difference]: Finished difference Result 497 states and 746 transitions. [2023-11-29 00:28:50,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 00:28:50,638 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 205 [2023-11-29 00:28:50,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:28:50,642 INFO L225 Difference]: With dead ends: 497 [2023-11-29 00:28:50,642 INFO L226 Difference]: Without dead ends: 405 [2023-11-29 00:28:50,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 30.6s TimeCoverageRelationStatistics Valid=135, Invalid=285, Unknown=0, NotChecked=0, Total=420 [2023-11-29 00:28:50,643 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 476 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 163 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.6s IncrementalHoareTripleChecker+Time [2023-11-29 00:28:50,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 582 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 466 Invalid, 3 Unknown, 0 Unchecked, 13.6s Time] [2023-11-29 00:28:50,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2023-11-29 00:28:50,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 374. [2023-11-29 00:28:50,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 237 states have (on average 1.2953586497890295) internal successors, (307), 238 states have internal predecessors, (307), 128 states have call successors, (128), 8 states have call predecessors, (128), 8 states have return successors, (128), 127 states have call predecessors, (128), 128 states have call successors, (128) [2023-11-29 00:28:50,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 563 transitions. [2023-11-29 00:28:50,687 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 563 transitions. Word has length 205 [2023-11-29 00:28:50,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:28:50,687 INFO L495 AbstractCegarLoop]: Abstraction has 374 states and 563 transitions. [2023-11-29 00:28:50,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2023-11-29 00:28:50,688 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 563 transitions. [2023-11-29 00:28:50,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2023-11-29 00:28:50,689 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:28:50,690 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:28:50,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 00:28:50,690 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:28:50,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:28:50,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1725104275, now seen corresponding path program 1 times [2023-11-29 00:28:50,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:28:50,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717684491] [2023-11-29 00:28:50,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:28:50,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:28:50,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:29:49,537 WARN L293 SmtUtils]: Spent 5.08s on a formula simplification. DAG size of input: 163 DAG size of output: 158 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 00:29:49,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:29:49,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:29:49,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:29:49,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:29:49,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:29:49,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:29:49,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 00:29:49,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:29:49,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 00:29:49,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:29:49,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:29:49,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:29:49,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:29:49,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:29:49,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 00:29:49,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:29:49,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 00:29:49,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:29:49,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 00:29:49,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:29:49,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:29:49,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:29:49,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:29:49,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:29:49,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:29:49,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:29:49,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 00:29:49,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:29:49,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 00:29:49,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:29:49,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 00:29:49,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:29:49,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 00:29:49,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:29:49,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 00:29:49,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:29:49,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:29:49,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:29:49,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 00:29:49,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:29:49,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 00:29:49,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:29:49,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 00:29:49,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:29:49,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-29 00:29:49,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:29:49,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-11-29 00:29:49,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:29:49,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-11-29 00:29:49,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:29:49,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-11-29 00:29:49,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:29:49,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-11-29 00:29:49,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:29:49,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-29 00:29:49,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:29:49,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-11-29 00:29:49,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:29:49,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2023-11-29 00:29:49,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:29:49,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-11-29 00:29:49,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:29:49,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2023-11-29 00:29:49,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:29:49,605 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2023-11-29 00:29:49,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:29:49,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717684491] [2023-11-29 00:29:49,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717684491] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:29:49,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:29:49,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 00:29:49,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439793511] [2023-11-29 00:29:49,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:29:49,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 00:29:49,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:29:49,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 00:29:49,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2023-11-29 00:29:49,607 INFO L87 Difference]: Start difference. First operand 374 states and 563 transitions. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-11-29 00:29:55,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:29:55,732 INFO L93 Difference]: Finished difference Result 612 states and 919 transitions. [2023-11-29 00:29:55,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 00:29:55,732 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 205 [2023-11-29 00:29:55,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:29:55,735 INFO L225 Difference]: With dead ends: 612 [2023-11-29 00:29:55,735 INFO L226 Difference]: Without dead ends: 412 [2023-11-29 00:29:55,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=117, Invalid=189, Unknown=0, NotChecked=0, Total=306 [2023-11-29 00:29:55,736 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 270 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 00:29:55,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 635 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 00:29:55,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2023-11-29 00:29:55,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 376. [2023-11-29 00:29:55,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 239 states have (on average 1.292887029288703) internal successors, (309), 240 states have internal predecessors, (309), 128 states have call successors, (128), 8 states have call predecessors, (128), 8 states have return successors, (128), 127 states have call predecessors, (128), 128 states have call successors, (128) [2023-11-29 00:29:55,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 565 transitions. [2023-11-29 00:29:55,766 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 565 transitions. Word has length 205 [2023-11-29 00:29:55,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:29:55,767 INFO L495 AbstractCegarLoop]: Abstraction has 376 states and 565 transitions. [2023-11-29 00:29:55,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-11-29 00:29:55,767 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 565 transitions. [2023-11-29 00:29:55,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2023-11-29 00:29:55,768 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:29:55,768 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:29:55,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 00:29:55,769 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:29:55,769 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:29:55,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1242451164, now seen corresponding path program 1 times [2023-11-29 00:29:55,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:29:55,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765445661] [2023-11-29 00:29:55,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:29:55,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:29:55,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:21,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:30:21,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:21,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:30:21,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:21,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:30:21,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:21,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 00:30:21,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:21,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 00:30:21,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:21,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:30:21,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:21,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:30:21,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:21,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 00:30:21,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:21,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 00:30:21,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:21,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 00:30:21,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:21,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:30:21,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:21,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:30:21,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:21,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:30:21,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:21,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 00:30:21,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:21,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 00:30:21,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:21,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 00:30:21,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:21,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 00:30:21,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:21,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 00:30:21,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:21,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:30:21,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:21,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 00:30:21,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:21,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 00:30:21,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:21,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 00:30:21,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:21,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-29 00:30:21,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:21,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-11-29 00:30:21,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:21,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-11-29 00:30:21,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:21,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-11-29 00:30:21,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:21,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-11-29 00:30:21,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:21,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-29 00:30:21,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:21,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-11-29 00:30:21,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:21,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2023-11-29 00:30:21,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:21,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-11-29 00:30:21,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:21,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2023-11-29 00:30:21,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:21,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2023-11-29 00:30:21,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:30:21,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765445661] [2023-11-29 00:30:21,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765445661] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:30:21,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:30:21,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-29 00:30:21,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873301337] [2023-11-29 00:30:21,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:30:21,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 00:30:21,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:30:21,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 00:30:21,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2023-11-29 00:30:21,993 INFO L87 Difference]: Start difference. First operand 376 states and 565 transitions. Second operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2023-11-29 00:30:27,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:30:32,206 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 [] [2023-11-29 00:30:36,212 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 [] [2023-11-29 00:30:40,222 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 [] [2023-11-29 00:30:44,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:30:48,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:30:48,292 INFO L93 Difference]: Finished difference Result 731 states and 1072 transitions. [2023-11-29 00:30:48,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-11-29 00:30:48,293 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 206 [2023-11-29 00:30:48,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:30:48,296 INFO L225 Difference]: With dead ends: 731 [2023-11-29 00:30:48,297 INFO L226 Difference]: Without dead ends: 639 [2023-11-29 00:30:48,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=371, Invalid=1269, Unknown=0, NotChecked=0, Total=1640 [2023-11-29 00:30:48,298 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 708 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 993 mSolverCounterSat, 138 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 708 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 993 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.6s IncrementalHoareTripleChecker+Time [2023-11-29 00:30:48,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [708 Valid, 899 Invalid, 1135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 993 Invalid, 4 Unknown, 0 Unchecked, 20.6s Time] [2023-11-29 00:30:48,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2023-11-29 00:30:48,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 399. [2023-11-29 00:30:48,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 262 states have (on average 1.316793893129771) internal successors, (345), 262 states have internal predecessors, (345), 128 states have call successors, (128), 8 states have call predecessors, (128), 8 states have return successors, (128), 128 states have call predecessors, (128), 128 states have call successors, (128) [2023-11-29 00:30:48,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 601 transitions. [2023-11-29 00:30:48,332 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 601 transitions. Word has length 206 [2023-11-29 00:30:48,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:30:48,332 INFO L495 AbstractCegarLoop]: Abstraction has 399 states and 601 transitions. [2023-11-29 00:30:48,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2023-11-29 00:30:48,332 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 601 transitions. [2023-11-29 00:30:48,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2023-11-29 00:30:48,334 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:30:48,334 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:30:48,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 00:30:48,334 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:30:48,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:30:48,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1922509534, now seen corresponding path program 1 times [2023-11-29 00:30:48,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:30:48,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637803185] [2023-11-29 00:30:48,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:30:48,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:30:48,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat