./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-97.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_e03eda3c-3ed6-4cb1-891e-b4ce96c12c95/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03eda3c-3ed6-4cb1-891e-b4ce96c12c95/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_e03eda3c-3ed6-4cb1-891e-b4ce96c12c95/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03eda3c-3ed6-4cb1-891e-b4ce96c12c95/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-97.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03eda3c-3ed6-4cb1-891e-b4ce96c12c95/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_e03eda3c-3ed6-4cb1-891e-b4ce96c12c95/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 abf1fadcf9bfc6046971a4719244290526d1ce32a1ee2d2e74022cac98e38aab --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:40:08,977 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:40:09,038 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03eda3c-3ed6-4cb1-891e-b4ce96c12c95/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 05:40:09,043 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:40:09,043 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:40:09,067 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:40:09,067 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:40:09,068 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:40:09,068 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:40:09,069 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:40:09,069 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:40:09,070 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:40:09,071 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:40:09,071 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:40:09,072 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:40:09,072 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:40:09,073 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 05:40:09,073 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 05:40:09,074 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 05:40:09,074 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 05:40:09,075 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:40:09,078 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 05:40:09,079 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:40:09,079 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 05:40:09,079 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 05:40:09,080 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 05:40:09,080 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:40:09,080 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:40:09,080 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:40:09,081 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:40:09,081 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:40:09,082 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:40:09,082 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:40:09,082 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:40:09,083 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 05:40:09,083 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 05:40:09,084 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 05:40:09,084 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:40:09,084 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:40:09,084 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 05:40:09,084 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:40:09,085 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:40:09,085 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_e03eda3c-3ed6-4cb1-891e-b4ce96c12c95/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_e03eda3c-3ed6-4cb1-891e-b4ce96c12c95/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 -> abf1fadcf9bfc6046971a4719244290526d1ce32a1ee2d2e74022cac98e38aab [2023-11-29 05:40:09,279 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:40:09,311 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:40:09,313 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:40:09,315 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:40:09,315 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:40:09,316 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03eda3c-3ed6-4cb1-891e-b4ce96c12c95/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-97.i [2023-11-29 05:40:12,173 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:40:12,369 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:40:12,369 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03eda3c-3ed6-4cb1-891e-b4ce96c12c95/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-97.i [2023-11-29 05:40:12,380 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03eda3c-3ed6-4cb1-891e-b4ce96c12c95/bin/uautomizer-verify-BQ2R08f2Ya/data/463ed2b7f/810643f073fc4652a84cbb43fa8bd75e/FLAG3325423c5 [2023-11-29 05:40:12,394 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03eda3c-3ed6-4cb1-891e-b4ce96c12c95/bin/uautomizer-verify-BQ2R08f2Ya/data/463ed2b7f/810643f073fc4652a84cbb43fa8bd75e [2023-11-29 05:40:12,396 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:40:12,398 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:40:12,399 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:40:12,399 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:40:12,404 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:40:12,405 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:40:12" (1/1) ... [2023-11-29 05:40:12,406 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b302bc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:40:12, skipping insertion in model container [2023-11-29 05:40:12,406 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:40:12" (1/1) ... [2023-11-29 05:40:12,435 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:40:12,564 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_e03eda3c-3ed6-4cb1-891e-b4ce96c12c95/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-97.i[915,928] [2023-11-29 05:40:12,625 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:40:12,638 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:40:12,650 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_e03eda3c-3ed6-4cb1-891e-b4ce96c12c95/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-97.i[915,928] [2023-11-29 05:40:12,683 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:40:12,699 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:40:12,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:40:12 WrapperNode [2023-11-29 05:40:12,700 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:40:12,701 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:40:12,701 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:40:12,701 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:40:12,707 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:40:12" (1/1) ... [2023-11-29 05:40:12,719 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:40:12" (1/1) ... [2023-11-29 05:40:12,766 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 184 [2023-11-29 05:40:12,767 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:40:12,768 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:40:12,768 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:40:12,768 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:40:12,778 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:40:12" (1/1) ... [2023-11-29 05:40:12,779 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:40:12" (1/1) ... [2023-11-29 05:40:12,783 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:40:12" (1/1) ... [2023-11-29 05:40:12,804 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 05:40:12,805 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:40:12" (1/1) ... [2023-11-29 05:40:12,805 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:40:12" (1/1) ... [2023-11-29 05:40:12,817 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:40:12" (1/1) ... [2023-11-29 05:40:12,821 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:40:12" (1/1) ... [2023-11-29 05:40:12,825 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:40:12" (1/1) ... [2023-11-29 05:40:12,828 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:40:12" (1/1) ... [2023-11-29 05:40:12,835 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:40:12,836 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:40:12,837 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:40:12,837 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:40:12,838 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:40:12" (1/1) ... [2023-11-29 05:40:12,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:40:12,856 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03eda3c-3ed6-4cb1-891e-b4ce96c12c95/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:40:12,868 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03eda3c-3ed6-4cb1-891e-b4ce96c12c95/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:40:12,872 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03eda3c-3ed6-4cb1-891e-b4ce96c12c95/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:40:12,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:40:12,904 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 05:40:12,905 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 05:40:12,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 05:40:12,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:40:12,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:40:12,979 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:40:12,981 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:40:13,368 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:40:13,396 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:40:13,396 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 05:40:13,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:40:13 BoogieIcfgContainer [2023-11-29 05:40:13,397 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:40:13,400 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:40:13,400 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:40:13,403 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:40:13,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:40:12" (1/3) ... [2023-11-29 05:40:13,405 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4982e3ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:40:13, skipping insertion in model container [2023-11-29 05:40:13,405 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:40:12" (2/3) ... [2023-11-29 05:40:13,405 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4982e3ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:40:13, skipping insertion in model container [2023-11-29 05:40:13,405 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:40:13" (3/3) ... [2023-11-29 05:40:13,407 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-97.i [2023-11-29 05:40:13,427 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:40:13,427 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 05:40:13,481 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:40:13,488 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;@75c3d315, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:40:13,488 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 05:40:13,492 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 53 states have (on average 1.528301886792453) internal successors, (81), 54 states have internal predecessors, (81), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 05:40:13,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-29 05:40:13,506 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:40:13,507 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:40:13,508 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:40:13,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:40:13,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1106822011, now seen corresponding path program 1 times [2023-11-29 05:40:13,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:40:13,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568222120] [2023-11-29 05:40:13,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:40:13,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:40:13,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:13,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:40:13,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:13,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:40:13,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:13,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:40:13,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:13,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:40:13,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:13,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:40:13,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:13,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 05:40:13,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:13,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 05:40:13,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:13,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 05:40:13,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:13,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 05:40:13,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:13,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 05:40:13,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:13,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 05:40:13,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:13,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 05:40:13,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:13,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 05:40:13,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:13,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:40:13,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:13,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 05:40:13,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:13,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 05:40:13,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:13,860 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-29 05:40:13,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:40:13,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568222120] [2023-11-29 05:40:13,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568222120] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:40:13,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:40:13,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:40:13,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090241912] [2023-11-29 05:40:13,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:40:13,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 05:40:13,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:40:13,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 05:40:13,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 05:40:13,900 INFO L87 Difference]: Start difference. First operand has 72 states, 53 states have (on average 1.528301886792453) internal successors, (81), 54 states have internal predecessors, (81), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-29 05:40:13,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:40:13,942 INFO L93 Difference]: Finished difference Result 141 states and 240 transitions. [2023-11-29 05:40:13,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 05:40:13,945 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 107 [2023-11-29 05:40:13,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:40:13,954 INFO L225 Difference]: With dead ends: 141 [2023-11-29 05:40:13,955 INFO L226 Difference]: Without dead ends: 70 [2023-11-29 05:40:13,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 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 05:40:13,963 INFO L413 NwaCegarLoop]: 105 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, 105 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 05:40:13,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:40:13,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-11-29 05:40:14,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2023-11-29 05:40:14,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 52 states have (on average 1.4615384615384615) internal successors, (76), 52 states have internal predecessors, (76), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 05:40:14,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 108 transitions. [2023-11-29 05:40:14,017 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 108 transitions. Word has length 107 [2023-11-29 05:40:14,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:40:14,017 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 108 transitions. [2023-11-29 05:40:14,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-29 05:40:14,018 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 108 transitions. [2023-11-29 05:40:14,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-29 05:40:14,022 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:40:14,022 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:40:14,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 05:40:14,022 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:40:14,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:40:14,023 INFO L85 PathProgramCache]: Analyzing trace with hash -695930423, now seen corresponding path program 1 times [2023-11-29 05:40:14,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:40:14,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343232791] [2023-11-29 05:40:14,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:40:14,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:40:14,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:14,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:40:14,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:14,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:40:14,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:14,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:40:14,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:14,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:40:14,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:14,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:40:14,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:14,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 05:40:14,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:14,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 05:40:14,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:14,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 05:40:14,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:14,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 05:40:14,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:14,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 05:40:14,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:14,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 05:40:14,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:14,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 05:40:14,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:14,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 05:40:14,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:14,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:40:14,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:14,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 05:40:14,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:14,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 05:40:14,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:14,277 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-29 05:40:14,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:40:14,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343232791] [2023-11-29 05:40:14,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343232791] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:40:14,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:40:14,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:40:14,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199902044] [2023-11-29 05:40:14,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:40:14,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:40:14,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:40:14,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:40:14,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:40:14,281 INFO L87 Difference]: Start difference. First operand 70 states and 108 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 05:40:14,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:40:14,369 INFO L93 Difference]: Finished difference Result 197 states and 302 transitions. [2023-11-29 05:40:14,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:40:14,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 107 [2023-11-29 05:40:14,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:40:14,373 INFO L225 Difference]: With dead ends: 197 [2023-11-29 05:40:14,373 INFO L226 Difference]: Without dead ends: 128 [2023-11-29 05:40:14,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:40:14,376 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 95 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:40:14,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 248 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:40:14,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-11-29 05:40:14,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 90. [2023-11-29 05:40:14,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 72 states have (on average 1.4444444444444444) internal successors, (104), 72 states have internal predecessors, (104), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 05:40:14,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 136 transitions. [2023-11-29 05:40:14,394 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 136 transitions. Word has length 107 [2023-11-29 05:40:14,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:40:14,396 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 136 transitions. [2023-11-29 05:40:14,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 05:40:14,396 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 136 transitions. [2023-11-29 05:40:14,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-29 05:40:14,398 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:40:14,399 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:40:14,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 05:40:14,399 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:40:14,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:40:14,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1707047673, now seen corresponding path program 1 times [2023-11-29 05:40:14,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:40:14,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039910341] [2023-11-29 05:40:14,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:40:14,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:40:14,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:14,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:40:14,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:14,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:40:14,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:14,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:40:14,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:14,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:40:14,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:14,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:40:14,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:14,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 05:40:14,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:14,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 05:40:14,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:14,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 05:40:14,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:14,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 05:40:14,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:14,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 05:40:14,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:14,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 05:40:14,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:14,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 05:40:14,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:14,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 05:40:14,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:14,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:40:14,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:14,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 05:40:14,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:14,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 05:40:14,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:14,823 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-29 05:40:14,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:40:14,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039910341] [2023-11-29 05:40:14,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039910341] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:40:14,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:40:14,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:40:14,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057017750] [2023-11-29 05:40:14,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:40:14,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:40:14,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:40:14,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:40:14,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:40:14,827 INFO L87 Difference]: Start difference. First operand 90 states and 136 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 05:40:15,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:40:15,153 INFO L93 Difference]: Finished difference Result 296 states and 448 transitions. [2023-11-29 05:40:15,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:40:15,154 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 107 [2023-11-29 05:40:15,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:40:15,157 INFO L225 Difference]: With dead ends: 296 [2023-11-29 05:40:15,157 INFO L226 Difference]: Without dead ends: 207 [2023-11-29 05:40:15,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:40:15,160 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 131 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 05:40:15,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 328 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 05:40:15,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2023-11-29 05:40:15,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 173. [2023-11-29 05:40:15,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 138 states have (on average 1.4202898550724639) internal successors, (196), 138 states have internal predecessors, (196), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-29 05:40:15,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 260 transitions. [2023-11-29 05:40:15,190 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 260 transitions. Word has length 107 [2023-11-29 05:40:15,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:40:15,191 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 260 transitions. [2023-11-29 05:40:15,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 05:40:15,191 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 260 transitions. [2023-11-29 05:40:15,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-29 05:40:15,194 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:40:15,194 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:40:15,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 05:40:15,195 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:40:15,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:40:15,195 INFO L85 PathProgramCache]: Analyzing trace with hash 225979926, now seen corresponding path program 1 times [2023-11-29 05:40:15,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:40:15,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057895040] [2023-11-29 05:40:15,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:40:15,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:40:15,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:15,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:40:15,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:15,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:40:15,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:15,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:40:15,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:15,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:40:15,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:15,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:40:15,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:15,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 05:40:15,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:15,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 05:40:15,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:15,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 05:40:15,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:15,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 05:40:15,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:15,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 05:40:15,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:15,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 05:40:15,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:15,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 05:40:15,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:15,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 05:40:15,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:15,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:40:15,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:15,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 05:40:15,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:15,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 05:40:15,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:15,804 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-29 05:40:15,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:40:15,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057895040] [2023-11-29 05:40:15,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057895040] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:40:15,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:40:15,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:40:15,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732999164] [2023-11-29 05:40:15,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:40:15,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:40:15,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:40:15,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:40:15,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:40:15,807 INFO L87 Difference]: Start difference. First operand 173 states and 260 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 05:40:16,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:40:16,284 INFO L93 Difference]: Finished difference Result 460 states and 684 transitions. [2023-11-29 05:40:16,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:40:16,285 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 108 [2023-11-29 05:40:16,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:40:16,288 INFO L225 Difference]: With dead ends: 460 [2023-11-29 05:40:16,288 INFO L226 Difference]: Without dead ends: 288 [2023-11-29 05:40:16,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:40:16,291 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 117 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:40:16,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 447 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 05:40:16,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2023-11-29 05:40:16,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 266. [2023-11-29 05:40:16,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 214 states have (on average 1.3598130841121496) internal successors, (291), 214 states have internal predecessors, (291), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-29 05:40:16,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 387 transitions. [2023-11-29 05:40:16,324 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 387 transitions. Word has length 108 [2023-11-29 05:40:16,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:40:16,325 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 387 transitions. [2023-11-29 05:40:16,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 05:40:16,325 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 387 transitions. [2023-11-29 05:40:16,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-29 05:40:16,327 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:40:16,327 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:40:16,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 05:40:16,328 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:40:16,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:40:16,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1162960113, now seen corresponding path program 1 times [2023-11-29 05:40:16,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:40:16,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597706267] [2023-11-29 05:40:16,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:40:16,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:40:16,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:16,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:40:16,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:16,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:40:16,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:16,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:40:16,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:16,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:40:16,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:16,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:40:16,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:16,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 05:40:16,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:16,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 05:40:16,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:16,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 05:40:16,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:16,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 05:40:16,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:16,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 05:40:16,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:16,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 05:40:16,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:16,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 05:40:16,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:16,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 05:40:16,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:16,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:40:16,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:16,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 05:40:16,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:16,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 05:40:16,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:16,505 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-29 05:40:16,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:40:16,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597706267] [2023-11-29 05:40:16,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597706267] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:40:16,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:40:16,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:40:16,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958862274] [2023-11-29 05:40:16,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:40:16,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:40:16,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:40:16,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:40:16,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:40:16,509 INFO L87 Difference]: Start difference. First operand 266 states and 387 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 05:40:16,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:40:16,544 INFO L93 Difference]: Finished difference Result 532 states and 775 transitions. [2023-11-29 05:40:16,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:40:16,545 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 109 [2023-11-29 05:40:16,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:40:16,548 INFO L225 Difference]: With dead ends: 532 [2023-11-29 05:40:16,548 INFO L226 Difference]: Without dead ends: 267 [2023-11-29 05:40:16,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:40:16,551 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 0 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:40:16,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 202 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:40:16,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2023-11-29 05:40:16,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2023-11-29 05:40:16,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 215 states have (on average 1.3488372093023255) internal successors, (290), 215 states have internal predecessors, (290), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-29 05:40:16,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 386 transitions. [2023-11-29 05:40:16,576 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 386 transitions. Word has length 109 [2023-11-29 05:40:16,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:40:16,576 INFO L495 AbstractCegarLoop]: Abstraction has 267 states and 386 transitions. [2023-11-29 05:40:16,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 05:40:16,577 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 386 transitions. [2023-11-29 05:40:16,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-29 05:40:16,578 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:40:16,579 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:40:16,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 05:40:16,579 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:40:16,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:40:16,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1421125551, now seen corresponding path program 1 times [2023-11-29 05:40:16,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:40:16,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650203152] [2023-11-29 05:40:16,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:40:16,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:40:16,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:16,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:40:16,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:16,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:40:16,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:16,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:40:16,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:16,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:40:16,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:16,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:40:16,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:16,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 05:40:16,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:16,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 05:40:16,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:16,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 05:40:16,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:16,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 05:40:16,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:16,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 05:40:16,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:16,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 05:40:16,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:16,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 05:40:16,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:16,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 05:40:16,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:16,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:40:16,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:16,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 05:40:16,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:16,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 05:40:16,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:16,789 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-29 05:40:16,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:40:16,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650203152] [2023-11-29 05:40:16,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650203152] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:40:16,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:40:16,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:40:16,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640664859] [2023-11-29 05:40:16,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:40:16,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:40:16,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:40:16,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:40:16,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:40:16,793 INFO L87 Difference]: Start difference. First operand 267 states and 386 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 05:40:17,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:40:17,191 INFO L93 Difference]: Finished difference Result 459 states and 672 transitions. [2023-11-29 05:40:17,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:40:17,193 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 109 [2023-11-29 05:40:17,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:40:17,197 INFO L225 Difference]: With dead ends: 459 [2023-11-29 05:40:17,197 INFO L226 Difference]: Without dead ends: 369 [2023-11-29 05:40:17,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:40:17,198 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 199 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 05:40:17,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 522 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 05:40:17,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2023-11-29 05:40:17,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 273. [2023-11-29 05:40:17,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 221 states have (on average 1.3529411764705883) internal successors, (299), 221 states have internal predecessors, (299), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-29 05:40:17,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 395 transitions. [2023-11-29 05:40:17,245 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 395 transitions. Word has length 109 [2023-11-29 05:40:17,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:40:17,245 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 395 transitions. [2023-11-29 05:40:17,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 05:40:17,246 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 395 transitions. [2023-11-29 05:40:17,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-29 05:40:17,247 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:40:17,247 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:40:17,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 05:40:17,248 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:40:17,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:40:17,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1919352067, now seen corresponding path program 1 times [2023-11-29 05:40:17,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:40:17,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625829827] [2023-11-29 05:40:17,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:40:17,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:40:17,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:17,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:40:17,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:17,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:40:17,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:17,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:40:17,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:17,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:40:17,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:17,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:40:17,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:17,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 05:40:17,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:17,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 05:40:17,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:17,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 05:40:17,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:17,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 05:40:17,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:17,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 05:40:17,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:17,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 05:40:17,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:17,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 05:40:17,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:17,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 05:40:17,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:17,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:40:17,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:17,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 05:40:17,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:17,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 05:40:17,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:17,630 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-29 05:40:17,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:40:17,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625829827] [2023-11-29 05:40:17,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625829827] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:40:17,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:40:17,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:40:17,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914449178] [2023-11-29 05:40:17,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:40:17,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:40:17,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:40:17,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:40:17,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:40:17,633 INFO L87 Difference]: Start difference. First operand 273 states and 395 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 05:40:17,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:40:17,763 INFO L93 Difference]: Finished difference Result 577 states and 837 transitions. [2023-11-29 05:40:17,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:40:17,763 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 109 [2023-11-29 05:40:17,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:40:17,766 INFO L225 Difference]: With dead ends: 577 [2023-11-29 05:40:17,766 INFO L226 Difference]: Without dead ends: 305 [2023-11-29 05:40:17,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:40:17,769 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 95 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:40:17,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 345 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:40:17,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2023-11-29 05:40:17,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 273. [2023-11-29 05:40:17,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 221 states have (on average 1.3167420814479638) internal successors, (291), 221 states have internal predecessors, (291), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-29 05:40:17,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 387 transitions. [2023-11-29 05:40:17,837 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 387 transitions. Word has length 109 [2023-11-29 05:40:17,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:40:17,838 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 387 transitions. [2023-11-29 05:40:17,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 05:40:17,839 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 387 transitions. [2023-11-29 05:40:17,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-29 05:40:17,840 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:40:17,840 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:40:17,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 05:40:17,841 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:40:17,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:40:17,841 INFO L85 PathProgramCache]: Analyzing trace with hash 504397503, now seen corresponding path program 1 times [2023-11-29 05:40:17,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:40:17,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243673965] [2023-11-29 05:40:17,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:40:17,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:40:17,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:18,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:40:18,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:18,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:40:18,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:18,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:40:18,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:18,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:40:18,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:18,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:40:18,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:18,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 05:40:18,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:18,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 05:40:18,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:18,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 05:40:18,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:18,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 05:40:18,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:18,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 05:40:18,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:18,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 05:40:18,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:18,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 05:40:18,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:18,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 05:40:18,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:18,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:40:18,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:18,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 05:40:18,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:18,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 05:40:18,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:18,130 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-29 05:40:18,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:40:18,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243673965] [2023-11-29 05:40:18,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243673965] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:40:18,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:40:18,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:40:18,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006794726] [2023-11-29 05:40:18,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:40:18,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:40:18,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:40:18,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:40:18,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:40:18,132 INFO L87 Difference]: Start difference. First operand 273 states and 387 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 05:40:18,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:40:18,835 INFO L93 Difference]: Finished difference Result 744 states and 1053 transitions. [2023-11-29 05:40:18,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:40:18,836 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 113 [2023-11-29 05:40:18,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:40:18,841 INFO L225 Difference]: With dead ends: 744 [2023-11-29 05:40:18,841 INFO L226 Difference]: Without dead ends: 648 [2023-11-29 05:40:18,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:40:18,842 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 238 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:40:18,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 444 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 05:40:18,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2023-11-29 05:40:18,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 469. [2023-11-29 05:40:18,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 383 states have (on average 1.318537859007833) internal successors, (505), 383 states have internal predecessors, (505), 80 states have call successors, (80), 5 states have call predecessors, (80), 5 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2023-11-29 05:40:18,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 665 transitions. [2023-11-29 05:40:18,978 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 665 transitions. Word has length 113 [2023-11-29 05:40:18,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:40:18,978 INFO L495 AbstractCegarLoop]: Abstraction has 469 states and 665 transitions. [2023-11-29 05:40:18,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 05:40:18,979 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 665 transitions. [2023-11-29 05:40:18,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-29 05:40:18,980 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:40:18,980 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:40:18,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 05:40:18,981 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:40:18,981 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:40:18,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1761442810, now seen corresponding path program 1 times [2023-11-29 05:40:18,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:40:18,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981320803] [2023-11-29 05:40:18,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:40:18,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:40:19,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:41:16,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:41:16,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:41:16,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:41:16,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:41:16,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:41:16,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:41:16,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:41:16,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:41:16,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:41:16,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:41:16,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 05:41:16,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:41:16,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 05:41:16,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:41:16,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 05:41:16,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:41:16,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 05:41:16,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:41:16,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 05:41:16,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:41:16,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 05:41:16,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:41:16,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 05:41:16,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:41:16,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 05:41:16,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:41:16,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:41:16,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:41:16,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 05:41:16,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:41:16,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 05:41:16,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:41:16,503 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-29 05:41:16,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:41:16,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981320803] [2023-11-29 05:41:16,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981320803] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:41:16,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:41:16,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 05:41:16,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154479333] [2023-11-29 05:41:16,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:41:16,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 05:41:16,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:41:16,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 05:41:16,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:41:16,506 INFO L87 Difference]: Start difference. First operand 469 states and 665 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 05:41:20,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.88s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:41:29,225 WARN L293 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 158 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 05:41:37,222 WARN L293 SmtUtils]: Spent 7.78s on a formula simplification that was a NOOP. DAG size: 161 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 05:41:48,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:41:48,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:41:48,328 INFO L93 Difference]: Finished difference Result 1071 states and 1487 transitions. [2023-11-29 05:41:48,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 05:41:48,329 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 113 [2023-11-29 05:41:48,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:41:48,334 INFO L225 Difference]: With dead ends: 1071 [2023-11-29 05:41:48,334 INFO L226 Difference]: Without dead ends: 892 [2023-11-29 05:41:48,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 44.1s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2023-11-29 05:41:48,336 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 298 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2023-11-29 05:41:48,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 339 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 7.9s Time] [2023-11-29 05:41:48,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2023-11-29 05:41:48,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 813. [2023-11-29 05:41:48,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 712 states have (on average 1.3258426966292134) internal successors, (944), 717 states have internal predecessors, (944), 90 states have call successors, (90), 10 states have call predecessors, (90), 10 states have return successors, (90), 85 states have call predecessors, (90), 90 states have call successors, (90) [2023-11-29 05:41:48,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1124 transitions. [2023-11-29 05:41:48,465 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1124 transitions. Word has length 113 [2023-11-29 05:41:48,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:41:48,465 INFO L495 AbstractCegarLoop]: Abstraction has 813 states and 1124 transitions. [2023-11-29 05:41:48,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 05:41:48,466 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1124 transitions. [2023-11-29 05:41:48,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-29 05:41:48,467 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:41:48,467 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:41:48,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 05:41:48,467 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:41:48,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:41:48,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1542588092, now seen corresponding path program 1 times [2023-11-29 05:41:48,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:41:48,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151286152] [2023-11-29 05:41:48,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:41:48,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:41:48,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:41:48,519 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:41:48,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:41:48,590 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:41:48,590 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 05:41:48,591 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 05:41:48,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 05:41:48,595 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:41:48,598 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 05:41:48,656 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated [2023-11-29 05:41:48,657 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated [2023-11-29 05:41:48,658 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated [2023-11-29 05:41:48,658 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite16 could not be translated [2023-11-29 05:41:48,658 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite17 could not be translated [2023-11-29 05:41:48,659 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite16 could not be translated [2023-11-29 05:41:48,659 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated [2023-11-29 05:41:48,659 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite17 could not be translated [2023-11-29 05:41:48,659 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated [2023-11-29 05:41:48,660 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite16 could not be translated [2023-11-29 05:41:48,660 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short21 could not be translated [2023-11-29 05:41:48,660 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated [2023-11-29 05:41:48,660 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite16 could not be translated [2023-11-29 05:41:48,660 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite17 could not be translated [2023-11-29 05:41:48,678 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 05:41:48 BoogieIcfgContainer [2023-11-29 05:41:48,678 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 05:41:48,679 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 05:41:48,679 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 05:41:48,679 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 05:41:48,680 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:40:13" (3/4) ... [2023-11-29 05:41:48,681 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 05:41:48,682 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 05:41:48,683 INFO L158 Benchmark]: Toolchain (without parser) took 96284.98ms. Allocated memory was 157.3MB in the beginning and 226.5MB in the end (delta: 69.2MB). Free memory was 120.3MB in the beginning and 166.9MB in the end (delta: -46.7MB). Peak memory consumption was 24.9MB. Max. memory is 16.1GB. [2023-11-29 05:41:48,683 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 98.6MB. Free memory was 67.9MB in the beginning and 67.8MB in the end (delta: 25.7kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:41:48,683 INFO L158 Benchmark]: CACSL2BoogieTranslator took 301.07ms. Allocated memory is still 157.3MB. Free memory was 119.9MB in the beginning and 106.5MB in the end (delta: 13.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-29 05:41:48,684 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.21ms. Allocated memory is still 157.3MB. Free memory was 106.5MB in the beginning and 102.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 05:41:48,684 INFO L158 Benchmark]: Boogie Preprocessor took 68.01ms. Allocated memory is still 157.3MB. Free memory was 102.3MB in the beginning and 96.4MB in the end (delta: 5.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 05:41:48,684 INFO L158 Benchmark]: RCFGBuilder took 560.91ms. Allocated memory is still 157.3MB. Free memory was 96.0MB in the beginning and 113.1MB in the end (delta: -17.1MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. [2023-11-29 05:41:48,685 INFO L158 Benchmark]: TraceAbstraction took 95278.23ms. Allocated memory was 157.3MB in the beginning and 226.5MB in the end (delta: 69.2MB). Free memory was 112.3MB in the beginning and 168.0MB in the end (delta: -55.7MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. [2023-11-29 05:41:48,685 INFO L158 Benchmark]: Witness Printer took 3.55ms. Allocated memory is still 226.5MB. Free memory was 168.0MB in the beginning and 166.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 05:41:48,687 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 98.6MB. Free memory was 67.9MB in the beginning and 67.8MB in the end (delta: 25.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 301.07ms. Allocated memory is still 157.3MB. Free memory was 119.9MB in the beginning and 106.5MB in the end (delta: 13.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.21ms. Allocated memory is still 157.3MB. Free memory was 106.5MB in the beginning and 102.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.01ms. Allocated memory is still 157.3MB. Free memory was 102.3MB in the beginning and 96.4MB in the end (delta: 5.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 560.91ms. Allocated memory is still 157.3MB. Free memory was 96.0MB in the beginning and 113.1MB in the end (delta: -17.1MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. * TraceAbstraction took 95278.23ms. Allocated memory was 157.3MB in the beginning and 226.5MB in the end (delta: 69.2MB). Free memory was 112.3MB in the beginning and 168.0MB in the end (delta: -55.7MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. * Witness Printer took 3.55ms. Allocated memory is still 226.5MB. Free memory was 168.0MB in the beginning and 166.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short21 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite17 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 122. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 2; [L23] signed long int var_1_5 = 5; [L24] unsigned char var_1_8 = 0; [L25] float var_1_9 = 128.6; [L26] float var_1_10 = 32.5; [L27] unsigned char var_1_11 = 16; [L28] unsigned char var_1_12 = 64; [L29] unsigned char var_1_13 = 4; [L30] unsigned char var_1_14 = 4; [L31] unsigned long int var_1_15 = 0; [L32] signed short int var_1_16 = 0; [L33] signed char var_1_17 = 1; [L34] signed char var_1_18 = -1; [L35] signed char var_1_19 = 0; [L36] signed long int var_1_20 = -64; [L37] unsigned char var_1_22 = 0; [L38] unsigned char var_1_23 = 0; [L39] signed long int last_1_var_1_5 = 5; [L126] isInitial = 1 [L127] FCALL initially() [L128] COND TRUE 1 [L129] CALL updateLastVariables() [L119] last_1_var_1_5 = var_1_5 [L129] RET updateLastVariables() [L130] CALL updateVariables() [L92] var_1_9 = __VERIFIER_nondet_float() [L93] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L93] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L94] var_1_10 = __VERIFIER_nondet_float() [L95] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L95] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L96] var_1_11 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L97] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L98] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L98] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L99] var_1_12 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_12 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L100] RET assume_abort_if_not(var_1_12 >= 63) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L101] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L101] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L102] var_1_13 = __VERIFIER_nondet_uchar() [L103] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L103] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L104] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L104] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L105] var_1_14 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L106] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L107] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L107] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L108] var_1_18 = __VERIFIER_nondet_char() [L109] CALL assume_abort_if_not(var_1_18 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L109] RET assume_abort_if_not(var_1_18 >= -31) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L110] CALL assume_abort_if_not(var_1_18 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L110] RET assume_abort_if_not(var_1_18 <= 32) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L111] var_1_19 = __VERIFIER_nondet_char() [L112] CALL assume_abort_if_not(var_1_19 >= -15) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L112] RET assume_abort_if_not(var_1_19 >= -15) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L113] CALL assume_abort_if_not(var_1_19 <= 16) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L113] RET assume_abort_if_not(var_1_19 <= 16) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L114] var_1_23 = __VERIFIER_nondet_uchar() [L115] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_5=5, var_1_8=0] [L115] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_5=5, var_1_8=0] [L116] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L116] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L130] RET updateVariables() [L131] CALL step() [L43] COND FALSE !(var_1_9 > var_1_10) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L46] var_1_20 = var_1_8 [L47] var_1_22 = var_1_23 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L48] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L51] var_1_16 = (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=1, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L52] COND FALSE !(\read(var_1_22)) [L59] var_1_17 = -32 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L61] unsigned long int stepLocal_1 = var_1_20 + var_1_15; [L62] signed long int stepLocal_0 = var_1_20; VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_1=0, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L63] COND TRUE stepLocal_1 < -200 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_1=0, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L64] COND FALSE !(\read(var_1_22)) [L71] var_1_1 = var_1_20 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_1=0, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=0, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L76] signed long int stepLocal_4 = 256; [L77] unsigned char stepLocal_3 = var_1_22; [L78] unsigned long int stepLocal_2 = var_1_15; VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_1=0, stepLocal_2=0, stepLocal_3=0, stepLocal_4=256, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=0, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L79] COND FALSE !(stepLocal_4 > (var_1_15 - (last_1_var_1_5 + var_1_8))) VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_1=0, stepLocal_2=0, stepLocal_3=0, stepLocal_4=256, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=0, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L82] COND FALSE !(stepLocal_3 || var_1_22) [L87] var_1_5 = -10000 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_1=0, stepLocal_2=0, stepLocal_3=0, stepLocal_4=256, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=0, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L131] RET step() [L132] CALL, EXPR property() [L122] EXPR (((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=0, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L122] EXPR (256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=0, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L122] EXPR (var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=0, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L122] EXPR (256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=0, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L122] EXPR (((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=0, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L122] EXPR (((((((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_22 ? (var_1_15 == ((unsigned long int) var_1_8)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_22 ? ((var_1_14 < (var_1_13 & (var_1_15 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=0, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L122-L123] return (((((((((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_22 ? (var_1_15 == ((unsigned long int) var_1_8)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_22 ? ((var_1_14 < (var_1_13 & (var_1_15 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32)))) && (var_1_20 == ((signed long int) var_1_8))) && (var_1_22 == ((unsigned char) var_1_23)) ; [L132] RET, EXPR property() [L132] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=0, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=0, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 72 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 95.1s, OverallIterations: 10, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 34.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1173 SdHoareTripleChecker+Valid, 9.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1173 mSDsluCounter, 2980 SdHoareTripleChecker+Invalid, 9.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1752 mSDsCounter, 264 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1097 IncrementalHoareTripleChecker+Invalid, 1361 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 264 mSolverCounterUnsat, 1228 mSDtfsCounter, 1097 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 370 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 44.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=813occurred in iteration=9, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 9 MinimizatonAttempts, 480 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 59.7s InterpolantComputationTime, 1095 NumberOfCodeBlocks, 1095 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 973 ConstructedInterpolants, 0 QuantifiedInterpolants, 13712 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 4320/4320 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-29 05:41:48,718 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03eda3c-3ed6-4cb1-891e-b4ce96c12c95/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_e03eda3c-3ed6-4cb1-891e-b4ce96c12c95/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03eda3c-3ed6-4cb1-891e-b4ce96c12c95/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_e03eda3c-3ed6-4cb1-891e-b4ce96c12c95/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03eda3c-3ed6-4cb1-891e-b4ce96c12c95/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-97.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03eda3c-3ed6-4cb1-891e-b4ce96c12c95/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03eda3c-3ed6-4cb1-891e-b4ce96c12c95/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 abf1fadcf9bfc6046971a4719244290526d1ce32a1ee2d2e74022cac98e38aab --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:41:50,781 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:41:50,854 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03eda3c-3ed6-4cb1-891e-b4ce96c12c95/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-29 05:41:50,859 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:41:50,859 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:41:50,885 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:41:50,885 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:41:50,886 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:41:50,887 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:41:50,887 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:41:50,888 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:41:50,889 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:41:50,889 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:41:50,890 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:41:50,890 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:41:50,891 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:41:50,892 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 05:41:50,892 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 05:41:50,893 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 05:41:50,893 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:41:50,894 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 05:41:50,894 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:41:50,895 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 05:41:50,895 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 05:41:50,896 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 05:41:50,896 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 05:41:50,896 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 05:41:50,897 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 05:41:50,897 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:41:50,898 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:41:50,898 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:41:50,899 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:41:50,899 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:41:50,899 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:41:50,900 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:41:50,900 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:41:50,900 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 05:41:50,900 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 05:41:50,900 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 05:41:50,901 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:41:50,901 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:41:50,901 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 05:41:50,901 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:41:50,902 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:41:50,902 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 05:41:50,902 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_e03eda3c-3ed6-4cb1-891e-b4ce96c12c95/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_e03eda3c-3ed6-4cb1-891e-b4ce96c12c95/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 -> abf1fadcf9bfc6046971a4719244290526d1ce32a1ee2d2e74022cac98e38aab [2023-11-29 05:41:51,225 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:41:51,247 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:41:51,249 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:41:51,251 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:41:51,251 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:41:51,252 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03eda3c-3ed6-4cb1-891e-b4ce96c12c95/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-97.i [2023-11-29 05:41:54,048 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:41:54,282 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:41:54,283 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03eda3c-3ed6-4cb1-891e-b4ce96c12c95/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-97.i [2023-11-29 05:41:54,294 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03eda3c-3ed6-4cb1-891e-b4ce96c12c95/bin/uautomizer-verify-BQ2R08f2Ya/data/8d5f2b3c7/e309b794415b490ba66366398a058acb/FLAG9eb79ab74 [2023-11-29 05:41:54,311 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03eda3c-3ed6-4cb1-891e-b4ce96c12c95/bin/uautomizer-verify-BQ2R08f2Ya/data/8d5f2b3c7/e309b794415b490ba66366398a058acb [2023-11-29 05:41:54,314 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:41:54,316 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:41:54,318 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:41:54,318 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:41:54,324 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:41:54,324 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:41:54" (1/1) ... [2023-11-29 05:41:54,326 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bd74335 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:41:54, skipping insertion in model container [2023-11-29 05:41:54,326 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:41:54" (1/1) ... [2023-11-29 05:41:54,361 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:41:54,519 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_e03eda3c-3ed6-4cb1-891e-b4ce96c12c95/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-97.i[915,928] [2023-11-29 05:41:54,570 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:41:54,589 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:41:54,605 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_e03eda3c-3ed6-4cb1-891e-b4ce96c12c95/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-97.i[915,928] [2023-11-29 05:41:54,678 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:41:54,701 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:41:54,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:41:54 WrapperNode [2023-11-29 05:41:54,702 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:41:54,704 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:41:54,704 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:41:54,704 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:41:54,711 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:41:54" (1/1) ... [2023-11-29 05:41:54,724 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:41:54" (1/1) ... [2023-11-29 05:41:54,755 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 126 [2023-11-29 05:41:54,755 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:41:54,756 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:41:54,756 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:41:54,756 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:41:54,766 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:41:54" (1/1) ... [2023-11-29 05:41:54,766 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:41:54" (1/1) ... [2023-11-29 05:41:54,771 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:41:54" (1/1) ... [2023-11-29 05:41:54,785 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 05:41:54,785 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:41:54" (1/1) ... [2023-11-29 05:41:54,786 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:41:54" (1/1) ... [2023-11-29 05:41:54,798 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:41:54" (1/1) ... [2023-11-29 05:41:54,802 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:41:54" (1/1) ... [2023-11-29 05:41:54,805 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:41:54" (1/1) ... [2023-11-29 05:41:54,808 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:41:54" (1/1) ... [2023-11-29 05:41:54,813 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:41:54,814 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:41:54,814 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:41:54,814 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:41:54,815 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:41:54" (1/1) ... [2023-11-29 05:41:54,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:41:54,840 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03eda3c-3ed6-4cb1-891e-b4ce96c12c95/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:41:54,853 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03eda3c-3ed6-4cb1-891e-b4ce96c12c95/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:41:54,856 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03eda3c-3ed6-4cb1-891e-b4ce96c12c95/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:41:54,891 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:41:54,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 05:41:54,892 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 05:41:54,892 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 05:41:54,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:41:54,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:41:54,989 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:41:54,992 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:41:55,291 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:41:55,342 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:41:55,343 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 05:41:55,343 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:41:55 BoogieIcfgContainer [2023-11-29 05:41:55,344 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:41:55,348 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:41:55,348 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:41:55,351 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:41:55,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:41:54" (1/3) ... [2023-11-29 05:41:55,353 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12126e0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:41:55, skipping insertion in model container [2023-11-29 05:41:55,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:41:54" (2/3) ... [2023-11-29 05:41:55,353 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12126e0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:41:55, skipping insertion in model container [2023-11-29 05:41:55,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:41:55" (3/3) ... [2023-11-29 05:41:55,355 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-97.i [2023-11-29 05:41:55,377 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:41:55,377 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 05:41:55,436 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:41:55,444 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;@316f448, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:41:55,444 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 05:41:55,449 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 34 states have internal predecessors, (48), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 05:41:55,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-29 05:41:55,465 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:41:55,466 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:41:55,467 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:41:55,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:41:55,473 INFO L85 PathProgramCache]: Analyzing trace with hash -882595308, now seen corresponding path program 1 times [2023-11-29 05:41:55,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:41:55,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2147351847] [2023-11-29 05:41:55,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:41:55,490 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:41:55,490 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03eda3c-3ed6-4cb1-891e-b4ce96c12c95/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:41:55,493 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03eda3c-3ed6-4cb1-891e-b4ce96c12c95/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:41:55,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03eda3c-3ed6-4cb1-891e-b4ce96c12c95/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-29 05:41:55,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:41:55,726 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 05:41:55,736 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:41:55,777 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2023-11-29 05:41:55,777 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:41:55,778 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:41:55,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2147351847] [2023-11-29 05:41:55,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2147351847] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:41:55,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:41:55,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:41:55,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511325511] [2023-11-29 05:41:55,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:41:55,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 05:41:55,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:41:55,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 05:41:55,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 05:41:55,822 INFO L87 Difference]: Start difference. First operand has 52 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 34 states have internal predecessors, (48), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-29 05:41:55,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:41:55,873 INFO L93 Difference]: Finished difference Result 101 states and 174 transitions. [2023-11-29 05:41:55,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 05:41:55,877 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 103 [2023-11-29 05:41:55,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:41:55,886 INFO L225 Difference]: With dead ends: 101 [2023-11-29 05:41:55,886 INFO L226 Difference]: Without dead ends: 50 [2023-11-29 05:41:55,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 102 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 05:41:55,894 INFO L413 NwaCegarLoop]: 72 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, 72 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 05:41:55,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:41:55,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-11-29 05:41:55,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2023-11-29 05:41:55,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 05:41:55,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 75 transitions. [2023-11-29 05:41:55,940 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 75 transitions. Word has length 103 [2023-11-29 05:41:55,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:41:55,940 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 75 transitions. [2023-11-29 05:41:55,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-29 05:41:55,940 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 75 transitions. [2023-11-29 05:41:55,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-29 05:41:55,944 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:41:55,944 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:41:55,952 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03eda3c-3ed6-4cb1-891e-b4ce96c12c95/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-29 05:41:56,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03eda3c-3ed6-4cb1-891e-b4ce96c12c95/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:41:56,145 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:41:56,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:41:56,146 INFO L85 PathProgramCache]: Analyzing trace with hash 544711000, now seen corresponding path program 1 times [2023-11-29 05:41:56,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:41:56,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1596295245] [2023-11-29 05:41:56,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:41:56,147 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:41:56,147 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03eda3c-3ed6-4cb1-891e-b4ce96c12c95/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:41:56,149 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03eda3c-3ed6-4cb1-891e-b4ce96c12c95/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:41:56,150 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03eda3c-3ed6-4cb1-891e-b4ce96c12c95/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-29 05:41:56,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:41:56,316 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 05:41:56,323 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:41:56,426 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-11-29 05:41:56,426 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:41:56,427 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:41:56,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1596295245] [2023-11-29 05:41:56,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1596295245] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:41:56,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:41:56,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:41:56,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868298150] [2023-11-29 05:41:56,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:41:56,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:41:56,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:41:56,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:41:56,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:41:56,431 INFO L87 Difference]: Start difference. First operand 50 states and 75 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 05:41:56,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:41:56,817 INFO L93 Difference]: Finished difference Result 105 states and 152 transitions. [2023-11-29 05:41:56,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 05:41:56,819 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) Word has length 103 [2023-11-29 05:41:56,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:41:56,822 INFO L225 Difference]: With dead ends: 105 [2023-11-29 05:41:56,822 INFO L226 Difference]: Without dead ends: 56 [2023-11-29 05:41:56,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2023-11-29 05:41:56,824 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 80 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 05:41:56,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 88 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 05:41:56,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-11-29 05:41:56,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2023-11-29 05:41:56,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 05:41:56,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 71 transitions. [2023-11-29 05:41:56,841 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 71 transitions. Word has length 103 [2023-11-29 05:41:56,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:41:56,842 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 71 transitions. [2023-11-29 05:41:56,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 05:41:56,842 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2023-11-29 05:41:56,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-29 05:41:56,844 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:41:56,844 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:41:56,849 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03eda3c-3ed6-4cb1-891e-b4ce96c12c95/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-29 05:41:57,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03eda3c-3ed6-4cb1-891e-b4ce96c12c95/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:41:57,045 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:41:57,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:41:57,046 INFO L85 PathProgramCache]: Analyzing trace with hash 151683990, now seen corresponding path program 1 times [2023-11-29 05:41:57,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:41:57,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [688005255] [2023-11-29 05:41:57,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:41:57,047 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:41:57,047 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03eda3c-3ed6-4cb1-891e-b4ce96c12c95/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:41:57,049 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03eda3c-3ed6-4cb1-891e-b4ce96c12c95/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:41:57,050 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03eda3c-3ed6-4cb1-891e-b4ce96c12c95/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-29 05:41:57,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:41:57,224 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:41:57,229 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:41:57,495 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-29 05:41:57,495 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:41:57,496 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:41:57,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [688005255] [2023-11-29 05:41:57,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [688005255] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:41:57,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:41:57,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:41:57,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783765018] [2023-11-29 05:41:57,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:41:57,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:41:57,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:41:57,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:41:57,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:41:57,511 INFO L87 Difference]: Start difference. First operand 52 states and 71 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 05:41:57,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:41:57,748 INFO L93 Difference]: Finished difference Result 139 states and 192 transitions. [2023-11-29 05:41:57,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:41:57,748 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 103 [2023-11-29 05:41:57,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:41:57,751 INFO L225 Difference]: With dead ends: 139 [2023-11-29 05:41:57,751 INFO L226 Difference]: Without dead ends: 88 [2023-11-29 05:41:57,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:41:57,754 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 87 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:41:57,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 216 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 05:41:57,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-11-29 05:41:57,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 52. [2023-11-29 05:41:57,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 05:41:57,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 70 transitions. [2023-11-29 05:41:57,775 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 70 transitions. Word has length 103 [2023-11-29 05:41:57,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:41:57,776 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 70 transitions. [2023-11-29 05:41:57,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 05:41:57,777 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 70 transitions. [2023-11-29 05:41:57,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-29 05:41:57,779 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:41:57,779 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:41:57,784 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03eda3c-3ed6-4cb1-891e-b4ce96c12c95/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-29 05:41:57,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03eda3c-3ed6-4cb1-891e-b4ce96c12c95/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:41:57,985 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:41:57,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:41:57,985 INFO L85 PathProgramCache]: Analyzing trace with hash 718816030, now seen corresponding path program 1 times [2023-11-29 05:41:57,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:41:57,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [163696424] [2023-11-29 05:41:57,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:41:57,987 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:41:57,987 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03eda3c-3ed6-4cb1-891e-b4ce96c12c95/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:41:57,988 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03eda3c-3ed6-4cb1-891e-b4ce96c12c95/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:41:57,989 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03eda3c-3ed6-4cb1-891e-b4ce96c12c95/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-29 05:41:58,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:41:58,129 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 05:41:58,134 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:41:58,738 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-29 05:41:58,738 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:41:58,738 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:41:58,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [163696424] [2023-11-29 05:41:58,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [163696424] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:41:58,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:41:58,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:41:58,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783613759] [2023-11-29 05:41:58,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:41:58,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:41:58,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:41:58,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:41:58,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:41:58,742 INFO L87 Difference]: Start difference. First operand 52 states and 70 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 05:41:59,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:41:59,066 INFO L93 Difference]: Finished difference Result 160 states and 214 transitions. [2023-11-29 05:41:59,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:41:59,067 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 104 [2023-11-29 05:41:59,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:41:59,070 INFO L225 Difference]: With dead ends: 160 [2023-11-29 05:41:59,070 INFO L226 Difference]: Without dead ends: 109 [2023-11-29 05:41:59,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:41:59,073 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 42 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 05:41:59,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 204 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 05:41:59,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-11-29 05:41:59,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 101. [2023-11-29 05:41:59,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 64 states have (on average 1.140625) internal successors, (73), 64 states have internal predecessors, (73), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-29 05:41:59,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 137 transitions. [2023-11-29 05:41:59,110 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 137 transitions. Word has length 104 [2023-11-29 05:41:59,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:41:59,112 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 137 transitions. [2023-11-29 05:41:59,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 05:41:59,112 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 137 transitions. [2023-11-29 05:41:59,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-29 05:41:59,115 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:41:59,115 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:41:59,120 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03eda3c-3ed6-4cb1-891e-b4ce96c12c95/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-29 05:41:59,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03eda3c-3ed6-4cb1-891e-b4ce96c12c95/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:41:59,319 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:41:59,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:41:59,320 INFO L85 PathProgramCache]: Analyzing trace with hash 808340375, now seen corresponding path program 1 times [2023-11-29 05:41:59,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:41:59,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [400187588] [2023-11-29 05:41:59,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:41:59,322 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:41:59,322 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03eda3c-3ed6-4cb1-891e-b4ce96c12c95/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:41:59,323 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03eda3c-3ed6-4cb1-891e-b4ce96c12c95/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:41:59,327 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03eda3c-3ed6-4cb1-891e-b4ce96c12c95/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-29 05:41:59,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:41:59,476 INFO L262 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-29 05:41:59,480 INFO L285 TraceCheckSpWp]: Computing forward predicates...