./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-8.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_39465174-40ce-406b-9111-a5effa2190d3/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39465174-40ce-406b-9111-a5effa2190d3/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_39465174-40ce-406b-9111-a5effa2190d3/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39465174-40ce-406b-9111-a5effa2190d3/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-8.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39465174-40ce-406b-9111-a5effa2190d3/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_39465174-40ce-406b-9111-a5effa2190d3/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 6a79e771adfc453987e5cf461fecaf2182a327bb6bb8a3a5a2cd49df99352d71 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:46:07,905 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:46:07,986 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39465174-40ce-406b-9111-a5effa2190d3/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 00:46:07,990 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:46:07,990 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:46:08,012 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:46:08,012 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:46:08,013 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:46:08,013 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 00:46:08,014 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 00:46:08,015 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:46:08,015 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:46:08,016 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:46:08,016 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:46:08,017 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:46:08,018 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:46:08,018 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 00:46:08,019 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 00:46:08,019 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 00:46:08,019 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 00:46:08,020 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:46:08,020 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 00:46:08,021 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:46:08,021 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 00:46:08,022 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 00:46:08,022 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 00:46:08,022 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:46:08,023 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:46:08,023 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:46:08,023 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 00:46:08,024 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:46:08,024 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:46:08,024 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:46:08,025 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:46:08,025 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 00:46:08,025 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 00:46:08,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 00:46:08,025 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:46:08,025 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:46:08,026 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 00:46:08,026 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:46:08,026 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:46:08,026 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_39465174-40ce-406b-9111-a5effa2190d3/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_39465174-40ce-406b-9111-a5effa2190d3/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 -> 6a79e771adfc453987e5cf461fecaf2182a327bb6bb8a3a5a2cd49df99352d71 [2023-11-29 00:46:08,237 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:46:08,257 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:46:08,259 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:46:08,261 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:46:08,261 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:46:08,262 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39465174-40ce-406b-9111-a5effa2190d3/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-8.i [2023-11-29 00:46:11,005 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:46:11,203 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:46:11,204 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39465174-40ce-406b-9111-a5effa2190d3/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-8.i [2023-11-29 00:46:11,213 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39465174-40ce-406b-9111-a5effa2190d3/bin/uautomizer-verify-BQ2R08f2Ya/data/c8f178612/c44165a41d0444efbb64dd49e8932cc5/FLAG820eef329 [2023-11-29 00:46:11,228 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39465174-40ce-406b-9111-a5effa2190d3/bin/uautomizer-verify-BQ2R08f2Ya/data/c8f178612/c44165a41d0444efbb64dd49e8932cc5 [2023-11-29 00:46:11,230 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:46:11,232 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:46:11,233 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:46:11,233 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:46:11,239 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:46:11,240 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:46:11" (1/1) ... [2023-11-29 00:46:11,241 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5741a8a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:46:11, skipping insertion in model container [2023-11-29 00:46:11,241 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:46:11" (1/1) ... [2023-11-29 00:46:11,269 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:46:11,417 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_39465174-40ce-406b-9111-a5effa2190d3/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-8.i[915,928] [2023-11-29 00:46:11,455 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:46:11,465 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 00:46:11,478 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_39465174-40ce-406b-9111-a5effa2190d3/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-8.i[915,928] [2023-11-29 00:46:11,499 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:46:11,516 INFO L206 MainTranslator]: Completed translation [2023-11-29 00:46:11,517 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:46:11 WrapperNode [2023-11-29 00:46:11,517 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:46:11,518 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 00:46:11,518 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 00:46:11,518 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 00:46:11,526 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:46:11" (1/1) ... [2023-11-29 00:46:11,536 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:46:11" (1/1) ... [2023-11-29 00:46:11,564 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 115 [2023-11-29 00:46:11,564 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 00:46:11,565 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 00:46:11,565 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 00:46:11,565 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 00:46:11,574 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:46:11" (1/1) ... [2023-11-29 00:46:11,574 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:46:11" (1/1) ... [2023-11-29 00:46:11,576 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:46:11" (1/1) ... [2023-11-29 00:46:11,590 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:46:11,591 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:46:11" (1/1) ... [2023-11-29 00:46:11,591 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:46:11" (1/1) ... [2023-11-29 00:46:11,597 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:46:11" (1/1) ... [2023-11-29 00:46:11,600 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:46:11" (1/1) ... [2023-11-29 00:46:11,602 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:46:11" (1/1) ... [2023-11-29 00:46:11,604 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:46:11" (1/1) ... [2023-11-29 00:46:11,607 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 00:46:11,608 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 00:46:11,608 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 00:46:11,608 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 00:46:11,609 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:46:11" (1/1) ... [2023-11-29 00:46:11,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:46:11,643 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39465174-40ce-406b-9111-a5effa2190d3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:46:11,666 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39465174-40ce-406b-9111-a5effa2190d3/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:46:11,709 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39465174-40ce-406b-9111-a5effa2190d3/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:46:11,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 00:46:11,727 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 00:46:11,727 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 00:46:11,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 00:46:11,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 00:46:11,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 00:46:11,799 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 00:46:11,801 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 00:46:12,002 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 00:46:12,038 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 00:46:12,038 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 00:46:12,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:46:12 BoogieIcfgContainer [2023-11-29 00:46:12,039 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 00:46:12,041 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 00:46:12,042 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 00:46:12,045 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 00:46:12,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:46:11" (1/3) ... [2023-11-29 00:46:12,046 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48f0b13c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:46:12, skipping insertion in model container [2023-11-29 00:46:12,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:46:11" (2/3) ... [2023-11-29 00:46:12,046 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48f0b13c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:46:12, skipping insertion in model container [2023-11-29 00:46:12,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:46:12" (3/3) ... [2023-11-29 00:46:12,048 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-8.i [2023-11-29 00:46:12,064 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 00:46:12,064 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 00:46:12,110 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:46:12,116 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;@c7202c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:46:12,117 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 00:46:12,121 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-29 00:46:12,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-29 00:46:12,134 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:46:12,135 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:46:12,136 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:46:12,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:46:12,141 INFO L85 PathProgramCache]: Analyzing trace with hash -952863158, now seen corresponding path program 1 times [2023-11-29 00:46:12,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:46:12,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836701209] [2023-11-29 00:46:12,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:46:12,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:46:12,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:12,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:46:12,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:12,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:46:12,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:12,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:46:12,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:12,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 00:46:12,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:12,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 00:46:12,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:12,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:46:12,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:12,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:46:12,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:12,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 00:46:12,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:12,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 00:46:12,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:12,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 00:46:12,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:12,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:46:12,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:12,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:46:12,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:12,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:46:12,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:12,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 00:46:12,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:12,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 00:46:12,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:12,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 00:46:12,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:12,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 00:46:12,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:12,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 00:46:12,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:12,482 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 00:46:12,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:46:12,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836701209] [2023-11-29 00:46:12,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836701209] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:46:12,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:46:12,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:46:12,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900332638] [2023-11-29 00:46:12,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:46:12,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 00:46:12,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:46:12,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 00:46:12,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 00:46:12,524 INFO L87 Difference]: Start difference. First operand has 45 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-29 00:46:12,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:46:12,564 INFO L93 Difference]: Finished difference Result 87 states and 154 transitions. [2023-11-29 00:46:12,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 00:46:12,567 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 108 [2023-11-29 00:46:12,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:46:12,575 INFO L225 Difference]: With dead ends: 87 [2023-11-29 00:46:12,575 INFO L226 Difference]: Without dead ends: 43 [2023-11-29 00:46:12,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 00:46:12,583 INFO L413 NwaCegarLoop]: 61 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, 61 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:46:12,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:46:12,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-11-29 00:46:12,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2023-11-29 00:46:12,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-29 00:46:12,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 64 transitions. [2023-11-29 00:46:12,631 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 64 transitions. Word has length 108 [2023-11-29 00:46:12,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:46:12,631 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 64 transitions. [2023-11-29 00:46:12,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-29 00:46:12,632 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 64 transitions. [2023-11-29 00:46:12,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-29 00:46:12,636 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:46:12,636 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:46:12,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 00:46:12,637 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:46:12,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:46:12,638 INFO L85 PathProgramCache]: Analyzing trace with hash -272189558, now seen corresponding path program 1 times [2023-11-29 00:46:12,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:46:12,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768328375] [2023-11-29 00:46:12,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:46:12,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:46:12,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:12,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:46:12,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:12,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:46:12,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:12,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:46:12,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:12,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 00:46:12,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:12,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 00:46:12,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:12,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:46:12,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:12,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:46:12,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:12,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 00:46:12,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:12,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 00:46:12,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:12,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 00:46:12,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:12,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:46:12,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:12,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:46:12,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:12,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:46:12,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:12,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 00:46:12,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:12,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 00:46:12,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:12,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 00:46:12,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:12,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 00:46:12,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:12,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 00:46:12,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:12,952 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 00:46:12,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:46:12,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768328375] [2023-11-29 00:46:12,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768328375] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:46:12,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:46:12,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:46:12,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514887355] [2023-11-29 00:46:12,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:46:12,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:46:12,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:46:12,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:46:12,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:46:12,957 INFO L87 Difference]: Start difference. First operand 43 states and 64 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 00:46:13,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:46:13,107 INFO L93 Difference]: Finished difference Result 85 states and 127 transitions. [2023-11-29 00:46:13,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:46:13,108 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 108 [2023-11-29 00:46:13,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:46:13,110 INFO L225 Difference]: With dead ends: 85 [2023-11-29 00:46:13,110 INFO L226 Difference]: Without dead ends: 43 [2023-11-29 00:46:13,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 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:46:13,113 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 60 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:46:13,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 73 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:46:13,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-11-29 00:46:13,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2023-11-29 00:46:13,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-29 00:46:13,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 63 transitions. [2023-11-29 00:46:13,132 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 63 transitions. Word has length 108 [2023-11-29 00:46:13,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:46:13,134 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 63 transitions. [2023-11-29 00:46:13,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 00:46:13,135 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 63 transitions. [2023-11-29 00:46:13,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-29 00:46:13,137 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:46:13,137 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:46:13,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 00:46:13,138 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:46:13,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:46:13,139 INFO L85 PathProgramCache]: Analyzing trace with hash -270342516, now seen corresponding path program 1 times [2023-11-29 00:46:13,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:46:13,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096184069] [2023-11-29 00:46:13,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:46:13,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:46:13,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:14,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:46:14,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:14,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:46:14,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:14,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:46:14,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:14,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 00:46:14,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:14,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 00:46:14,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:14,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:46:14,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:14,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:46:14,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:14,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 00:46:14,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:14,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 00:46:14,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:14,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 00:46:14,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:14,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:46:14,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:14,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:46:14,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:14,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:46:14,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:14,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 00:46:14,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:14,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 00:46:14,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:14,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 00:46:14,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:14,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 00:46:14,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:14,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 00:46:14,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:14,929 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 00:46:14,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:46:14,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096184069] [2023-11-29 00:46:14,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096184069] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:46:14,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:46:14,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 00:46:14,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780409939] [2023-11-29 00:46:14,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:46:14,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 00:46:14,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:46:14,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 00:46:14,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:46:14,933 INFO L87 Difference]: Start difference. First operand 43 states and 63 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 00:46:15,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:46:15,301 INFO L93 Difference]: Finished difference Result 69 states and 98 transitions. [2023-11-29 00:46:15,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 00:46:15,302 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 108 [2023-11-29 00:46:15,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:46:15,304 INFO L225 Difference]: With dead ends: 69 [2023-11-29 00:46:15,304 INFO L226 Difference]: Without dead ends: 67 [2023-11-29 00:46:15,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:46:15,306 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 45 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:46:15,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 247 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 00:46:15,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-11-29 00:46:15,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2023-11-29 00:46:15,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-29 00:46:15,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 93 transitions. [2023-11-29 00:46:15,335 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 93 transitions. Word has length 108 [2023-11-29 00:46:15,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:46:15,336 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 93 transitions. [2023-11-29 00:46:15,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 00:46:15,336 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 93 transitions. [2023-11-29 00:46:15,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-29 00:46:15,338 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:46:15,339 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:46:15,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 00:46:15,339 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:46:15,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:46:15,340 INFO L85 PathProgramCache]: Analyzing trace with hash -270282934, now seen corresponding path program 1 times [2023-11-29 00:46:15,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:46:15,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914842404] [2023-11-29 00:46:15,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:46:15,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:46:15,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:17,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:46:17,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:17,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:46:17,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:17,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:46:17,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:17,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 00:46:17,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:17,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 00:46:17,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:17,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:46:17,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:17,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:46:17,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:17,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 00:46:17,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:17,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 00:46:17,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:17,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 00:46:17,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:17,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:46:17,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:17,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:46:17,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:17,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:46:17,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:17,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 00:46:17,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:17,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 00:46:17,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:17,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 00:46:17,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:17,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 00:46:17,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:17,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 00:46:17,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:46:17,436 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 00:46:17,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:46:17,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914842404] [2023-11-29 00:46:17,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914842404] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:46:17,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:46:17,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 00:46:17,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333010964] [2023-11-29 00:46:17,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:46:17,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 00:46:17,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:46:17,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 00:46:17,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:46:17,439 INFO L87 Difference]: Start difference. First operand 64 states and 93 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 00:46:17,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:46:17,795 INFO L93 Difference]: Finished difference Result 80 states and 114 transitions. [2023-11-29 00:46:17,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 00:46:17,796 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 108 [2023-11-29 00:46:17,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:46:17,797 INFO L225 Difference]: With dead ends: 80 [2023-11-29 00:46:17,797 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 00:46:17,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:46:17,800 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 66 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:46:17,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 286 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 00:46:17,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 00:46:17,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 00:46:17,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:46:17,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 00:46:17,802 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 108 [2023-11-29 00:46:17,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:46:17,802 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 00:46:17,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 00:46:17,803 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 00:46:17,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 00:46:17,805 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 00:46:17,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 00:46:17,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-29 00:46:17,962 INFO L899 garLoopResultBuilder]: For program point L93(lines 66 94) no Hoare annotation was computed. [2023-11-29 00:46:17,962 INFO L895 garLoopResultBuilder]: At program point L89(line 89) the Hoare annotation is: (<= ~var_1_19~0 (+ ~var_1_8~0 (* 256 (div ~var_1_19~0 256)))) [2023-11-29 00:46:17,962 INFO L895 garLoopResultBuilder]: At program point L89-1(line 89) the Hoare annotation is: (<= ~var_1_19~0 (+ ~var_1_8~0 (* 256 (div ~var_1_19~0 256)))) [2023-11-29 00:46:17,963 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-29 00:46:17,963 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-29 00:46:17,963 INFO L899 garLoopResultBuilder]: For program point L81(line 81) no Hoare annotation was computed. [2023-11-29 00:46:17,963 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-11-29 00:46:17,963 INFO L895 garLoopResultBuilder]: At program point L77(line 77) the Hoare annotation is: (< ~var_1_19~0 (+ ~var_1_8~0 (* 256 (div ~var_1_19~0 256)) 1)) [2023-11-29 00:46:17,963 INFO L895 garLoopResultBuilder]: At program point L77-1(line 77) the Hoare annotation is: (< ~var_1_19~0 (+ ~var_1_8~0 (* 256 (div ~var_1_19~0 256)) 1)) [2023-11-29 00:46:17,964 INFO L899 garLoopResultBuilder]: For program point L69(line 69) no Hoare annotation was computed. [2023-11-29 00:46:17,964 INFO L899 garLoopResultBuilder]: For program point L90(line 90) no Hoare annotation was computed. [2023-11-29 00:46:17,964 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-29 00:46:17,964 INFO L895 garLoopResultBuilder]: At program point L86(line 86) the Hoare annotation is: (<= ~var_1_19~0 (+ ~var_1_8~0 (* 256 (div ~var_1_19~0 256)))) [2023-11-29 00:46:17,964 INFO L895 garLoopResultBuilder]: At program point L86-1(line 86) the Hoare annotation is: (<= ~var_1_19~0 (+ ~var_1_8~0 (* 256 (div ~var_1_19~0 256)))) [2023-11-29 00:46:17,964 INFO L899 garLoopResultBuilder]: For program point L78(line 78) no Hoare annotation was computed. [2023-11-29 00:46:17,964 INFO L899 garLoopResultBuilder]: For program point L45(lines 45 53) no Hoare annotation was computed. [2023-11-29 00:46:17,965 INFO L899 garLoopResultBuilder]: For program point L45-1(lines 45 53) no Hoare annotation was computed. [2023-11-29 00:46:17,965 INFO L895 garLoopResultBuilder]: At program point L74(line 74) the Hoare annotation is: (< ~var_1_19~0 (+ ~var_1_8~0 (* 256 (div ~var_1_19~0 256)) 1)) [2023-11-29 00:46:17,965 INFO L895 garLoopResultBuilder]: At program point L74-1(line 74) the Hoare annotation is: (< ~var_1_19~0 (+ ~var_1_8~0 (* 256 (div ~var_1_19~0 256)) 1)) [2023-11-29 00:46:17,965 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-29 00:46:17,965 INFO L899 garLoopResultBuilder]: For program point L87(line 87) no Hoare annotation was computed. [2023-11-29 00:46:17,965 INFO L895 garLoopResultBuilder]: At program point L83(line 83) the Hoare annotation is: (<= ~var_1_19~0 (+ ~var_1_8~0 (* 256 (div ~var_1_19~0 256)))) [2023-11-29 00:46:17,966 INFO L895 garLoopResultBuilder]: At program point L83-1(line 83) the Hoare annotation is: (<= ~var_1_19~0 (+ ~var_1_8~0 (* 256 (div ~var_1_19~0 256)))) [2023-11-29 00:46:17,966 INFO L899 garLoopResultBuilder]: For program point L46(lines 46 50) no Hoare annotation was computed. [2023-11-29 00:46:17,966 INFO L899 garLoopResultBuilder]: For program point L75(line 75) no Hoare annotation was computed. [2023-11-29 00:46:17,966 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 00:46:17,966 INFO L895 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: (< ~var_1_19~0 (+ ~var_1_8~0 (* 256 (div ~var_1_19~0 256)) 1)) [2023-11-29 00:46:17,966 INFO L895 garLoopResultBuilder]: At program point L71-1(line 71) the Hoare annotation is: (< ~var_1_19~0 (+ ~var_1_8~0 (* 256 (div ~var_1_19~0 256)) 1)) [2023-11-29 00:46:17,966 INFO L895 garLoopResultBuilder]: At program point L104-2(lines 104 110) the Hoare annotation is: (< ~var_1_19~0 (+ ~var_1_8~0 (* 256 (div ~var_1_19~0 256)) 1)) [2023-11-29 00:46:17,967 INFO L899 garLoopResultBuilder]: For program point L104-3(lines 104 110) no Hoare annotation was computed. [2023-11-29 00:46:17,967 INFO L895 garLoopResultBuilder]: At program point L92(line 92) the Hoare annotation is: (<= ~var_1_19~0 (+ ~var_1_8~0 (* 256 (div ~var_1_19~0 256)))) [2023-11-29 00:46:17,967 INFO L895 garLoopResultBuilder]: At program point L92-1(line 92) the Hoare annotation is: (<= ~var_1_19~0 (+ ~var_1_8~0 (* 256 (div ~var_1_19~0 256)))) [2023-11-29 00:46:17,967 INFO L899 garLoopResultBuilder]: For program point L55(lines 55 59) no Hoare annotation was computed. [2023-11-29 00:46:17,967 INFO L899 garLoopResultBuilder]: For program point L55-2(lines 39 65) no Hoare annotation was computed. [2023-11-29 00:46:17,967 INFO L899 garLoopResultBuilder]: For program point L84(line 84) no Hoare annotation was computed. [2023-11-29 00:46:17,967 INFO L895 garLoopResultBuilder]: At program point L80(line 80) the Hoare annotation is: (< ~var_1_19~0 (+ ~var_1_8~0 (* 256 (div ~var_1_19~0 256)) 1)) [2023-11-29 00:46:17,968 INFO L895 garLoopResultBuilder]: At program point L80-1(line 80) the Hoare annotation is: (< ~var_1_19~0 (+ ~var_1_8~0 (* 256 (div ~var_1_19~0 256)) 1)) [2023-11-29 00:46:17,968 INFO L899 garLoopResultBuilder]: For program point L72(line 72) no Hoare annotation was computed. [2023-11-29 00:46:17,968 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 65) no Hoare annotation was computed. [2023-11-29 00:46:17,968 INFO L895 garLoopResultBuilder]: At program point L68(line 68) the Hoare annotation is: (< ~var_1_19~0 (+ ~var_1_8~0 (* 256 (div ~var_1_19~0 256)) 1)) [2023-11-29 00:46:17,968 INFO L895 garLoopResultBuilder]: At program point L68-1(line 68) the Hoare annotation is: (< ~var_1_19~0 (+ ~var_1_8~0 (* 256 (div ~var_1_19~0 256)) 1)) [2023-11-29 00:46:17,968 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-29 00:46:17,968 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-29 00:46:17,969 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-29 00:46:17,969 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-29 00:46:17,972 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-29 00:46:17,974 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 00:46:17,986 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 12:46:17 BoogieIcfgContainer [2023-11-29 00:46:17,986 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 00:46:17,987 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 00:46:17,987 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 00:46:17,989 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 00:46:17,990 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:46:12" (3/4) ... [2023-11-29 00:46:17,992 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 00:46:17,999 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-29 00:46:18,005 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2023-11-29 00:46:18,005 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2023-11-29 00:46:18,005 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-29 00:46:18,006 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 00:46:18,089 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39465174-40ce-406b-9111-a5effa2190d3/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 00:46:18,089 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39465174-40ce-406b-9111-a5effa2190d3/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 00:46:18,090 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 00:46:18,090 INFO L158 Benchmark]: Toolchain (without parser) took 6858.49ms. Allocated memory was 169.9MB in the beginning and 247.5MB in the end (delta: 77.6MB). Free memory was 137.1MB in the beginning and 111.1MB in the end (delta: 26.0MB). Peak memory consumption was 103.4MB. Max. memory is 16.1GB. [2023-11-29 00:46:18,091 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 121.6MB. Free memory is still 93.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 00:46:18,091 INFO L158 Benchmark]: CACSL2BoogieTranslator took 284.14ms. Allocated memory is still 169.9MB. Free memory was 137.1MB in the beginning and 124.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 00:46:18,091 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.03ms. Allocated memory is still 169.9MB. Free memory was 124.5MB in the beginning and 122.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 00:46:18,092 INFO L158 Benchmark]: Boogie Preprocessor took 42.21ms. Allocated memory is still 169.9MB. Free memory was 122.5MB in the beginning and 119.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 00:46:18,092 INFO L158 Benchmark]: RCFGBuilder took 431.52ms. Allocated memory is still 169.9MB. Free memory was 119.7MB in the beginning and 123.2MB in the end (delta: -3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 00:46:18,093 INFO L158 Benchmark]: TraceAbstraction took 5944.71ms. Allocated memory was 169.9MB in the beginning and 247.5MB in the end (delta: 77.6MB). Free memory was 122.3MB in the beginning and 117.4MB in the end (delta: 5.0MB). Peak memory consumption was 85.2MB. Max. memory is 16.1GB. [2023-11-29 00:46:18,093 INFO L158 Benchmark]: Witness Printer took 102.99ms. Allocated memory is still 247.5MB. Free memory was 117.4MB in the beginning and 111.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-29 00:46:18,095 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.13ms. Allocated memory is still 121.6MB. Free memory is still 93.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 284.14ms. Allocated memory is still 169.9MB. Free memory was 137.1MB in the beginning and 124.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.03ms. Allocated memory is still 169.9MB. Free memory was 124.5MB in the beginning and 122.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.21ms. Allocated memory is still 169.9MB. Free memory was 122.5MB in the beginning and 119.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 431.52ms. Allocated memory is still 169.9MB. Free memory was 119.7MB in the beginning and 123.2MB in the end (delta: -3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * TraceAbstraction took 5944.71ms. Allocated memory was 169.9MB in the beginning and 247.5MB in the end (delta: 77.6MB). Free memory was 122.3MB in the beginning and 117.4MB in the end (delta: 5.0MB). Peak memory consumption was 85.2MB. Max. memory is 16.1GB. * Witness Printer took 102.99ms. Allocated memory is still 247.5MB. Free memory was 117.4MB in the beginning and 111.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 45 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.9s, OverallIterations: 4, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 171 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 171 mSDsluCounter, 667 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 372 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 212 IncrementalHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 295 mSDtfsCounter, 212 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 190 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred in iteration=3, InterpolantAutomatonStates: 22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 89 PreInvPairs, 126 NumberOfFragments, 183 HoareAnnotationTreeSize, 89 FomulaSimplifications, 2227 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 20 FomulaSimplificationsInter, 418 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 432 NumberOfCodeBlocks, 432 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 428 ConstructedInterpolants, 0 QuantifiedInterpolants, 1053 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 2448/2448 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: (var_1_19 < ((var_1_8 + (256 * (var_1_19 / 256))) + 1)) RESULT: Ultimate proved your program to be correct! [2023-11-29 00:46:18,111 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39465174-40ce-406b-9111-a5effa2190d3/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE