./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-10.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25d5c65-b3f8-42b8-88fe-c65575ed8fd6/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25d5c65-b3f8-42b8-88fe-c65575ed8fd6/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_f25d5c65-b3f8-42b8-88fe-c65575ed8fd6/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25d5c65-b3f8-42b8-88fe-c65575ed8fd6/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-10.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25d5c65-b3f8-42b8-88fe-c65575ed8fd6/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_f25d5c65-b3f8-42b8-88fe-c65575ed8fd6/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 24099d82b3ec494380587a5a92596aaf0762a1093bfe7e4cba5f9fda7da3acf4 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 06:33:54,644 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 06:33:54,706 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25d5c65-b3f8-42b8-88fe-c65575ed8fd6/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 06:33:54,712 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 06:33:54,712 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 06:33:54,737 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 06:33:54,738 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 06:33:54,739 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 06:33:54,739 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 06:33:54,740 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 06:33:54,741 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 06:33:54,741 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 06:33:54,742 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 06:33:54,742 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 06:33:54,743 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 06:33:54,743 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 06:33:54,744 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 06:33:54,744 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 06:33:54,745 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 06:33:54,745 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 06:33:54,746 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 06:33:54,746 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 06:33:54,747 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 06:33:54,747 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 06:33:54,747 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 06:33:54,748 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 06:33:54,748 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 06:33:54,749 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 06:33:54,749 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 06:33:54,750 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 06:33:54,750 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 06:33:54,750 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:33:54,751 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 06:33:54,751 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 06:33:54,752 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 06:33:54,752 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 06:33:54,753 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 06:33:54,753 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 06:33:54,753 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 06:33:54,753 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 06:33:54,754 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 06:33:54,754 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 06:33:54,754 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_f25d5c65-b3f8-42b8-88fe-c65575ed8fd6/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_f25d5c65-b3f8-42b8-88fe-c65575ed8fd6/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 -> 24099d82b3ec494380587a5a92596aaf0762a1093bfe7e4cba5f9fda7da3acf4 [2023-11-29 06:33:54,952 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 06:33:54,974 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 06:33:54,976 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 06:33:54,978 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 06:33:54,978 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 06:33:54,979 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25d5c65-b3f8-42b8-88fe-c65575ed8fd6/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-10.i [2023-11-29 06:33:57,756 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 06:33:57,944 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 06:33:57,944 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25d5c65-b3f8-42b8-88fe-c65575ed8fd6/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-10.i [2023-11-29 06:33:57,953 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25d5c65-b3f8-42b8-88fe-c65575ed8fd6/bin/uautomizer-verify-BQ2R08f2Ya/data/512d07fa9/6e805855ec1b462780035988eccc3652/FLAG02e5fc690 [2023-11-29 06:33:57,967 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25d5c65-b3f8-42b8-88fe-c65575ed8fd6/bin/uautomizer-verify-BQ2R08f2Ya/data/512d07fa9/6e805855ec1b462780035988eccc3652 [2023-11-29 06:33:57,969 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 06:33:57,970 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 06:33:57,971 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 06:33:57,971 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 06:33:57,976 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 06:33:57,977 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:33:57" (1/1) ... [2023-11-29 06:33:57,977 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f6627fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:33:57, skipping insertion in model container [2023-11-29 06:33:57,978 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:33:57" (1/1) ... [2023-11-29 06:33:58,007 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 06:33:58,143 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_f25d5c65-b3f8-42b8-88fe-c65575ed8fd6/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-10.i[913,926] [2023-11-29 06:33:58,197 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:33:58,208 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 06:33:58,221 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_f25d5c65-b3f8-42b8-88fe-c65575ed8fd6/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-10.i[913,926] [2023-11-29 06:33:58,245 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:33:58,262 INFO L206 MainTranslator]: Completed translation [2023-11-29 06:33:58,263 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:33:58 WrapperNode [2023-11-29 06:33:58,263 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 06:33:58,264 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 06:33:58,265 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 06:33:58,265 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 06:33:58,272 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:33:58" (1/1) ... [2023-11-29 06:33:58,285 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:33:58" (1/1) ... [2023-11-29 06:33:58,327 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 154 [2023-11-29 06:33:58,328 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 06:33:58,328 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 06:33:58,329 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 06:33:58,329 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 06:33:58,341 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:33:58" (1/1) ... [2023-11-29 06:33:58,341 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:33:58" (1/1) ... [2023-11-29 06:33:58,345 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:33:58" (1/1) ... [2023-11-29 06:33:58,367 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 06:33:58,367 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:33:58" (1/1) ... [2023-11-29 06:33:58,367 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:33:58" (1/1) ... [2023-11-29 06:33:58,378 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:33:58" (1/1) ... [2023-11-29 06:33:58,382 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:33:58" (1/1) ... [2023-11-29 06:33:58,385 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:33:58" (1/1) ... [2023-11-29 06:33:58,388 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:33:58" (1/1) ... [2023-11-29 06:33:58,393 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 06:33:58,394 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 06:33:58,394 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 06:33:58,394 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 06:33:58,395 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:33:58" (1/1) ... [2023-11-29 06:33:58,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:33:58,413 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25d5c65-b3f8-42b8-88fe-c65575ed8fd6/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:33:58,425 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25d5c65-b3f8-42b8-88fe-c65575ed8fd6/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 06:33:58,428 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25d5c65-b3f8-42b8-88fe-c65575ed8fd6/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 06:33:58,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 06:33:58,458 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 06:33:58,459 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 06:33:58,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 06:33:58,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 06:33:58,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 06:33:58,531 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 06:33:58,533 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 06:33:58,866 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 06:33:58,894 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 06:33:58,894 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 06:33:58,895 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:33:58 BoogieIcfgContainer [2023-11-29 06:33:58,895 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 06:33:58,897 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 06:33:58,897 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 06:33:58,900 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 06:33:58,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 06:33:57" (1/3) ... [2023-11-29 06:33:58,901 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b4ab07b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:33:58, skipping insertion in model container [2023-11-29 06:33:58,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:33:58" (2/3) ... [2023-11-29 06:33:58,902 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b4ab07b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:33:58, skipping insertion in model container [2023-11-29 06:33:58,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:33:58" (3/3) ... [2023-11-29 06:33:58,903 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-10.i [2023-11-29 06:33:58,922 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 06:33:58,923 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 06:33:58,966 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 06:33:58,971 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;@276ad581, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 06:33:58,971 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 06:33:58,975 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 44 states have internal predecessors, (64), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-29 06:33:58,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-29 06:33:58,986 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:33:58,986 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:33:58,987 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:33:58,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:33:58,991 INFO L85 PathProgramCache]: Analyzing trace with hash -379473606, now seen corresponding path program 1 times [2023-11-29 06:33:58,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:33:58,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282702971] [2023-11-29 06:33:58,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:33:58,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:33:59,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:59,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:33:59,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:59,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 06:33:59,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:59,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 06:33:59,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:59,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 06:33:59,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:59,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 06:33:59,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:59,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 06:33:59,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:59,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 06:33:59,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:59,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 06:33:59,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:59,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 06:33:59,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:59,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 06:33:59,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:59,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 06:33:59,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:59,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 06:33:59,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:59,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 06:33:59,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:59,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 06:33:59,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:59,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 06:33:59,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:59,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 06:33:59,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:59,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 06:33:59,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:59,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 06:33:59,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:59,334 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 06:33:59,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:33:59,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282702971] [2023-11-29 06:33:59,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282702971] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:33:59,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:33:59,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:33:59,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955513011] [2023-11-29 06:33:59,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:33:59,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 06:33:59,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:33:59,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 06:33:59,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 06:33:59,374 INFO L87 Difference]: Start difference. First operand has 64 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 44 states have internal predecessors, (64), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-29 06:33:59,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:33:59,415 INFO L93 Difference]: Finished difference Result 125 states and 216 transitions. [2023-11-29 06:33:59,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 06:33:59,418 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 118 [2023-11-29 06:33:59,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:33:59,426 INFO L225 Difference]: With dead ends: 125 [2023-11-29 06:33:59,427 INFO L226 Difference]: Without dead ends: 62 [2023-11-29 06:33:59,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 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 06:33:59,434 INFO L413 NwaCegarLoop]: 92 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, 92 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 06:33:59,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 06:33:59,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-11-29 06:33:59,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2023-11-29 06:33:59,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 42 states have internal predecessors, (59), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-29 06:33:59,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 95 transitions. [2023-11-29 06:33:59,476 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 95 transitions. Word has length 118 [2023-11-29 06:33:59,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:33:59,477 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 95 transitions. [2023-11-29 06:33:59,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-29 06:33:59,478 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 95 transitions. [2023-11-29 06:33:59,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-29 06:33:59,481 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:33:59,482 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:33:59,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 06:33:59,482 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:33:59,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:33:59,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1308844666, now seen corresponding path program 1 times [2023-11-29 06:33:59,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:33:59,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408843551] [2023-11-29 06:33:59,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:33:59,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:33:59,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:59,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:33:59,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:59,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 06:33:59,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:59,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 06:33:59,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:59,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 06:33:59,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:59,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 06:33:59,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:59,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 06:33:59,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:59,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 06:33:59,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:59,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 06:33:59,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:59,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 06:33:59,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:59,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 06:33:59,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:59,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 06:33:59,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:59,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 06:33:59,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:59,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 06:33:59,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:59,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 06:33:59,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:59,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 06:33:59,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:59,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 06:33:59,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:59,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 06:33:59,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:59,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 06:33:59,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:33:59,961 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 06:33:59,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:33:59,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408843551] [2023-11-29 06:33:59,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408843551] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:33:59,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:33:59,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 06:33:59,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723685871] [2023-11-29 06:33:59,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:33:59,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 06:33:59,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:33:59,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 06:33:59,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:33:59,965 INFO L87 Difference]: Start difference. First operand 62 states and 95 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 06:34:00,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:34:00,158 INFO L93 Difference]: Finished difference Result 185 states and 284 transitions. [2023-11-29 06:34:00,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 06:34:00,159 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 118 [2023-11-29 06:34:00,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:34:00,162 INFO L225 Difference]: With dead ends: 185 [2023-11-29 06:34:00,162 INFO L226 Difference]: Without dead ends: 124 [2023-11-29 06:34:00,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 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 06:34:00,165 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 92 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:34:00,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 351 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:34:00,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-11-29 06:34:00,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 95. [2023-11-29 06:34:00,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 56 states have internal predecessors, (73), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-29 06:34:00,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 145 transitions. [2023-11-29 06:34:00,193 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 145 transitions. Word has length 118 [2023-11-29 06:34:00,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:34:00,194 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 145 transitions. [2023-11-29 06:34:00,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 06:34:00,195 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 145 transitions. [2023-11-29 06:34:00,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-29 06:34:00,198 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:34:00,198 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:34:00,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 06:34:00,198 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:34:00,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:34:00,199 INFO L85 PathProgramCache]: Analyzing trace with hash -582534747, now seen corresponding path program 1 times [2023-11-29 06:34:00,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:34:00,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376800683] [2023-11-29 06:34:00,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:34:00,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:34:00,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:34:08,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:34:08,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:34:08,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 06:34:08,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:34:08,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 06:34:08,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:34:08,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 06:34:08,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:34:08,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 06:34:08,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:34:08,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 06:34:08,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:34:08,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 06:34:08,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:34:08,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 06:34:08,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:34:08,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 06:34:08,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:34:08,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 06:34:08,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:34:08,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 06:34:08,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:34:08,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 06:34:08,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:34:08,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 06:34:08,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:34:08,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 06:34:08,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:34:08,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 06:34:08,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:34:08,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 06:34:08,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:34:08,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 06:34:08,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:34:08,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 06:34:08,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:34:08,574 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 06:34:08,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:34:08,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376800683] [2023-11-29 06:34:08,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376800683] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:34:08,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:34:08,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 06:34:08,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239689438] [2023-11-29 06:34:08,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:34:08,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 06:34:08,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:34:08,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 06:34:08,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-11-29 06:34:08,578 INFO L87 Difference]: Start difference. First operand 95 states and 145 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 06:34:09,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:34:09,968 INFO L93 Difference]: Finished difference Result 287 states and 425 transitions. [2023-11-29 06:34:09,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-29 06:34:09,969 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2023-11-29 06:34:09,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:34:09,973 INFO L225 Difference]: With dead ends: 287 [2023-11-29 06:34:09,973 INFO L226 Difference]: Without dead ends: 226 [2023-11-29 06:34:09,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=156, Invalid=396, Unknown=0, NotChecked=0, Total=552 [2023-11-29 06:34:09,975 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 259 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 06:34:09,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 443 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 06:34:09,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2023-11-29 06:34:09,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 111. [2023-11-29 06:34:09,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 72 states have (on average 1.3611111111111112) internal successors, (98), 72 states have internal predecessors, (98), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-29 06:34:10,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 170 transitions. [2023-11-29 06:34:10,000 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 170 transitions. Word has length 119 [2023-11-29 06:34:10,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:34:10,001 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 170 transitions. [2023-11-29 06:34:10,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 06:34:10,002 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 170 transitions. [2023-11-29 06:34:10,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-29 06:34:10,004 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:34:10,004 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:34:10,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 06:34:10,005 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:34:10,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:34:10,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1391881373, now seen corresponding path program 1 times [2023-11-29 06:34:10,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:34:10,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928255484] [2023-11-29 06:34:10,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:34:10,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:34:10,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:47,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:35:47,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:47,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 06:35:47,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:47,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 06:35:47,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:47,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 06:35:47,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:47,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 06:35:47,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:47,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 06:35:47,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:47,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 06:35:47,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:47,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 06:35:47,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:47,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 06:35:47,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:47,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 06:35:47,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:47,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 06:35:47,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:47,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 06:35:47,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:47,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 06:35:47,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:47,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 06:35:47,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:47,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 06:35:47,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:47,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 06:35:47,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:47,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 06:35:47,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:47,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 06:35:47,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:35:47,377 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 06:35:47,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:35:47,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928255484] [2023-11-29 06:35:47,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928255484] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:35:47,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:35:47,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-29 06:35:47,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280065843] [2023-11-29 06:35:47,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:35:47,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 06:35:47,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:35:47,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 06:35:47,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2023-11-29 06:35:47,380 INFO L87 Difference]: Start difference. First operand 111 states and 170 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 06:35:53,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 06:35:54,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:35:54,802 INFO L93 Difference]: Finished difference Result 292 states and 435 transitions. [2023-11-29 06:35:54,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-29 06:35:54,803 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2023-11-29 06:35:54,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:35:54,805 INFO L225 Difference]: With dead ends: 292 [2023-11-29 06:35:54,806 INFO L226 Difference]: Without dead ends: 231 [2023-11-29 06:35:54,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=212, Invalid=658, Unknown=0, NotChecked=0, Total=870 [2023-11-29 06:35:54,808 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 353 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 64 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2023-11-29 06:35:54,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 459 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 508 Invalid, 1 Unknown, 0 Unchecked, 5.6s Time] [2023-11-29 06:35:54,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2023-11-29 06:35:54,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 125. [2023-11-29 06:35:54,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 86 states have (on average 1.3953488372093024) internal successors, (120), 86 states have internal predecessors, (120), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-29 06:35:54,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 192 transitions. [2023-11-29 06:35:54,827 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 192 transitions. Word has length 119 [2023-11-29 06:35:54,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:35:54,828 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 192 transitions. [2023-11-29 06:35:54,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 06:35:54,829 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 192 transitions. [2023-11-29 06:35:54,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-29 06:35:54,831 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:35:54,831 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:35:54,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 06:35:54,832 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:35:54,832 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:35:54,832 INFO L85 PathProgramCache]: Analyzing trace with hash -65381723, now seen corresponding path program 1 times [2023-11-29 06:35:54,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:35:54,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930990502] [2023-11-29 06:35:54,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:35:54,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:35:54,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:38:46,354 WARN L293 SmtUtils]: Spent 12.60s 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 06:38:46,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:38:46,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:38:46,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 06:38:46,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:38:46,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 06:38:46,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:38:46,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 06:38:46,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:38:46,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 06:38:46,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:38:46,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 06:38:46,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:38:46,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 06:38:46,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:38:46,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 06:38:46,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:38:46,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 06:38:46,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:38:46,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 06:38:46,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:38:46,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 06:38:46,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:38:46,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 06:38:46,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:38:46,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 06:38:46,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:38:46,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 06:38:46,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:38:46,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 06:38:46,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:38:46,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 06:38:46,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:38:46,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 06:38:46,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:38:46,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 06:38:46,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:38:46,439 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 06:38:46,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:38:46,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930990502] [2023-11-29 06:38:46,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930990502] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:38:46,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:38:46,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-29 06:38:46,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049657093] [2023-11-29 06:38:46,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:38:46,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 06:38:46,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:38:46,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 06:38:46,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2023-11-29 06:38:46,442 INFO L87 Difference]: Start difference. First operand 125 states and 192 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-29 06:38:56,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 06:38:59,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:38:59,917 INFO L93 Difference]: Finished difference Result 349 states and 517 transitions. [2023-11-29 06:38:59,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 06:38:59,917 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 119 [2023-11-29 06:38:59,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:38:59,920 INFO L225 Difference]: With dead ends: 349 [2023-11-29 06:38:59,920 INFO L226 Difference]: Without dead ends: 281 [2023-11-29 06:38:59,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 23.1s TimeCoverageRelationStatistics Valid=152, Invalid=400, Unknown=0, NotChecked=0, Total=552 [2023-11-29 06:38:59,922 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 445 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2023-11-29 06:38:59,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 431 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2023-11-29 06:38:59,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2023-11-29 06:38:59,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 209. [2023-11-29 06:38:59,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 148 states have (on average 1.3581081081081081) internal successors, (201), 148 states have internal predecessors, (201), 54 states have call successors, (54), 6 states have call predecessors, (54), 6 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2023-11-29 06:38:59,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 309 transitions. [2023-11-29 06:38:59,951 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 309 transitions. Word has length 119 [2023-11-29 06:38:59,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:38:59,952 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 309 transitions. [2023-11-29 06:38:59,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-29 06:38:59,952 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 309 transitions. [2023-11-29 06:38:59,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-29 06:38:59,954 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:38:59,954 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:38:59,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 06:38:59,955 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:38:59,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:38:59,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1623222245, now seen corresponding path program 1 times [2023-11-29 06:38:59,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:38:59,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741910466] [2023-11-29 06:38:59,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:38:59,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:39:00,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:40:03,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:40:03,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:40:03,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 06:40:03,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:40:03,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 06:40:03,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:40:03,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 06:40:03,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:40:03,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 06:40:03,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:40:03,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 06:40:03,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:40:03,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 06:40:03,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:40:03,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 06:40:03,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:40:03,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 06:40:03,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:40:03,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 06:40:03,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:40:03,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 06:40:03,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:40:03,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 06:40:03,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:40:03,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 06:40:03,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:40:03,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 06:40:03,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:40:03,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 06:40:03,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:40:03,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 06:40:03,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:40:03,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 06:40:03,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:40:03,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 06:40:03,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:40:03,127 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 06:40:03,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:40:03,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741910466] [2023-11-29 06:40:03,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741910466] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:40:03,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:40:03,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 06:40:03,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939588102] [2023-11-29 06:40:03,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:40:03,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 06:40:03,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:40:03,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 06:40:03,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-11-29 06:40:03,130 INFO L87 Difference]: Start difference. First operand 209 states and 309 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 06:40:09,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:40:09,958 INFO L93 Difference]: Finished difference Result 421 states and 616 transitions. [2023-11-29 06:40:09,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 06:40:09,959 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2023-11-29 06:40:09,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:40:09,962 INFO L225 Difference]: With dead ends: 421 [2023-11-29 06:40:09,962 INFO L226 Difference]: Without dead ends: 279 [2023-11-29 06:40:09,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=175, Invalid=425, Unknown=0, NotChecked=0, Total=600 [2023-11-29 06:40:09,964 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 220 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 06:40:09,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 521 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 06:40:09,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2023-11-29 06:40:09,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 211. [2023-11-29 06:40:09,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 150 states have (on average 1.3533333333333333) internal successors, (203), 150 states have internal predecessors, (203), 54 states have call successors, (54), 6 states have call predecessors, (54), 6 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2023-11-29 06:40:09,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 311 transitions. [2023-11-29 06:40:09,987 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 311 transitions. Word has length 119 [2023-11-29 06:40:09,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:40:09,988 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 311 transitions. [2023-11-29 06:40:09,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 06:40:09,988 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 311 transitions. [2023-11-29 06:40:09,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-29 06:40:09,990 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:40:09,990 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:40:09,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 06:40:09,990 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:40:09,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:40:09,991 INFO L85 PathProgramCache]: Analyzing trace with hash 2124084647, now seen corresponding path program 1 times [2023-11-29 06:40:09,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:40:09,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350542874] [2023-11-29 06:40:09,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:40:09,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:40:10,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:40:31,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:40:31,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:40:31,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 06:40:31,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:40:31,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 06:40:31,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:40:31,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 06:40:31,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:40:31,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 06:40:31,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:40:31,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 06:40:31,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:40:31,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 06:40:31,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:40:31,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 06:40:31,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:40:31,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 06:40:31,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:40:31,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 06:40:31,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:40:31,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 06:40:31,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:40:31,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 06:40:31,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:40:31,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 06:40:31,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:40:31,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 06:40:31,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:40:31,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 06:40:31,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:40:31,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 06:40:31,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:40:31,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 06:40:31,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:40:31,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 06:40:31,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:40:31,155 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 06:40:31,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:40:31,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350542874] [2023-11-29 06:40:31,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350542874] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:40:31,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:40:31,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-29 06:40:31,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67767409] [2023-11-29 06:40:31,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:40:31,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 06:40:31,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:40:31,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 06:40:31,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2023-11-29 06:40:31,158 INFO L87 Difference]: Start difference. First operand 211 states and 311 transitions. Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-29 06:40:33,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:40:33,364 INFO L93 Difference]: Finished difference Result 403 states and 592 transitions. [2023-11-29 06:40:33,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-29 06:40:33,365 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 119 [2023-11-29 06:40:33,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:40:33,367 INFO L225 Difference]: With dead ends: 403 [2023-11-29 06:40:33,367 INFO L226 Difference]: Without dead ends: 342 [2023-11-29 06:40:33,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=230, Invalid=640, Unknown=0, NotChecked=0, Total=870 [2023-11-29 06:40:33,369 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 592 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:40:33,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [592 Valid, 508 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 06:40:33,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2023-11-29 06:40:33,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 288. [2023-11-29 06:40:33,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 206 states have (on average 1.354368932038835) internal successors, (279), 206 states have internal predecessors, (279), 72 states have call successors, (72), 9 states have call predecessors, (72), 9 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2023-11-29 06:40:33,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 423 transitions. [2023-11-29 06:40:33,403 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 423 transitions. Word has length 119 [2023-11-29 06:40:33,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:40:33,404 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 423 transitions. [2023-11-29 06:40:33,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-29 06:40:33,404 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 423 transitions. [2023-11-29 06:40:33,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-29 06:40:33,406 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:40:33,406 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:40:33,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 06:40:33,406 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:40:33,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:40:33,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1314738021, now seen corresponding path program 1 times [2023-11-29 06:40:33,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:40:33,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123763833] [2023-11-29 06:40:33,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:40:33,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:40:33,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:39,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:43:39,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:39,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 06:43:39,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:39,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 06:43:39,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:39,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 06:43:39,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:39,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 06:43:39,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:39,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 06:43:39,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:39,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 06:43:39,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:39,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 06:43:39,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:39,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 06:43:39,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:39,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 06:43:39,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:39,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 06:43:39,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:39,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 06:43:39,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:39,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 06:43:39,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:39,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 06:43:39,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:39,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 06:43:39,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:39,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 06:43:39,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:39,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 06:43:39,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:39,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 06:43:39,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:39,116 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 06:43:39,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:43:39,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123763833] [2023-11-29 06:43:39,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123763833] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:43:39,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:43:39,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-29 06:43:39,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922032156] [2023-11-29 06:43:39,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:43:39,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 06:43:39,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:43:39,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 06:43:39,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2023-11-29 06:43:39,119 INFO L87 Difference]: Start difference. First operand 288 states and 423 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 06:43:45,597 WARN L293 SmtUtils]: Spent 5.51s on a formula simplification. DAG size of input: 197 DAG size of output: 190 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 06:43:49,755 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 06:43:53,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.70s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 06:43:58,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.81s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 06:43:59,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:43:59,470 INFO L93 Difference]: Finished difference Result 570 states and 829 transitions. [2023-11-29 06:43:59,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-29 06:43:59,471 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2023-11-29 06:43:59,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:43:59,476 INFO L225 Difference]: With dead ends: 570 [2023-11-29 06:43:59,476 INFO L226 Difference]: Without dead ends: 509 [2023-11-29 06:43:59,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=201, Invalid=611, Unknown=0, NotChecked=0, Total=812 [2023-11-29 06:43:59,478 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 378 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 64 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:43:59,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 572 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 660 Invalid, 1 Unknown, 0 Unchecked, 13.1s Time] [2023-11-29 06:43:59,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2023-11-29 06:43:59,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 363. [2023-11-29 06:43:59,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 260 states have (on average 1.353846153846154) internal successors, (352), 260 states have internal predecessors, (352), 90 states have call successors, (90), 12 states have call predecessors, (90), 12 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2023-11-29 06:43:59,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 532 transitions. [2023-11-29 06:43:59,520 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 532 transitions. Word has length 119 [2023-11-29 06:43:59,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:43:59,521 INFO L495 AbstractCegarLoop]: Abstraction has 363 states and 532 transitions. [2023-11-29 06:43:59,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 06:43:59,521 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 532 transitions. [2023-11-29 06:43:59,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-29 06:43:59,523 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:43:59,523 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:43:59,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 06:43:59,523 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:43:59,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:43:59,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1653729625, now seen corresponding path program 1 times [2023-11-29 06:43:59,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:43:59,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881990902] [2023-11-29 06:43:59,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:43:59,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:43:59,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:46:54,852 WARN L293 SmtUtils]: Spent 11.71s 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 06:46:54,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:46:54,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:46:54,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 06:46:54,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:46:54,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 06:46:54,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:46:54,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 06:46:54,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:46:54,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 06:46:54,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:46:54,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 06:46:54,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:46:54,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 06:46:54,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:46:54,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 06:46:54,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:46:54,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 06:46:54,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:46:54,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 06:46:54,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:46:54,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 06:46:54,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:46:54,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 06:46:54,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:46:54,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 06:46:54,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:46:54,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 06:46:54,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:46:54,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 06:46:54,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:46:54,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 06:46:54,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:46:54,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 06:46:54,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:46:54,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 06:46:54,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:46:54,927 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 06:46:54,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:46:54,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881990902] [2023-11-29 06:46:54,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881990902] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:46:54,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:46:54,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-29 06:46:54,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063701440] [2023-11-29 06:46:54,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:46:54,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 06:46:54,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:46:54,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 06:46:54,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2023-11-29 06:46:54,930 INFO L87 Difference]: Start difference. First operand 363 states and 532 transitions. Second operand has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-29 06:46:59,548 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 06:47:06,346 WARN L293 SmtUtils]: Spent 5.51s on a formula simplification. DAG size of input: 208 DAG size of output: 190 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 06:47:10,414 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 06:47:11,936 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 06:47:20,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:47:20,935 INFO L93 Difference]: Finished difference Result 524 states and 765 transitions. [2023-11-29 06:47:20,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-29 06:47:20,936 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 119 [2023-11-29 06:47:20,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:47:20,939 INFO L225 Difference]: With dead ends: 524 [2023-11-29 06:47:20,939 INFO L226 Difference]: Without dead ends: 463 [2023-11-29 06:47:20,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 27.3s TimeCoverageRelationStatistics Valid=256, Invalid=674, Unknown=0, NotChecked=0, Total=930 [2023-11-29 06:47:20,940 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 707 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 112 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 707 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.2s IncrementalHoareTripleChecker+Time [2023-11-29 06:47:20,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [707 Valid, 390 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 708 Invalid, 2 Unknown, 0 Unchecked, 11.2s Time] [2023-11-29 06:47:20,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2023-11-29 06:47:20,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 367. [2023-11-29 06:47:20,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 264 states have (on average 1.356060606060606) internal successors, (358), 264 states have internal predecessors, (358), 90 states have call successors, (90), 12 states have call predecessors, (90), 12 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2023-11-29 06:47:20,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 538 transitions. [2023-11-29 06:47:20,980 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 538 transitions. Word has length 119 [2023-11-29 06:47:20,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:47:20,980 INFO L495 AbstractCegarLoop]: Abstraction has 367 states and 538 transitions. [2023-11-29 06:47:20,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-29 06:47:20,980 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 538 transitions. [2023-11-29 06:47:20,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-29 06:47:20,981 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:47:20,982 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:47:20,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 06:47:20,982 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:47:20,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:47:20,982 INFO L85 PathProgramCache]: Analyzing trace with hash -952665047, now seen corresponding path program 1 times [2023-11-29 06:47:20,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:47:20,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509879085] [2023-11-29 06:47:20,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:47:20,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:47:21,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat