./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-56.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e01ebb9b-a4a1-4483-a707-888a714bd9d3/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e01ebb9b-a4a1-4483-a707-888a714bd9d3/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_e01ebb9b-a4a1-4483-a707-888a714bd9d3/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e01ebb9b-a4a1-4483-a707-888a714bd9d3/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-56.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e01ebb9b-a4a1-4483-a707-888a714bd9d3/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_e01ebb9b-a4a1-4483-a707-888a714bd9d3/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 ced5a78035a498fa1c6524a1d2fe5cd1966b3a3c455f8342c0f34dca1990502c --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:57:29,228 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:57:29,307 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e01ebb9b-a4a1-4483-a707-888a714bd9d3/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 00:57:29,312 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:57:29,313 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:57:29,339 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:57:29,340 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:57:29,340 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:57:29,341 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 00:57:29,341 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 00:57:29,342 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:57:29,343 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:57:29,344 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:57:29,345 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:57:29,345 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:57:29,346 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:57:29,347 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 00:57:29,347 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 00:57:29,348 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 00:57:29,348 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 00:57:29,349 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:57:29,350 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 00:57:29,350 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:57:29,351 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 00:57:29,351 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 00:57:29,351 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 00:57:29,352 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:57:29,352 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:57:29,353 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:57:29,353 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 00:57:29,354 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:57:29,354 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:57:29,355 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:57:29,355 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:57:29,355 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 00:57:29,355 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 00:57:29,356 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 00:57:29,356 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:57:29,356 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:57:29,356 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 00:57:29,356 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:57:29,357 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:57:29,357 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_e01ebb9b-a4a1-4483-a707-888a714bd9d3/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_e01ebb9b-a4a1-4483-a707-888a714bd9d3/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 -> ced5a78035a498fa1c6524a1d2fe5cd1966b3a3c455f8342c0f34dca1990502c [2023-11-29 00:57:29,625 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:57:29,649 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:57:29,652 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:57:29,653 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:57:29,654 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:57:29,655 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e01ebb9b-a4a1-4483-a707-888a714bd9d3/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-56.i [2023-11-29 00:57:32,548 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:57:32,772 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:57:32,773 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e01ebb9b-a4a1-4483-a707-888a714bd9d3/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-56.i [2023-11-29 00:57:32,785 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e01ebb9b-a4a1-4483-a707-888a714bd9d3/bin/uautomizer-verify-BQ2R08f2Ya/data/47adc41de/377c49cc9a2047e5819c10897d87ffc2/FLAG229e75119 [2023-11-29 00:57:32,803 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e01ebb9b-a4a1-4483-a707-888a714bd9d3/bin/uautomizer-verify-BQ2R08f2Ya/data/47adc41de/377c49cc9a2047e5819c10897d87ffc2 [2023-11-29 00:57:32,807 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:57:32,808 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:57:32,810 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:57:32,810 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:57:32,817 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:57:32,818 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:57:32" (1/1) ... [2023-11-29 00:57:32,819 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57e497aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:57:32, skipping insertion in model container [2023-11-29 00:57:32,820 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:57:32" (1/1) ... [2023-11-29 00:57:32,853 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:57:32,994 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_e01ebb9b-a4a1-4483-a707-888a714bd9d3/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-56.i[917,930] [2023-11-29 00:57:33,054 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:57:33,068 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 00:57:33,081 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_e01ebb9b-a4a1-4483-a707-888a714bd9d3/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-56.i[917,930] [2023-11-29 00:57:33,115 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:57:33,134 INFO L206 MainTranslator]: Completed translation [2023-11-29 00:57:33,135 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:57:33 WrapperNode [2023-11-29 00:57:33,135 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:57:33,137 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 00:57:33,137 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 00:57:33,137 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 00:57:33,144 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:57:33" (1/1) ... [2023-11-29 00:57:33,157 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:57:33" (1/1) ... [2023-11-29 00:57:33,209 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 144 [2023-11-29 00:57:33,210 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 00:57:33,211 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 00:57:33,211 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 00:57:33,211 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 00:57:33,223 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:57:33" (1/1) ... [2023-11-29 00:57:33,223 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:57:33" (1/1) ... [2023-11-29 00:57:33,227 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:57:33" (1/1) ... [2023-11-29 00:57:33,246 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-29 00:57:33,246 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:57:33" (1/1) ... [2023-11-29 00:57:33,247 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:57:33" (1/1) ... [2023-11-29 00:57:33,258 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:57:33" (1/1) ... [2023-11-29 00:57:33,263 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:57:33" (1/1) ... [2023-11-29 00:57:33,266 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:57:33" (1/1) ... [2023-11-29 00:57:33,268 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:57:33" (1/1) ... [2023-11-29 00:57:33,274 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 00:57:33,276 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 00:57:33,276 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 00:57:33,276 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 00:57:33,277 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:57:33" (1/1) ... [2023-11-29 00:57:33,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:57:33,296 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e01ebb9b-a4a1-4483-a707-888a714bd9d3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:57:33,309 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e01ebb9b-a4a1-4483-a707-888a714bd9d3/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 00:57:33,315 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e01ebb9b-a4a1-4483-a707-888a714bd9d3/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 00:57:33,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 00:57:33,347 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 00:57:33,347 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 00:57:33,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 00:57:33,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 00:57:33,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 00:57:33,426 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 00:57:33,428 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 00:57:33,774 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 00:57:33,804 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 00:57:33,804 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 00:57:33,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:57:33 BoogieIcfgContainer [2023-11-29 00:57:33,805 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 00:57:33,809 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 00:57:33,809 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 00:57:33,813 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 00:57:33,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:57:32" (1/3) ... [2023-11-29 00:57:33,814 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7874543c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:57:33, skipping insertion in model container [2023-11-29 00:57:33,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:57:33" (2/3) ... [2023-11-29 00:57:33,815 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7874543c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:57:33, skipping insertion in model container [2023-11-29 00:57:33,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:57:33" (3/3) ... [2023-11-29 00:57:33,817 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-56.i [2023-11-29 00:57:33,834 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 00:57:33,834 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 00:57:33,881 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:57:33,888 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;@63617271, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:57:33,889 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 00:57:33,893 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 40 states have internal predecessors, (58), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-29 00:57:33,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-29 00:57:33,908 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:57:33,909 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:57:33,910 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:57:33,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:57:33,915 INFO L85 PathProgramCache]: Analyzing trace with hash 340055048, now seen corresponding path program 1 times [2023-11-29 00:57:33,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:57:33,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329673493] [2023-11-29 00:57:33,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:57:33,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:57:34,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:34,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:57:34,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:34,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:57:34,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:34,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:57:34,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:34,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 00:57:34,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:34,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 00:57:34,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:34,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:57:34,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:34,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:57:34,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:34,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 00:57:34,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:34,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 00:57:34,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:34,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 00:57:34,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:34,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:57:34,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:34,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:57:34,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:34,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:57:34,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:34,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 00:57:34,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:34,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 00:57:34,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:34,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 00:57:34,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:34,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 00:57:34,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:34,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-29 00:57:34,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:34,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:57:34,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:34,502 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-29 00:57:34,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:57:34,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329673493] [2023-11-29 00:57:34,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329673493] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:57:34,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:57:34,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:57:34,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605502158] [2023-11-29 00:57:34,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:57:34,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:57:34,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:57:34,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:57:34,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:57:34,551 INFO L87 Difference]: Start difference. First operand has 61 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 40 states have internal predecessors, (58), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:57:34,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:57:34,652 INFO L93 Difference]: Finished difference Result 143 states and 249 transitions. [2023-11-29 00:57:34,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:57:34,655 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 120 [2023-11-29 00:57:34,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:57:34,667 INFO L225 Difference]: With dead ends: 143 [2023-11-29 00:57:34,668 INFO L226 Difference]: Without dead ends: 83 [2023-11-29 00:57:34,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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 00:57:34,677 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 29 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:57:34,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 155 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:57:34,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-11-29 00:57:34,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 71. [2023-11-29 00:57:34,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 50 states have (on average 1.48) internal successors, (74), 50 states have internal predecessors, (74), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-29 00:57:34,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 112 transitions. [2023-11-29 00:57:34,738 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 112 transitions. Word has length 120 [2023-11-29 00:57:34,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:57:34,741 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 112 transitions. [2023-11-29 00:57:34,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:57:34,742 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 112 transitions. [2023-11-29 00:57:34,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-29 00:57:34,746 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:57:34,747 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:57:34,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 00:57:34,747 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:57:34,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:57:34,748 INFO L85 PathProgramCache]: Analyzing trace with hash 282796746, now seen corresponding path program 1 times [2023-11-29 00:57:34,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:57:34,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005140645] [2023-11-29 00:57:34,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:57:34,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:57:34,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:45,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:57:45,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:45,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:57:45,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:45,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:57:45,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:45,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 00:57:45,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:45,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 00:57:45,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:45,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:57:45,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:45,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:57:45,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:45,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 00:57:45,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:45,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 00:57:45,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:45,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 00:57:45,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:45,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:57:45,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:45,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:57:45,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:45,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:57:45,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:45,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 00:57:45,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:45,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 00:57:45,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:45,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 00:57:45,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:45,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 00:57:45,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:45,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-29 00:57:45,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:45,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:57:45,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:45,148 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-29 00:57:45,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:57:45,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005140645] [2023-11-29 00:57:45,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005140645] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:57:45,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:57:45,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 00:57:45,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032891545] [2023-11-29 00:57:45,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:57:45,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 00:57:45,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:57:45,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 00:57:45,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-29 00:57:45,153 INFO L87 Difference]: Start difference. First operand 71 states and 112 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:57:46,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:57:46,891 INFO L93 Difference]: Finished difference Result 340 states and 514 transitions. [2023-11-29 00:57:46,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-29 00:57:46,892 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 120 [2023-11-29 00:57:46,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:57:46,897 INFO L225 Difference]: With dead ends: 340 [2023-11-29 00:57:46,897 INFO L226 Difference]: Without dead ends: 270 [2023-11-29 00:57:46,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2023-11-29 00:57:46,901 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 341 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 00:57:46,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 574 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 00:57:46,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2023-11-29 00:57:46,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 190. [2023-11-29 00:57:46,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 149 states have (on average 1.5100671140939597) internal successors, (225), 149 states have internal predecessors, (225), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2023-11-29 00:57:46,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 301 transitions. [2023-11-29 00:57:46,947 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 301 transitions. Word has length 120 [2023-11-29 00:57:46,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:57:46,948 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 301 transitions. [2023-11-29 00:57:46,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:57:46,948 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 301 transitions. [2023-11-29 00:57:46,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-29 00:57:46,952 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:57:46,952 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:57:46,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 00:57:46,953 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:57:46,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:57:46,953 INFO L85 PathProgramCache]: Analyzing trace with hash 540962184, now seen corresponding path program 1 times [2023-11-29 00:57:46,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:57:46,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4798627] [2023-11-29 00:57:46,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:57:46,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:57:46,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:47,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:57:47,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:47,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:57:47,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:47,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:57:47,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:47,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 00:57:47,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:47,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 00:57:47,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:47,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:57:47,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:47,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:57:47,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:47,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 00:57:47,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:47,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 00:57:47,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:47,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 00:57:47,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:47,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:57:47,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:47,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:57:47,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:47,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:57:47,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:47,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 00:57:47,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:47,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 00:57:47,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:47,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 00:57:47,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:47,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 00:57:47,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:47,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-29 00:57:47,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:47,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:57:47,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:47,094 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-29 00:57:47,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:57:47,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4798627] [2023-11-29 00:57:47,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4798627] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:57:47,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:57:47,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:57:47,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836615520] [2023-11-29 00:57:47,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:57:47,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:57:47,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:57:47,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:57:47,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:57:47,097 INFO L87 Difference]: Start difference. First operand 190 states and 301 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:57:47,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:57:47,132 INFO L93 Difference]: Finished difference Result 364 states and 575 transitions. [2023-11-29 00:57:47,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:57:47,133 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 120 [2023-11-29 00:57:47,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:57:47,135 INFO L225 Difference]: With dead ends: 364 [2023-11-29 00:57:47,136 INFO L226 Difference]: Without dead ends: 175 [2023-11-29 00:57:47,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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 00:57:47,139 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 0 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:57:47,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 166 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:57:47,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2023-11-29 00:57:47,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2023-11-29 00:57:47,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 134 states have (on average 1.4701492537313432) internal successors, (197), 134 states have internal predecessors, (197), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2023-11-29 00:57:47,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 273 transitions. [2023-11-29 00:57:47,163 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 273 transitions. Word has length 120 [2023-11-29 00:57:47,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:57:47,164 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 273 transitions. [2023-11-29 00:57:47,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:57:47,164 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 273 transitions. [2023-11-29 00:57:47,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-29 00:57:47,166 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:57:47,167 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:57:47,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 00:57:47,167 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:57:47,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:57:47,167 INFO L85 PathProgramCache]: Analyzing trace with hash -246750966, now seen corresponding path program 1 times [2023-11-29 00:57:47,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:57:47,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316421017] [2023-11-29 00:57:47,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:57:47,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:57:47,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:47,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:57:47,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:47,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:57:47,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:47,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:57:47,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:47,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 00:57:47,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:47,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 00:57:47,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:47,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:57:47,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:47,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:57:47,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:47,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 00:57:47,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:47,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 00:57:47,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:47,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 00:57:47,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:47,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:57:47,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:47,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:57:47,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:47,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:57:47,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:47,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 00:57:47,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:47,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 00:57:47,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:47,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 00:57:47,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:47,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 00:57:47,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:47,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-29 00:57:47,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:47,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:57:47,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:47,276 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-29 00:57:47,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:57:47,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316421017] [2023-11-29 00:57:47,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316421017] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:57:47,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:57:47,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:57:47,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544854105] [2023-11-29 00:57:47,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:57:47,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:57:47,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:57:47,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:57:47,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:57:47,279 INFO L87 Difference]: Start difference. First operand 175 states and 273 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:57:47,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:57:47,314 INFO L93 Difference]: Finished difference Result 349 states and 545 transitions. [2023-11-29 00:57:47,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:57:47,314 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 120 [2023-11-29 00:57:47,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:57:47,317 INFO L225 Difference]: With dead ends: 349 [2023-11-29 00:57:47,317 INFO L226 Difference]: Without dead ends: 175 [2023-11-29 00:57:47,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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 00:57:47,320 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 0 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:57:47,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 166 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:57:47,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2023-11-29 00:57:47,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2023-11-29 00:57:47,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 134 states have (on average 1.455223880597015) internal successors, (195), 134 states have internal predecessors, (195), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2023-11-29 00:57:47,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 271 transitions. [2023-11-29 00:57:47,350 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 271 transitions. Word has length 120 [2023-11-29 00:57:47,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:57:47,350 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 271 transitions. [2023-11-29 00:57:47,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:57:47,351 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 271 transitions. [2023-11-29 00:57:47,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-29 00:57:47,353 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:57:47,353 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:57:47,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 00:57:47,353 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:57:47,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:57:47,354 INFO L85 PathProgramCache]: Analyzing trace with hash 11414472, now seen corresponding path program 1 times [2023-11-29 00:57:47,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:57:47,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841924457] [2023-11-29 00:57:47,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:57:47,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:57:47,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:40,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:58:40,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:40,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:58:40,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:40,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:58:40,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:40,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 00:58:40,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:40,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 00:58:40,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:40,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:58:40,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:40,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:58:40,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:40,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 00:58:40,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:40,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 00:58:40,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:40,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 00:58:40,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:40,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:58:40,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:40,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:58:40,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:40,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:58:40,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:40,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 00:58:40,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:40,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 00:58:40,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:40,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 00:58:40,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:40,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 00:58:40,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:40,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-29 00:58:40,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:40,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:58:40,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:40,123 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-29 00:58:40,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:58:40,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841924457] [2023-11-29 00:58:40,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841924457] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:58:40,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:58:40,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 00:58:40,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860327808] [2023-11-29 00:58:40,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:58:40,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 00:58:40,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:58:40,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 00:58:40,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:58:40,127 INFO L87 Difference]: Start difference. First operand 175 states and 271 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:58:42,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:58:42,796 INFO L93 Difference]: Finished difference Result 320 states and 484 transitions. [2023-11-29 00:58:42,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 00:58:42,797 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 120 [2023-11-29 00:58:42,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:58:42,799 INFO L225 Difference]: With dead ends: 320 [2023-11-29 00:58:42,799 INFO L226 Difference]: Without dead ends: 250 [2023-11-29 00:58:42,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2023-11-29 00:58:42,801 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 159 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-29 00:58:42,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 315 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-29 00:58:42,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2023-11-29 00:58:42,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 188. [2023-11-29 00:58:42,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 147 states have (on average 1.469387755102041) internal successors, (216), 147 states have internal predecessors, (216), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2023-11-29 00:58:42,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 292 transitions. [2023-11-29 00:58:42,821 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 292 transitions. Word has length 120 [2023-11-29 00:58:42,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:58:42,822 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 292 transitions. [2023-11-29 00:58:42,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:58:42,822 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 292 transitions. [2023-11-29 00:58:42,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-29 00:58:42,824 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:58:42,824 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:58:42,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 00:58:42,825 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:58:42,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:58:42,825 INFO L85 PathProgramCache]: Analyzing trace with hash -45843830, now seen corresponding path program 1 times [2023-11-29 00:58:42,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:58:42,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337881940] [2023-11-29 00:58:42,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:58:42,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:58:42,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:42,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:58:42,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:42,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:58:42,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:42,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:58:42,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:42,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 00:58:42,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:42,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 00:58:42,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:42,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:58:42,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:42,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:58:42,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:42,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 00:58:42,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:42,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 00:58:42,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:42,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 00:58:42,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:42,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:58:42,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:42,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:58:42,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:42,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:58:42,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:42,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 00:58:42,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:42,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 00:58:42,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:42,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 00:58:42,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:42,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 00:58:42,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:42,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-29 00:58:42,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:42,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:58:42,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:42,912 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-29 00:58:42,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:58:42,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337881940] [2023-11-29 00:58:42,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337881940] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:58:42,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:58:42,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:58:42,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262869741] [2023-11-29 00:58:42,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:58:42,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:58:42,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:58:42,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:58:42,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:58:42,916 INFO L87 Difference]: Start difference. First operand 188 states and 292 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:58:42,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:58:42,973 INFO L93 Difference]: Finished difference Result 393 states and 605 transitions. [2023-11-29 00:58:42,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:58:42,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 120 [2023-11-29 00:58:42,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:58:42,976 INFO L225 Difference]: With dead ends: 393 [2023-11-29 00:58:42,976 INFO L226 Difference]: Without dead ends: 206 [2023-11-29 00:58:42,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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 00:58:42,978 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 28 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:58:42,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 180 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:58:42,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2023-11-29 00:58:42,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 176. [2023-11-29 00:58:42,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 135 states have (on average 1.4222222222222223) internal successors, (192), 135 states have internal predecessors, (192), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2023-11-29 00:58:42,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 268 transitions. [2023-11-29 00:58:42,998 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 268 transitions. Word has length 120 [2023-11-29 00:58:42,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:58:42,999 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 268 transitions. [2023-11-29 00:58:42,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:58:42,999 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 268 transitions. [2023-11-29 00:58:43,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-29 00:58:43,000 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:58:43,001 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:58:43,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 00:58:43,001 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:58:43,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:58:43,002 INFO L85 PathProgramCache]: Analyzing trace with hash 712479050, now seen corresponding path program 1 times [2023-11-29 00:58:43,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:58:43,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822883992] [2023-11-29 00:58:43,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:58:43,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:58:43,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:01,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:59:01,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:01,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:59:01,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:01,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:59:01,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:01,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 00:59:01,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:01,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 00:59:01,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:01,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:59:01,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:01,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:59:01,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:01,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 00:59:01,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:01,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 00:59:01,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:01,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 00:59:01,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:01,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:59:01,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:01,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:59:01,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:01,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:59:01,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:01,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 00:59:01,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:01,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 00:59:01,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:01,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 00:59:01,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:01,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 00:59:01,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:01,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-29 00:59:01,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:01,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:59:01,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:01,891 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-29 00:59:01,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:59:01,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822883992] [2023-11-29 00:59:01,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822883992] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:59:01,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:59:01,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 00:59:01,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892199319] [2023-11-29 00:59:01,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:59:01,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 00:59:01,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:59:01,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 00:59:01,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:59:01,893 INFO L87 Difference]: Start difference. First operand 176 states and 268 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:59:02,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:59:02,706 INFO L93 Difference]: Finished difference Result 395 states and 590 transitions. [2023-11-29 00:59:02,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 00:59:02,707 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 120 [2023-11-29 00:59:02,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:59:02,709 INFO L225 Difference]: With dead ends: 395 [2023-11-29 00:59:02,710 INFO L226 Difference]: Without dead ends: 220 [2023-11-29 00:59:02,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:59:02,711 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 97 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 00:59:02,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 259 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 00:59:02,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2023-11-29 00:59:02,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 173. [2023-11-29 00:59:02,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 132 states have (on average 1.3863636363636365) internal successors, (183), 132 states have internal predecessors, (183), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2023-11-29 00:59:02,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 259 transitions. [2023-11-29 00:59:02,733 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 259 transitions. Word has length 120 [2023-11-29 00:59:02,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:59:02,734 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 259 transitions. [2023-11-29 00:59:02,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:59:02,734 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 259 transitions. [2023-11-29 00:59:02,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-29 00:59:02,736 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:59:02,736 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:59:02,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 00:59:02,736 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:59:02,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:59:02,737 INFO L85 PathProgramCache]: Analyzing trace with hash 654431032, now seen corresponding path program 1 times [2023-11-29 00:59:02,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:59:02,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418456695] [2023-11-29 00:59:02,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:59:02,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:59:02,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:03,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:59:03,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:03,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:59:03,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:03,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:59:03,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:03,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 00:59:03,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:03,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 00:59:03,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:03,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:59:03,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:03,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:59:03,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:03,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 00:59:03,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:03,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 00:59:03,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:03,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 00:59:03,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:03,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:59:03,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:03,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:59:03,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:03,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:59:03,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:03,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 00:59:03,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:03,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 00:59:03,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:03,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 00:59:03,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:03,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 00:59:03,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:03,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-29 00:59:03,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:03,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:59:03,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:03,186 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-29 00:59:03,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:59:03,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418456695] [2023-11-29 00:59:03,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418456695] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:59:03,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:59:03,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 00:59:03,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479266997] [2023-11-29 00:59:03,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:59:03,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 00:59:03,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:59:03,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 00:59:03,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:59:03,188 INFO L87 Difference]: Start difference. First operand 173 states and 259 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:59:03,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:59:03,341 INFO L93 Difference]: Finished difference Result 311 states and 452 transitions. [2023-11-29 00:59:03,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 00:59:03,342 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 122 [2023-11-29 00:59:03,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:59:03,345 INFO L225 Difference]: With dead ends: 311 [2023-11-29 00:59:03,345 INFO L226 Difference]: Without dead ends: 309 [2023-11-29 00:59:03,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2023-11-29 00:59:03,347 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 75 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:59:03,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 451 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:59:03,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2023-11-29 00:59:03,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 305. [2023-11-29 00:59:03,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 232 states have (on average 1.3362068965517242) internal successors, (310), 234 states have internal predecessors, (310), 68 states have call successors, (68), 4 states have call predecessors, (68), 4 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2023-11-29 00:59:03,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 446 transitions. [2023-11-29 00:59:03,388 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 446 transitions. Word has length 122 [2023-11-29 00:59:03,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:59:03,389 INFO L495 AbstractCegarLoop]: Abstraction has 305 states and 446 transitions. [2023-11-29 00:59:03,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:59:03,389 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 446 transitions. [2023-11-29 00:59:03,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-29 00:59:03,391 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:59:03,391 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:59:03,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 00:59:03,391 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:59:03,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:59:03,392 INFO L85 PathProgramCache]: Analyzing trace with hash 2114238005, now seen corresponding path program 1 times [2023-11-29 00:59:03,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:59:03,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886447202] [2023-11-29 00:59:03,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:59:03,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:59:03,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:03,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:59:03,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:03,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:59:03,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:03,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:59:03,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:03,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 00:59:03,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:03,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 00:59:03,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:03,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:59:03,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:03,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:59:03,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:03,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 00:59:03,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:03,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 00:59:03,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:03,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 00:59:03,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:03,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:59:03,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:03,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:59:03,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:03,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:59:03,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:03,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 00:59:03,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:03,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 00:59:03,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:03,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 00:59:03,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:03,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 00:59:03,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:03,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-29 00:59:03,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:03,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:59:03,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:03,574 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-29 00:59:03,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:59:03,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886447202] [2023-11-29 00:59:03,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886447202] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:59:03,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:59:03,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:59:03,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265948781] [2023-11-29 00:59:03,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:59:03,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:59:03,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:59:03,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:59:03,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:59:03,577 INFO L87 Difference]: Start difference. First operand 305 states and 446 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:59:03,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:59:03,708 INFO L93 Difference]: Finished difference Result 531 states and 771 transitions. [2023-11-29 00:59:03,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:59:03,709 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 122 [2023-11-29 00:59:03,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:59:03,714 INFO L225 Difference]: With dead ends: 531 [2023-11-29 00:59:03,714 INFO L226 Difference]: Without dead ends: 390 [2023-11-29 00:59:03,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 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 00:59:03,716 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 46 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 249 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.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:59:03,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 249 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:59:03,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2023-11-29 00:59:03,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 386. [2023-11-29 00:59:03,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 303 states have (on average 1.33003300330033) internal successors, (403), 307 states have internal predecessors, (403), 76 states have call successors, (76), 6 states have call predecessors, (76), 6 states have return successors, (76), 72 states have call predecessors, (76), 76 states have call successors, (76) [2023-11-29 00:59:03,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 555 transitions. [2023-11-29 00:59:03,766 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 555 transitions. Word has length 122 [2023-11-29 00:59:03,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:59:03,766 INFO L495 AbstractCegarLoop]: Abstraction has 386 states and 555 transitions. [2023-11-29 00:59:03,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:59:03,767 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 555 transitions. [2023-11-29 00:59:03,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-29 00:59:03,769 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:59:03,769 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:59:03,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 00:59:03,770 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:59:03,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:59:03,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1304891379, now seen corresponding path program 1 times [2023-11-29 00:59:03,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:59:03,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101126878] [2023-11-29 00:59:03,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:59:03,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:59:03,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:35,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:59:35,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:35,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:59:35,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:35,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:59:35,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:35,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 00:59:35,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:35,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 00:59:35,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:35,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:59:35,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:35,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:59:35,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:35,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 00:59:35,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:35,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 00:59:35,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:35,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 00:59:35,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:35,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:59:35,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:35,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:59:35,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:35,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:59:35,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:35,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 00:59:35,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:35,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 00:59:35,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:35,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 00:59:35,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:35,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 00:59:35,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:35,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-29 00:59:35,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:35,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:59:35,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:35,371 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-29 00:59:35,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:59:35,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101126878] [2023-11-29 00:59:35,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101126878] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:59:35,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:59:35,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 00:59:35,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686563970] [2023-11-29 00:59:35,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:59:35,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 00:59:35,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:59:35,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 00:59:35,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:59:35,373 INFO L87 Difference]: Start difference. First operand 386 states and 555 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:59:37,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:59:37,059 INFO L93 Difference]: Finished difference Result 710 states and 1000 transitions. [2023-11-29 00:59:37,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 00:59:37,060 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 122 [2023-11-29 00:59:37,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:59:37,064 INFO L225 Difference]: With dead ends: 710 [2023-11-29 00:59:37,064 INFO L226 Difference]: Without dead ends: 488 [2023-11-29 00:59:37,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2023-11-29 00:59:37,066 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 112 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 00:59:37,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 244 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 00:59:37,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2023-11-29 00:59:37,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 386. [2023-11-29 00:59:37,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 303 states have (on average 1.3102310231023102) internal successors, (397), 307 states have internal predecessors, (397), 76 states have call successors, (76), 6 states have call predecessors, (76), 6 states have return successors, (76), 72 states have call predecessors, (76), 76 states have call successors, (76) [2023-11-29 00:59:37,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 549 transitions. [2023-11-29 00:59:37,098 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 549 transitions. Word has length 122 [2023-11-29 00:59:37,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:59:37,098 INFO L495 AbstractCegarLoop]: Abstraction has 386 states and 549 transitions. [2023-11-29 00:59:37,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:59:37,099 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 549 transitions. [2023-11-29 00:59:37,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-29 00:59:37,100 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:59:37,101 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:59:37,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 00:59:37,101 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:59:37,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:59:37,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1527431991, now seen corresponding path program 1 times [2023-11-29 00:59:37,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:59:37,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99855746] [2023-11-29 00:59:37,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:59:37,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:59:37,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:37,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:59:37,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:37,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:59:37,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:37,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:59:37,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:37,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 00:59:37,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:37,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 00:59:37,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:37,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:59:37,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:37,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:59:37,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:37,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 00:59:37,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:37,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 00:59:37,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:37,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 00:59:37,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:37,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:59:37,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:37,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:59:37,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:37,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:59:37,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:37,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 00:59:37,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:37,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 00:59:37,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:37,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 00:59:37,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:37,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 00:59:37,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:37,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-29 00:59:37,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:37,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:59:37,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:37,250 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2023-11-29 00:59:37,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:59:37,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99855746] [2023-11-29 00:59:37,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99855746] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:59:37,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810914320] [2023-11-29 00:59:37,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:59:37,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:59:37,250 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e01ebb9b-a4a1-4483-a707-888a714bd9d3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:59:37,253 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e01ebb9b-a4a1-4483-a707-888a714bd9d3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:59:37,254 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e01ebb9b-a4a1-4483-a707-888a714bd9d3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 00:59:37,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:37,342 INFO L262 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 00:59:37,350 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:59:37,429 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 178 proven. 6 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2023-11-29 00:59:37,429 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:59:37,574 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2023-11-29 00:59:37,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810914320] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:59:37,575 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:59:37,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2023-11-29 00:59:37,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889994806] [2023-11-29 00:59:37,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:59:37,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 00:59:37,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:59:37,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 00:59:37,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-29 00:59:37,577 INFO L87 Difference]: Start difference. First operand 386 states and 549 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2023-11-29 00:59:37,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:59:37,988 INFO L93 Difference]: Finished difference Result 934 states and 1328 transitions. [2023-11-29 00:59:37,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 00:59:37,989 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 122 [2023-11-29 00:59:37,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:59:37,993 INFO L225 Difference]: With dead ends: 934 [2023-11-29 00:59:37,993 INFO L226 Difference]: Without dead ends: 549 [2023-11-29 00:59:37,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 277 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2023-11-29 00:59:37,995 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 238 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 00:59:37,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 201 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 00:59:37,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2023-11-29 00:59:38,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 366. [2023-11-29 00:59:38,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 281 states have (on average 1.2704626334519573) internal successors, (357), 285 states have internal predecessors, (357), 76 states have call successors, (76), 8 states have call predecessors, (76), 8 states have return successors, (76), 72 states have call predecessors, (76), 76 states have call successors, (76) [2023-11-29 00:59:38,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 509 transitions. [2023-11-29 00:59:38,054 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 509 transitions. Word has length 122 [2023-11-29 00:59:38,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:59:38,055 INFO L495 AbstractCegarLoop]: Abstraction has 366 states and 509 transitions. [2023-11-29 00:59:38,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2023-11-29 00:59:38,055 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 509 transitions. [2023-11-29 00:59:38,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-29 00:59:38,057 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:59:38,057 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:59:38,063 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e01ebb9b-a4a1-4483-a707-888a714bd9d3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-29 00:59:38,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e01ebb9b-a4a1-4483-a707-888a714bd9d3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-29 00:59:38,262 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:59:38,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:59:38,262 INFO L85 PathProgramCache]: Analyzing trace with hash 2120821086, now seen corresponding path program 1 times [2023-11-29 00:59:38,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:59:38,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881512411] [2023-11-29 00:59:38,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:59:38,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:59:38,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:38,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:59:38,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:38,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:59:38,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:38,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:59:38,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:38,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 00:59:38,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:38,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 00:59:38,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:38,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:59:38,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:38,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:59:38,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:38,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 00:59:38,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:38,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 00:59:38,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:38,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 00:59:38,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:38,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:59:38,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:38,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:59:38,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:38,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:59:38,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:38,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 00:59:38,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:38,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 00:59:38,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:38,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 00:59:38,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:38,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 00:59:38,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:38,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-29 00:59:38,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:38,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:59:38,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:38,359 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-29 00:59:38,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:59:38,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881512411] [2023-11-29 00:59:38,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881512411] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:59:38,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:59:38,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:59:38,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104176847] [2023-11-29 00:59:38,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:59:38,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:59:38,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:59:38,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:59:38,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:59:38,361 INFO L87 Difference]: Start difference. First operand 366 states and 509 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:59:38,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:59:38,457 INFO L93 Difference]: Finished difference Result 845 states and 1158 transitions. [2023-11-29 00:59:38,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:59:38,458 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 124 [2023-11-29 00:59:38,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:59:38,461 INFO L225 Difference]: With dead ends: 845 [2023-11-29 00:59:38,462 INFO L226 Difference]: Without dead ends: 480 [2023-11-29 00:59:38,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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 00:59:38,463 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 48 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:59:38,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 192 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:59:38,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2023-11-29 00:59:38,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 476. [2023-11-29 00:59:38,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 362 states have (on average 1.207182320441989) internal successors, (437), 369 states have internal predecessors, (437), 100 states have call successors, (100), 13 states have call predecessors, (100), 13 states have return successors, (100), 93 states have call predecessors, (100), 100 states have call successors, (100) [2023-11-29 00:59:38,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 637 transitions. [2023-11-29 00:59:38,551 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 637 transitions. Word has length 124 [2023-11-29 00:59:38,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:59:38,551 INFO L495 AbstractCegarLoop]: Abstraction has 476 states and 637 transitions. [2023-11-29 00:59:38,552 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:59:38,552 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 637 transitions. [2023-11-29 00:59:38,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-29 00:59:38,553 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:59:38,554 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:59:38,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 00:59:38,554 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:59:38,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:59:38,554 INFO L85 PathProgramCache]: Analyzing trace with hash 2142281939, now seen corresponding path program 1 times [2023-11-29 00:59:38,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:59:38,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895246619] [2023-11-29 00:59:38,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:59:38,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:59:38,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:38,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:59:38,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:38,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:59:38,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:38,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:59:38,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:38,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 00:59:38,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:38,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 00:59:38,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:38,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:59:38,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:38,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:59:38,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:38,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 00:59:38,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:38,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 00:59:38,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:38,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 00:59:38,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:38,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:59:38,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:38,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:59:38,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:38,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:59:38,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:38,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 00:59:38,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:38,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 00:59:38,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:38,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 00:59:38,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:38,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 00:59:38,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:38,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-29 00:59:38,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:38,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:59:38,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:38,648 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-29 00:59:38,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:59:38,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895246619] [2023-11-29 00:59:38,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895246619] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:59:38,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:59:38,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:59:38,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915615550] [2023-11-29 00:59:38,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:59:38,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:59:38,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:59:38,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:59:38,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:59:38,651 INFO L87 Difference]: Start difference. First operand 476 states and 637 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:59:38,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:59:38,744 INFO L93 Difference]: Finished difference Result 963 states and 1282 transitions. [2023-11-29 00:59:38,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:59:38,745 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 124 [2023-11-29 00:59:38,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:59:38,748 INFO L225 Difference]: With dead ends: 963 [2023-11-29 00:59:38,748 INFO L226 Difference]: Without dead ends: 488 [2023-11-29 00:59:38,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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 00:59:38,751 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 37 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:59:38,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 170 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:59:38,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2023-11-29 00:59:38,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 423. [2023-11-29 00:59:38,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 334 states have (on average 1.2035928143712575) internal successors, (402), 338 states have internal predecessors, (402), 76 states have call successors, (76), 12 states have call predecessors, (76), 12 states have return successors, (76), 72 states have call predecessors, (76), 76 states have call successors, (76) [2023-11-29 00:59:38,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 554 transitions. [2023-11-29 00:59:38,812 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 554 transitions. Word has length 124 [2023-11-29 00:59:38,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:59:38,812 INFO L495 AbstractCegarLoop]: Abstraction has 423 states and 554 transitions. [2023-11-29 00:59:38,812 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:59:38,813 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 554 transitions. [2023-11-29 00:59:38,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-29 00:59:38,814 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:59:38,814 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:59:38,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 00:59:38,815 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:59:38,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:59:38,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1994202915, now seen corresponding path program 1 times [2023-11-29 00:59:38,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:59:38,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436877398] [2023-11-29 00:59:38,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:59:38,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:59:38,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:59:38,853 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:59:38,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:59:38,928 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:59:38,928 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 00:59:38,930 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 00:59:38,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 00:59:38,935 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:59:38,938 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 00:59:38,993 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-29 00:59:38,995 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated [2023-11-29 00:59:38,996 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet16 could not be translated [2023-11-29 00:59:38,996 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short19 could not be translated [2023-11-29 00:59:38,996 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet16 could not be translated [2023-11-29 00:59:39,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 12:59:39 BoogieIcfgContainer [2023-11-29 00:59:39,014 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 00:59:39,014 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 00:59:39,014 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 00:59:39,015 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 00:59:39,015 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:57:33" (3/4) ... [2023-11-29 00:59:39,017 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 00:59:39,018 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 00:59:39,019 INFO L158 Benchmark]: Toolchain (without parser) took 126210.87ms. Allocated memory was 161.5MB in the beginning and 539.0MB in the end (delta: 377.5MB). Free memory was 114.7MB in the beginning and 351.9MB in the end (delta: -237.2MB). Peak memory consumption was 141.9MB. Max. memory is 16.1GB. [2023-11-29 00:59:39,019 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 161.5MB. Free memory is still 133.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 00:59:39,020 INFO L158 Benchmark]: CACSL2BoogieTranslator took 325.44ms. Allocated memory is still 161.5MB. Free memory was 114.4MB in the beginning and 101.5MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 00:59:39,020 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.84ms. Allocated memory is still 161.5MB. Free memory was 101.5MB in the beginning and 97.7MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 00:59:39,021 INFO L158 Benchmark]: Boogie Preprocessor took 63.62ms. Allocated memory is still 161.5MB. Free memory was 97.7MB in the beginning and 92.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 00:59:39,021 INFO L158 Benchmark]: RCFGBuilder took 529.82ms. Allocated memory is still 161.5MB. Free memory was 92.2MB in the beginning and 69.8MB in the end (delta: 22.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-29 00:59:39,021 INFO L158 Benchmark]: TraceAbstraction took 125204.95ms. Allocated memory was 161.5MB in the beginning and 539.0MB in the end (delta: 377.5MB). Free memory was 69.1MB in the beginning and 351.9MB in the end (delta: -282.8MB). Peak memory consumption was 97.8MB. Max. memory is 16.1GB. [2023-11-29 00:59:39,022 INFO L158 Benchmark]: Witness Printer took 4.34ms. Allocated memory is still 539.0MB. Free memory is still 351.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 00:59:39,023 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.21ms. Allocated memory is still 161.5MB. Free memory is still 133.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 325.44ms. Allocated memory is still 161.5MB. Free memory was 114.4MB in the beginning and 101.5MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.84ms. Allocated memory is still 161.5MB. Free memory was 101.5MB in the beginning and 97.7MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.62ms. Allocated memory is still 161.5MB. Free memory was 97.7MB in the beginning and 92.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 529.82ms. Allocated memory is still 161.5MB. Free memory was 92.2MB in the beginning and 69.8MB in the end (delta: 22.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 125204.95ms. Allocated memory was 161.5MB in the beginning and 539.0MB in the end (delta: 377.5MB). Free memory was 69.1MB in the beginning and 351.9MB in the end (delta: -282.8MB). Peak memory consumption was 97.8MB. Max. memory is 16.1GB. * Witness Printer took 4.34ms. Allocated memory is still 539.0MB. Free memory is still 351.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short19 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet16 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 someBinaryDOUBLEComparisonOperation at line 106. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] signed char var_1_3 = 0; [L24] unsigned char var_1_5 = 128; [L25] unsigned char var_1_6 = 16; [L26] unsigned char var_1_7 = 2; [L27] unsigned char var_1_8 = 8; [L28] double var_1_9 = 10.5; [L29] unsigned char var_1_10 = 0; [L30] unsigned char var_1_12 = 0; [L31] double var_1_13 = 99.25; [L32] unsigned char var_1_14 = 64; [L33] unsigned char var_1_16 = 0; [L34] unsigned char var_1_17 = 0; [L35] unsigned char var_1_18 = 1; [L36] unsigned char last_1_var_1_14 = 64; [L110] isInitial = 1 [L111] FCALL initially() [L112] COND TRUE 1 [L113] CALL updateLastVariables() [L103] last_1_var_1_14 = var_1_14 [L113] RET updateLastVariables() [L114] CALL updateVariables() [L72] var_1_3 = __VERIFIER_nondet_char() [L73] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=128, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=128, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=21/2] [L73] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=128, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=21/2] [L74] CALL assume_abort_if_not(var_1_3 <= 16) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=128, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=128, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=21/2] [L74] RET assume_abort_if_not(var_1_3 <= 16) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=128, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=21/2] [L75] var_1_5 = __VERIFIER_nondet_uchar() [L76] CALL assume_abort_if_not(var_1_5 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=21/2] [L76] RET assume_abort_if_not(var_1_5 >= 127) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=21/2] [L77] CALL assume_abort_if_not(var_1_5 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=21/2] [L77] RET assume_abort_if_not(var_1_5 <= 254) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=21/2] [L78] var_1_6 = __VERIFIER_nondet_uchar() [L79] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_7=2, var_1_8=8, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_7=2, var_1_8=8, var_1_9=21/2] [L79] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_7=2, var_1_8=8, var_1_9=21/2] [L80] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=2, var_1_8=8, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=2, var_1_8=8, var_1_9=21/2] [L80] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=2, var_1_8=8, var_1_9=21/2] [L81] var_1_7 = __VERIFIER_nondet_uchar() [L82] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_8=8, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_8=8, var_1_9=21/2] [L82] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_8=8, var_1_9=21/2] [L83] CALL assume_abort_if_not(var_1_7 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=8, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=8, var_1_9=21/2] [L83] RET assume_abort_if_not(var_1_7 <= 127) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=8, var_1_9=21/2] [L84] var_1_8 = __VERIFIER_nondet_uchar() [L85] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_9=21/2] [L85] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_9=21/2] [L86] CALL assume_abort_if_not(var_1_8 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L86] RET assume_abort_if_not(var_1_8 <= 64) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L87] var_1_10 = __VERIFIER_nondet_uchar() [L88] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=64, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L88] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L89] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L89] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=0, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L90] var_1_12 = __VERIFIER_nondet_uchar() [L91] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L91] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L92] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L92] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=397/4, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L93] var_1_13 = __VERIFIER_nondet_double() [L94] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L94] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L95] var_1_17 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L96] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L97] CALL assume_abort_if_not(var_1_17 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L97] RET assume_abort_if_not(var_1_17 <= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L98] var_1_18 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_18 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L99] RET assume_abort_if_not(var_1_18 >= 1) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L100] CALL assume_abort_if_not(var_1_18 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L100] RET assume_abort_if_not(var_1_18 <= 1) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L114] RET updateVariables() [L115] CALL step() [L40] EXPR last_1_var_1_14 >> var_1_3 VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L40] COND TRUE (last_1_var_1_14 >> var_1_3) >= last_1_var_1_14 [L41] var_1_1 = ((((var_1_3) < ((var_1_5 - ((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7)))))) ? (var_1_3) : ((var_1_5 - ((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7))))))) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=0, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L45] COND FALSE !((var_1_8 + var_1_1) >= var_1_7) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=0, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L48] COND TRUE var_1_12 || var_1_10 VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=0, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L49] EXPR var_1_8 << var_1_3 VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=0, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L49] COND FALSE !(var_1_1 >= (var_1_8 << var_1_3)) [L56] var_1_16 = var_1_18 VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=1, var_1_17=0, var_1_18=1, var_1_1=0, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L61] unsigned char stepLocal_1 = var_1_14; [L62] unsigned char stepLocal_0 = var_1_16; VAL [isInitial=1, last_1_var_1_14=64, stepLocal_0=1, stepLocal_1=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=1, var_1_17=0, var_1_18=1, var_1_1=0, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L63] COND TRUE \read(var_1_16) VAL [isInitial=1, last_1_var_1_14=64, stepLocal_0=1, stepLocal_1=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=1, var_1_17=0, var_1_18=1, var_1_1=0, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L64] COND TRUE stepLocal_0 || var_1_16 VAL [isInitial=1, last_1_var_1_14=64, stepLocal_0=1, stepLocal_1=64, var_1_10=1, var_1_12=1, var_1_14=64, var_1_16=1, var_1_17=0, var_1_18=1, var_1_1=0, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=21/2] [L65] COND TRUE stepLocal_1 > var_1_6 [L66] var_1_9 = var_1_13 VAL [isInitial=1, last_1_var_1_14=64, stepLocal_0=1, stepLocal_1=64, var_1_10=1, var_1_12=1, var_1_13=133, var_1_14=64, var_1_16=1, var_1_17=0, var_1_18=1, var_1_1=0, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=133] [L115] RET step() [L116] CALL, EXPR property() [L106] EXPR last_1_var_1_14 >> var_1_3 VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=133, var_1_14=64, var_1_16=1, var_1_17=0, var_1_18=1, var_1_1=0, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=133] [L106] EXPR (((((last_1_var_1_14 >> var_1_3) >= last_1_var_1_14) ? (var_1_1 == ((unsigned char) ((((var_1_3) < ((var_1_5 - ((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7)))))) ? (var_1_3) : ((var_1_5 - ((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7))))))))) : (var_1_1 == ((unsigned char) (((((var_1_6) < (var_1_3)) ? (var_1_6) : (var_1_3))) + (((((var_1_8 + 1)) < (var_1_7)) ? ((var_1_8 + 1)) : (var_1_7))))))) && (var_1_16 ? ((var_1_16 || var_1_16) ? ((var_1_14 > var_1_6) ? (var_1_9 == ((double) var_1_13)) : 1) : 1) : 1)) && (((var_1_8 + var_1_1) >= var_1_7) ? (var_1_14 == ((unsigned char) var_1_6)) : 1)) && ((var_1_12 || var_1_10) ? ((var_1_1 >= (var_1_8 << var_1_3)) ? ((var_1_6 > var_1_7) ? (var_1_16 == ((unsigned char) var_1_17)) : (var_1_16 == ((unsigned char) 1))) : (var_1_16 == ((unsigned char) var_1_18))) : (var_1_16 == ((unsigned char) var_1_17))) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=133, var_1_14=64, var_1_16=1, var_1_17=0, var_1_18=1, var_1_1=0, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=133] [L106-L107] return (((((last_1_var_1_14 >> var_1_3) >= last_1_var_1_14) ? (var_1_1 == ((unsigned char) ((((var_1_3) < ((var_1_5 - ((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7)))))) ? (var_1_3) : ((var_1_5 - ((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7))))))))) : (var_1_1 == ((unsigned char) (((((var_1_6) < (var_1_3)) ? (var_1_6) : (var_1_3))) + (((((var_1_8 + 1)) < (var_1_7)) ? ((var_1_8 + 1)) : (var_1_7))))))) && (var_1_16 ? ((var_1_16 || var_1_16) ? ((var_1_14 > var_1_6) ? (var_1_9 == ((double) var_1_13)) : 1) : 1) : 1)) && (((var_1_8 + var_1_1) >= var_1_7) ? (var_1_14 == ((unsigned char) var_1_6)) : 1)) && ((var_1_12 || var_1_10) ? ((var_1_1 >= (var_1_8 << var_1_3)) ? ((var_1_6 > var_1_7) ? (var_1_16 == ((unsigned char) var_1_17)) : (var_1_16 == ((unsigned char) 1))) : (var_1_16 == ((unsigned char) var_1_18))) : (var_1_16 == ((unsigned char) var_1_17))) ; [L116] RET, EXPR property() [L116] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=133, var_1_14=64, var_1_16=1, var_1_17=0, var_1_18=1, var_1_1=0, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=133] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=133, var_1_14=64, var_1_16=1, var_1_17=0, var_1_18=1, var_1_1=0, var_1_3=0, var_1_5=127, var_1_6=0, var_1_7=65, var_1_8=64, var_1_9=133] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 125.1s, OverallIterations: 14, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1227 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1210 mSDsluCounter, 3322 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2143 mSDsCounter, 224 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1153 IncrementalHoareTripleChecker+Invalid, 1377 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 224 mSolverCounterUnsat, 1179 mSDtfsCounter, 1153 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 853 GetRequests, 764 SyntacticMatches, 4 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 9.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=476occurred in iteration=12, InterpolantAutomatonStates: 99, 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, 13 MinimizatonAttempts, 593 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 115.2s InterpolantComputationTime, 1822 NumberOfCodeBlocks, 1822 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1805 ConstructedInterpolants, 0 QuantifiedInterpolants, 12618 SizeOfPredicates, 4 NumberOfNonLiveVariables, 279 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 15 InterpolantComputations, 12 PerfectInterpolantSequences, 10242/10260 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 00:59:39,093 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e01ebb9b-a4a1-4483-a707-888a714bd9d3/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e01ebb9b-a4a1-4483-a707-888a714bd9d3/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e01ebb9b-a4a1-4483-a707-888a714bd9d3/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_e01ebb9b-a4a1-4483-a707-888a714bd9d3/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e01ebb9b-a4a1-4483-a707-888a714bd9d3/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-56.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e01ebb9b-a4a1-4483-a707-888a714bd9d3/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_e01ebb9b-a4a1-4483-a707-888a714bd9d3/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 ced5a78035a498fa1c6524a1d2fe5cd1966b3a3c455f8342c0f34dca1990502c --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:59:40,989 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:59:41,065 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e01ebb9b-a4a1-4483-a707-888a714bd9d3/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-29 00:59:41,071 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:59:41,072 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:59:41,101 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:59:41,102 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:59:41,102 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:59:41,103 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 00:59:41,104 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 00:59:41,104 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:59:41,105 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:59:41,106 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:59:41,107 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:59:41,107 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:59:41,108 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:59:41,109 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 00:59:41,109 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 00:59:41,110 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 00:59:41,110 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:59:41,111 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 00:59:41,111 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:59:41,112 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 00:59:41,112 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 00:59:41,113 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 00:59:41,113 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 00:59:41,114 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 00:59:41,114 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 00:59:41,115 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:59:41,115 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:59:41,116 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:59:41,116 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 00:59:41,116 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:59:41,117 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:59:41,117 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:59:41,117 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:59:41,118 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 00:59:41,118 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 00:59:41,118 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 00:59:41,119 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:59:41,119 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:59:41,119 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 00:59:41,120 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:59:41,120 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:59:41,120 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 00:59:41,120 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_e01ebb9b-a4a1-4483-a707-888a714bd9d3/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_e01ebb9b-a4a1-4483-a707-888a714bd9d3/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 -> ced5a78035a498fa1c6524a1d2fe5cd1966b3a3c455f8342c0f34dca1990502c [2023-11-29 00:59:41,418 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:59:41,439 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:59:41,442 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:59:41,443 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:59:41,443 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:59:41,445 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e01ebb9b-a4a1-4483-a707-888a714bd9d3/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-56.i [2023-11-29 00:59:44,235 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:59:44,448 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:59:44,448 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e01ebb9b-a4a1-4483-a707-888a714bd9d3/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-56.i [2023-11-29 00:59:44,457 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e01ebb9b-a4a1-4483-a707-888a714bd9d3/bin/uautomizer-verify-BQ2R08f2Ya/data/7855c9c93/152e5a5495994117abda910d11175b82/FLAG25792319d [2023-11-29 00:59:44,471 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e01ebb9b-a4a1-4483-a707-888a714bd9d3/bin/uautomizer-verify-BQ2R08f2Ya/data/7855c9c93/152e5a5495994117abda910d11175b82 [2023-11-29 00:59:44,474 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:59:44,476 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:59:44,478 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:59:44,478 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:59:44,483 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:59:44,483 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:59:44" (1/1) ... [2023-11-29 00:59:44,485 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13d8c77c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:59:44, skipping insertion in model container [2023-11-29 00:59:44,485 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:59:44" (1/1) ... [2023-11-29 00:59:44,511 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:59:44,647 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_e01ebb9b-a4a1-4483-a707-888a714bd9d3/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-56.i[917,930] [2023-11-29 00:59:44,694 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:59:44,712 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 00:59:44,723 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_e01ebb9b-a4a1-4483-a707-888a714bd9d3/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-56.i[917,930] [2023-11-29 00:59:44,748 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:59:44,765 INFO L206 MainTranslator]: Completed translation [2023-11-29 00:59:44,766 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:59:44 WrapperNode [2023-11-29 00:59:44,766 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:59:44,767 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 00:59:44,767 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 00:59:44,767 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 00:59:44,774 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:59:44" (1/1) ... [2023-11-29 00:59:44,786 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:59:44" (1/1) ... [2023-11-29 00:59:44,817 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 117 [2023-11-29 00:59:44,818 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 00:59:44,819 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 00:59:44,819 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 00:59:44,819 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 00:59:44,840 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:59:44" (1/1) ... [2023-11-29 00:59:44,841 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:59:44" (1/1) ... [2023-11-29 00:59:44,849 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:59:44" (1/1) ... [2023-11-29 00:59:44,890 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-29 00:59:44,890 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:59:44" (1/1) ... [2023-11-29 00:59:44,891 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:59:44" (1/1) ... [2023-11-29 00:59:44,901 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:59:44" (1/1) ... [2023-11-29 00:59:44,905 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:59:44" (1/1) ... [2023-11-29 00:59:44,908 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:59:44" (1/1) ... [2023-11-29 00:59:44,910 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:59:44" (1/1) ... [2023-11-29 00:59:44,914 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 00:59:44,915 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 00:59:44,915 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 00:59:44,916 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 00:59:44,916 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:59:44" (1/1) ... [2023-11-29 00:59:44,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:59:44,932 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e01ebb9b-a4a1-4483-a707-888a714bd9d3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:59:44,942 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e01ebb9b-a4a1-4483-a707-888a714bd9d3/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 00:59:44,949 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e01ebb9b-a4a1-4483-a707-888a714bd9d3/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 00:59:44,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 00:59:44,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 00:59:44,979 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 00:59:44,979 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 00:59:44,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 00:59:44,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 00:59:45,059 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 00:59:45,062 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 00:59:45,323 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 00:59:45,366 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 00:59:45,367 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 00:59:45,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:59:45 BoogieIcfgContainer [2023-11-29 00:59:45,368 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 00:59:45,371 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 00:59:45,371 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 00:59:45,375 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 00:59:45,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:59:44" (1/3) ... [2023-11-29 00:59:45,376 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49534653 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:59:45, skipping insertion in model container [2023-11-29 00:59:45,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:59:44" (2/3) ... [2023-11-29 00:59:45,377 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49534653 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:59:45, skipping insertion in model container [2023-11-29 00:59:45,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:59:45" (3/3) ... [2023-11-29 00:59:45,378 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-56.i [2023-11-29 00:59:45,401 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 00:59:45,401 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 00:59:45,455 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:59:45,463 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;@523c2999, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:59:45,464 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 00:59:45,469 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 30 states have internal predecessors, (42), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-29 00:59:45,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-11-29 00:59:45,484 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:59:45,485 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:59:45,485 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:59:45,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:59:45,491 INFO L85 PathProgramCache]: Analyzing trace with hash -489355618, now seen corresponding path program 1 times [2023-11-29 00:59:45,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:59:45,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2051732951] [2023-11-29 00:59:45,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:59:45,506 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 00:59:45,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e01ebb9b-a4a1-4483-a707-888a714bd9d3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:59:45,546 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e01ebb9b-a4a1-4483-a707-888a714bd9d3/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 00:59:45,547 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e01ebb9b-a4a1-4483-a707-888a714bd9d3/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 00:59:45,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:45,700 INFO L262 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 00:59:45,710 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:59:45,751 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 344 proven. 0 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2023-11-29 00:59:45,751 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:59:45,752 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:59:45,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2051732951] [2023-11-29 00:59:45,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2051732951] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:59:45,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:59:45,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:59:45,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031114660] [2023-11-29 00:59:45,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:59:45,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 00:59:45,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:59:45,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 00:59:45,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 00:59:45,789 INFO L87 Difference]: Start difference. First operand has 51 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 30 states have internal predecessors, (42), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-29 00:59:45,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:59:45,829 INFO L93 Difference]: Finished difference Result 99 states and 177 transitions. [2023-11-29 00:59:45,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 00:59:45,832 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 115 [2023-11-29 00:59:45,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:59:45,839 INFO L225 Difference]: With dead ends: 99 [2023-11-29 00:59:45,840 INFO L226 Difference]: Without dead ends: 49 [2023-11-29 00:59:45,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 00:59:45,846 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 00:59:45,847 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 00:59:45,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-11-29 00:59:45,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2023-11-29 00:59:45,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 28 states have internal predecessors, (37), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-29 00:59:45,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 75 transitions. [2023-11-29 00:59:45,887 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 75 transitions. Word has length 115 [2023-11-29 00:59:45,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:59:45,888 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 75 transitions. [2023-11-29 00:59:45,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-29 00:59:45,888 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 75 transitions. [2023-11-29 00:59:45,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-11-29 00:59:45,892 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:59:45,892 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:59:45,897 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e01ebb9b-a4a1-4483-a707-888a714bd9d3/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 00:59:46,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e01ebb9b-a4a1-4483-a707-888a714bd9d3/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 00:59:46,093 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:59:46,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:59:46,094 INFO L85 PathProgramCache]: Analyzing trace with hash 759719324, now seen corresponding path program 1 times [2023-11-29 00:59:46,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:59:46,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [200553248] [2023-11-29 00:59:46,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:59:46,096 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 00:59:46,096 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e01ebb9b-a4a1-4483-a707-888a714bd9d3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:59:46,097 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e01ebb9b-a4a1-4483-a707-888a714bd9d3/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 00:59:46,099 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e01ebb9b-a4a1-4483-a707-888a714bd9d3/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 00:59:46,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:46,250 INFO L262 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-29 00:59:46,259 INFO L285 TraceCheckSpWp]: Computing forward predicates...