./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-93.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca72760b-8ce2-4517-9828-e76bfd129180/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca72760b-8ce2-4517-9828-e76bfd129180/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_ca72760b-8ce2-4517-9828-e76bfd129180/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca72760b-8ce2-4517-9828-e76bfd129180/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-93.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca72760b-8ce2-4517-9828-e76bfd129180/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_ca72760b-8ce2-4517-9828-e76bfd129180/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 8d967df176a3fd5ac0c12ff3bbfde8cbb01bd6c0de3c75d24920428ec3dcf217 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 02:18:00,117 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 02:18:00,179 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca72760b-8ce2-4517-9828-e76bfd129180/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 02:18:00,183 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 02:18:00,183 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 02:18:00,205 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 02:18:00,205 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 02:18:00,206 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 02:18:00,206 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 02:18:00,207 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 02:18:00,207 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 02:18:00,208 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 02:18:00,209 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 02:18:00,209 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 02:18:00,210 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 02:18:00,210 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 02:18:00,211 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 02:18:00,211 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 02:18:00,212 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 02:18:00,212 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 02:18:00,212 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 02:18:00,217 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 02:18:00,217 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 02:18:00,218 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 02:18:00,218 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 02:18:00,219 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 02:18:00,219 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 02:18:00,219 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 02:18:00,220 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 02:18:00,220 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 02:18:00,220 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 02:18:00,221 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:18:00,221 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 02:18:00,221 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 02:18:00,222 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 02:18:00,222 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 02:18:00,222 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 02:18:00,222 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 02:18:00,222 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 02:18:00,223 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 02:18:00,223 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 02:18:00,223 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 02:18:00,223 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_ca72760b-8ce2-4517-9828-e76bfd129180/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_ca72760b-8ce2-4517-9828-e76bfd129180/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 -> 8d967df176a3fd5ac0c12ff3bbfde8cbb01bd6c0de3c75d24920428ec3dcf217 [2023-11-29 02:18:00,446 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 02:18:00,465 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 02:18:00,468 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 02:18:00,469 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 02:18:00,469 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 02:18:00,470 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca72760b-8ce2-4517-9828-e76bfd129180/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-93.i [2023-11-29 02:18:03,267 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 02:18:03,447 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 02:18:03,448 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca72760b-8ce2-4517-9828-e76bfd129180/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-93.i [2023-11-29 02:18:03,457 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca72760b-8ce2-4517-9828-e76bfd129180/bin/uautomizer-verify-BQ2R08f2Ya/data/9517418b2/15441a4c9b464cad89881356fb78e5ae/FLAG08938f1f1 [2023-11-29 02:18:03,471 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca72760b-8ce2-4517-9828-e76bfd129180/bin/uautomizer-verify-BQ2R08f2Ya/data/9517418b2/15441a4c9b464cad89881356fb78e5ae [2023-11-29 02:18:03,473 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 02:18:03,475 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 02:18:03,476 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 02:18:03,476 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 02:18:03,481 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 02:18:03,482 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:18:03" (1/1) ... [2023-11-29 02:18:03,483 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e490847 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:18:03, skipping insertion in model container [2023-11-29 02:18:03,483 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:18:03" (1/1) ... [2023-11-29 02:18:03,510 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 02:18:03,628 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_ca72760b-8ce2-4517-9828-e76bfd129180/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-93.i[915,928] [2023-11-29 02:18:03,663 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:18:03,675 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 02:18:03,689 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_ca72760b-8ce2-4517-9828-e76bfd129180/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-93.i[915,928] [2023-11-29 02:18:03,709 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:18:03,725 INFO L206 MainTranslator]: Completed translation [2023-11-29 02:18:03,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:18:03 WrapperNode [2023-11-29 02:18:03,726 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 02:18:03,727 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 02:18:03,727 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 02:18:03,728 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 02:18:03,735 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:18:03" (1/1) ... [2023-11-29 02:18:03,745 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:18:03" (1/1) ... [2023-11-29 02:18:03,771 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 122 [2023-11-29 02:18:03,772 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 02:18:03,773 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 02:18:03,773 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 02:18:03,773 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 02:18:03,782 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:18:03" (1/1) ... [2023-11-29 02:18:03,783 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:18:03" (1/1) ... [2023-11-29 02:18:03,786 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:18:03" (1/1) ... [2023-11-29 02:18:03,800 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 02:18:03,801 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:18:03" (1/1) ... [2023-11-29 02:18:03,801 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:18:03" (1/1) ... [2023-11-29 02:18:03,808 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:18:03" (1/1) ... [2023-11-29 02:18:03,812 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:18:03" (1/1) ... [2023-11-29 02:18:03,814 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:18:03" (1/1) ... [2023-11-29 02:18:03,815 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:18:03" (1/1) ... [2023-11-29 02:18:03,818 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 02:18:03,819 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 02:18:03,820 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 02:18:03,820 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 02:18:03,820 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:18:03" (1/1) ... [2023-11-29 02:18:03,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:18:03,836 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca72760b-8ce2-4517-9828-e76bfd129180/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:18:03,848 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca72760b-8ce2-4517-9828-e76bfd129180/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 02:18:03,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca72760b-8ce2-4517-9828-e76bfd129180/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 02:18:03,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 02:18:03,882 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 02:18:03,882 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 02:18:03,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 02:18:03,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 02:18:03,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 02:18:03,955 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 02:18:03,957 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 02:18:04,152 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 02:18:04,203 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 02:18:04,203 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 02:18:04,203 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:18:04 BoogieIcfgContainer [2023-11-29 02:18:04,204 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 02:18:04,206 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 02:18:04,206 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 02:18:04,210 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 02:18:04,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 02:18:03" (1/3) ... [2023-11-29 02:18:04,211 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f7c62f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:18:04, skipping insertion in model container [2023-11-29 02:18:04,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:18:03" (2/3) ... [2023-11-29 02:18:04,211 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f7c62f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:18:04, skipping insertion in model container [2023-11-29 02:18:04,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:18:04" (3/3) ... [2023-11-29 02:18:04,213 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-93.i [2023-11-29 02:18:04,233 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 02:18:04,233 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 02:18:04,286 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 02:18:04,293 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;@4863dafd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 02:18:04,294 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 02:18:04,299 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 27 states have internal predecessors, (37), 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 02:18:04,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-29 02:18:04,331 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:18:04,332 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 02:18:04,333 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:18:04,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:18:04,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1004756318, now seen corresponding path program 1 times [2023-11-29 02:18:04,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:18:04,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638224150] [2023-11-29 02:18:04,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:18:04,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:18:04,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:04,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:18:04,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:04,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:18:04,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:04,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:18:04,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:04,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 02:18:04,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:04,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 02:18:04,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:04,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 02:18:04,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:04,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 02:18:04,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:04,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 02:18:04,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:04,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 02:18:04,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:04,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 02:18:04,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:04,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 02:18:04,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:04,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 02:18:04,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:04,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 02:18:04,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:04,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 02:18:04,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:04,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 02:18:04,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:04,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 02:18:04,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:04,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-29 02:18:04,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:04,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-29 02:18:04,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:04,672 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 02:18:04,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:18:04,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638224150] [2023-11-29 02:18:04,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638224150] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:18:04,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:18:04,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:18:04,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224641973] [2023-11-29 02:18:04,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:18:04,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 02:18:04,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:18:04,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 02:18:04,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 02:18:04,711 INFO L87 Difference]: Start difference. First operand has 47 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 27 states have internal predecessors, (37), 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 02:18:04,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:18:04,752 INFO L93 Difference]: Finished difference Result 93 states and 163 transitions. [2023-11-29 02:18:04,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 02:18:04,755 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 02:18:04,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:18:04,761 INFO L225 Difference]: With dead ends: 93 [2023-11-29 02:18:04,761 INFO L226 Difference]: Without dead ends: 45 [2023-11-29 02:18:04,765 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 02:18:04,768 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:18:04,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 02:18:04,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-11-29 02:18:04,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2023-11-29 02:18:04,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 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 02:18:04,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 68 transitions. [2023-11-29 02:18:04,810 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 68 transitions. Word has length 108 [2023-11-29 02:18:04,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:18:04,811 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 68 transitions. [2023-11-29 02:18:04,811 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 02:18:04,811 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 68 transitions. [2023-11-29 02:18:04,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-29 02:18:04,816 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:18:04,817 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 02:18:04,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 02:18:04,817 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:18:04,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:18:04,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1882121826, now seen corresponding path program 1 times [2023-11-29 02:18:04,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:18:04,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031057105] [2023-11-29 02:18:04,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:18:04,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:18:04,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 02:18:04,948 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 02:18:05,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 02:18:05,057 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 02:18:05,057 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 02:18:05,059 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 02:18:05,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 02:18:05,063 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-11-29 02:18:05,066 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 02:18:05,135 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 02:18:05 BoogieIcfgContainer [2023-11-29 02:18:05,135 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 02:18:05,136 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 02:18:05,136 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 02:18:05,136 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 02:18:05,137 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:18:04" (3/4) ... [2023-11-29 02:18:05,139 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 02:18:05,140 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 02:18:05,140 INFO L158 Benchmark]: Toolchain (without parser) took 1665.43ms. Allocated memory is still 146.8MB. Free memory was 108.5MB in the beginning and 65.6MB in the end (delta: 42.8MB). Peak memory consumption was 43.8MB. Max. memory is 16.1GB. [2023-11-29 02:18:05,141 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 104.9MB. Free memory is still 55.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 02:18:05,141 INFO L158 Benchmark]: CACSL2BoogieTranslator took 250.26ms. Allocated memory is still 146.8MB. Free memory was 108.1MB in the beginning and 95.9MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 02:18:05,142 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.79ms. Allocated memory is still 146.8MB. Free memory was 95.9MB in the beginning and 93.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 02:18:05,143 INFO L158 Benchmark]: Boogie Preprocessor took 46.03ms. Allocated memory is still 146.8MB. Free memory was 93.8MB in the beginning and 91.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 02:18:05,143 INFO L158 Benchmark]: RCFGBuilder took 384.36ms. Allocated memory is still 146.8MB. Free memory was 91.4MB in the beginning and 73.4MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-29 02:18:05,144 INFO L158 Benchmark]: TraceAbstraction took 929.40ms. Allocated memory is still 146.8MB. Free memory was 72.8MB in the beginning and 66.2MB in the end (delta: 6.6MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. [2023-11-29 02:18:05,145 INFO L158 Benchmark]: Witness Printer took 3.68ms. Allocated memory is still 146.8MB. Free memory was 66.2MB in the beginning and 65.6MB in the end (delta: 570.0kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 02:18:05,148 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.14ms. Allocated memory is still 104.9MB. Free memory is still 55.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 250.26ms. Allocated memory is still 146.8MB. Free memory was 108.1MB in the beginning and 95.9MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.79ms. Allocated memory is still 146.8MB. Free memory was 95.9MB in the beginning and 93.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.03ms. Allocated memory is still 146.8MB. Free memory was 93.8MB in the beginning and 91.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 384.36ms. Allocated memory is still 146.8MB. Free memory was 91.4MB in the beginning and 73.4MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 929.40ms. Allocated memory is still 146.8MB. Free memory was 72.8MB in the beginning and 66.2MB in the end (delta: 6.6MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. * Witness Printer took 3.68ms. Allocated memory is still 146.8MB. Free memory was 66.2MB in the beginning and 65.6MB in the end (delta: 570.0kB). There was no memory consumed. 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 - 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 101, overapproximation of someBinaryFLOATComparisonOperation at line 101, overapproximation of someUnaryDOUBLEoperation at line 23. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 255.3; [L23] double var_1_3 = -0.9; [L24] double var_1_4 = 2.6; [L25] double var_1_5 = 128.5; [L26] float var_1_7 = 1.25; [L27] unsigned char var_1_8 = 0; [L28] unsigned char var_1_9 = 1; [L29] unsigned char var_1_10 = 0; [L30] signed char var_1_11 = -1; [L31] signed char var_1_12 = -10; [L32] signed char var_1_13 = -32; [L33] signed char var_1_14 = -2; [L34] unsigned long int var_1_15 = 500; [L35] unsigned long int var_1_16 = 16; [L36] float last_1_var_1_1 = 255.3; [L37] unsigned char last_1_var_1_8 = 0; [L105] isInitial = 1 [L106] FCALL initially() [L107] int k_loop; [L108] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_4=13/5, var_1_5=257/2, var_1_7=5/4, var_1_8=0, var_1_9=1] [L108] COND TRUE k_loop < 1 [L109] CALL updateLastVariables() [L97] last_1_var_1_1 = var_1_1 [L98] last_1_var_1_8 = var_1_8 [L109] RET updateLastVariables() [L110] CALL updateVariables() [L67] var_1_3 = __VERIFIER_nondet_double() [L68] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_4=13/5, var_1_5=257/2, var_1_7=5/4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_4=13/5, var_1_5=257/2, var_1_7=5/4, var_1_8=0, var_1_9=1] [L68] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_4=13/5, var_1_5=257/2, var_1_7=5/4, var_1_8=0, var_1_9=1] [L69] CALL assume_abort_if_not(var_1_3 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_4=13/5, var_1_5=257/2, var_1_7=5/4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_4=13/5, var_1_5=257/2, var_1_7=5/4, var_1_8=0, var_1_9=1] [L69] RET assume_abort_if_not(var_1_3 != 0.0F) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_4=13/5, var_1_5=257/2, var_1_7=5/4, var_1_8=0, var_1_9=1] [L70] var_1_4 = __VERIFIER_nondet_double() [L71] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_5=257/2, var_1_7=5/4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_5=257/2, var_1_7=5/4, var_1_8=0, var_1_9=1] [L71] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_5=257/2, var_1_7=5/4, var_1_8=0, var_1_9=1] [L72] var_1_5 = __VERIFIER_nondet_double() [L73] CALL assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_7=5/4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_7=5/4, var_1_8=0, var_1_9=1] [L73] RET assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_7=5/4, var_1_8=0, var_1_9=1] [L74] CALL assume_abort_if_not(var_1_5 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_7=5/4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_7=5/4, var_1_8=0, var_1_9=1] [L74] RET assume_abort_if_not(var_1_5 != 0.0F) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_7=5/4, var_1_8=0, var_1_9=1] [L75] var_1_7 = __VERIFIER_nondet_float() [L76] CALL assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L76] RET assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L77] var_1_9 = __VERIFIER_nondet_uchar() [L78] CALL assume_abort_if_not(var_1_9 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L78] RET assume_abort_if_not(var_1_9 >= 1) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L79] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L79] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L80] var_1_10 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L81] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L82] CALL assume_abort_if_not(var_1_10 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L82] RET assume_abort_if_not(var_1_10 <= 0) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L83] var_1_12 = __VERIFIER_nondet_char() [L84] CALL assume_abort_if_not(var_1_12 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-127, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-127, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L84] RET assume_abort_if_not(var_1_12 >= -127) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-127, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L85] CALL assume_abort_if_not(var_1_12 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-127, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-127, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L85] RET assume_abort_if_not(var_1_12 <= 126) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-127, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L86] var_1_13 = __VERIFIER_nondet_char() [L87] CALL assume_abort_if_not(var_1_13 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-127, var_1_13=-59, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-127, var_1_13=-59, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L87] RET assume_abort_if_not(var_1_13 >= -63) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-127, var_1_13=-59, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L88] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-127, var_1_13=-59, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-127, var_1_13=-59, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L88] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-127, var_1_13=-59, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L89] var_1_14 = __VERIFIER_nondet_char() [L90] CALL assume_abort_if_not(var_1_14 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-127, var_1_13=-59, var_1_14=63, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-127, var_1_13=-59, var_1_14=63, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L90] RET assume_abort_if_not(var_1_14 >= -63) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-127, var_1_13=-59, var_1_14=63, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L91] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-127, var_1_13=-59, var_1_14=63, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-127, var_1_13=-59, var_1_14=63, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L91] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-127, var_1_13=-59, var_1_14=63, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L92] var_1_16 = __VERIFIER_nondet_ulong() [L93] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-127, var_1_13=-59, var_1_14=63, var_1_15=500, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-127, var_1_13=-59, var_1_14=63, var_1_15=500, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L93] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-127, var_1_13=-59, var_1_14=63, var_1_15=500, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L94] CALL assume_abort_if_not(var_1_16 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-127, var_1_13=-59, var_1_14=63, var_1_15=500, var_1_16=4294967294, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-127, var_1_13=-59, var_1_14=63, var_1_15=500, var_1_16=4294967294, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L94] RET assume_abort_if_not(var_1_16 <= 4294967294) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-127, var_1_13=-59, var_1_14=63, var_1_15=500, var_1_16=4294967294, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L110] RET updateVariables() [L111] CALL step() [L41] COND FALSE !(((- last_1_var_1_1) / var_1_3) != (var_1_4 / var_1_5)) [L48] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-127, var_1_13=-59, var_1_14=63, var_1_15=500, var_1_16=4294967294, var_1_1=4294967299, var_1_7=4294967299, var_1_8=0, var_1_9=1] [L50] COND FALSE !(var_1_1 != var_1_1) [L55] var_1_8 = (! var_1_10) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-127, var_1_13=-59, var_1_14=63, var_1_15=500, var_1_16=4294967294, var_1_1=4294967299, var_1_7=4294967299, var_1_8=1, var_1_9=1] [L57] COND FALSE !(var_1_1 < var_1_1) [L62] var_1_11 = (var_1_13 + var_1_14) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=4, var_1_12=-127, var_1_13=-59, var_1_14=63, var_1_15=500, var_1_16=4294967294, var_1_1=4294967299, var_1_7=4294967299, var_1_8=1, var_1_9=1] [L64] var_1_15 = var_1_16 [L111] RET step() [L112] CALL, EXPR property() [L101-L102] return ((((((- last_1_var_1_1) / var_1_3) != (var_1_4 / var_1_5)) ? (last_1_var_1_8 ? (var_1_1 == ((float) var_1_7)) : (var_1_1 == ((float) var_1_7))) : (var_1_1 == ((float) var_1_7))) && ((var_1_1 != var_1_1) ? ((var_1_1 < (var_1_1 * 15.25)) ? (var_1_8 == ((unsigned char) (! var_1_9))) : 1) : (var_1_8 == ((unsigned char) (! var_1_10))))) && ((var_1_1 < var_1_1) ? (var_1_10 ? (var_1_11 == ((signed char) var_1_12)) : 1) : (var_1_11 == ((signed char) (var_1_13 + var_1_14))))) && (var_1_15 == ((unsigned long int) var_1_16)) ; [L112] RET, EXPR property() [L112] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=4, var_1_12=-127, var_1_13=-59, var_1_14=63, var_1_15=4294967294, var_1_16=4294967294, var_1_1=4294967299, var_1_7=4294967299, var_1_8=1, var_1_9=1] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=4, var_1_12=-127, var_1_13=-59, var_1_14=63, var_1_15=4294967294, var_1_16=4294967294, var_1_1=4294967299, var_1_7=4294967299, var_1_8=1, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 47 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 2, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 65 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5 IncrementalHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 65 mSDtfsCounter, 5 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 216 NumberOfCodeBlocks, 216 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 107 ConstructedInterpolants, 0 QuantifiedInterpolants, 107 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 612/612 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 02:18:05,178 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca72760b-8ce2-4517-9828-e76bfd129180/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca72760b-8ce2-4517-9828-e76bfd129180/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca72760b-8ce2-4517-9828-e76bfd129180/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_ca72760b-8ce2-4517-9828-e76bfd129180/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca72760b-8ce2-4517-9828-e76bfd129180/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-93.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca72760b-8ce2-4517-9828-e76bfd129180/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_ca72760b-8ce2-4517-9828-e76bfd129180/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 8d967df176a3fd5ac0c12ff3bbfde8cbb01bd6c0de3c75d24920428ec3dcf217 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 02:18:07,107 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 02:18:07,183 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca72760b-8ce2-4517-9828-e76bfd129180/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-29 02:18:07,189 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 02:18:07,189 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 02:18:07,216 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 02:18:07,217 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 02:18:07,217 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 02:18:07,218 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 02:18:07,218 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 02:18:07,219 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 02:18:07,219 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 02:18:07,220 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 02:18:07,221 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 02:18:07,221 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 02:18:07,222 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 02:18:07,222 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 02:18:07,223 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 02:18:07,223 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 02:18:07,223 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 02:18:07,224 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 02:18:07,227 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 02:18:07,228 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 02:18:07,228 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 02:18:07,228 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 02:18:07,229 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 02:18:07,229 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 02:18:07,229 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 02:18:07,230 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 02:18:07,230 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 02:18:07,230 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 02:18:07,231 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 02:18:07,231 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 02:18:07,231 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:18:07,231 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 02:18:07,232 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 02:18:07,232 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 02:18:07,232 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 02:18:07,232 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 02:18:07,232 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 02:18:07,233 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 02:18:07,233 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 02:18:07,233 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 02:18:07,233 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 02:18:07,233 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 02:18:07,233 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_ca72760b-8ce2-4517-9828-e76bfd129180/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_ca72760b-8ce2-4517-9828-e76bfd129180/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 -> 8d967df176a3fd5ac0c12ff3bbfde8cbb01bd6c0de3c75d24920428ec3dcf217 [2023-11-29 02:18:07,534 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 02:18:07,556 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 02:18:07,558 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 02:18:07,560 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 02:18:07,560 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 02:18:07,562 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca72760b-8ce2-4517-9828-e76bfd129180/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-93.i [2023-11-29 02:18:10,340 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 02:18:10,535 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 02:18:10,536 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca72760b-8ce2-4517-9828-e76bfd129180/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-93.i [2023-11-29 02:18:10,545 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca72760b-8ce2-4517-9828-e76bfd129180/bin/uautomizer-verify-BQ2R08f2Ya/data/fb56c6d95/7faeaca4a8484add853f4c79cb013e0b/FLAGf25ec1a2c [2023-11-29 02:18:10,561 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca72760b-8ce2-4517-9828-e76bfd129180/bin/uautomizer-verify-BQ2R08f2Ya/data/fb56c6d95/7faeaca4a8484add853f4c79cb013e0b [2023-11-29 02:18:10,563 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 02:18:10,565 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 02:18:10,566 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 02:18:10,566 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 02:18:10,571 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 02:18:10,572 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:18:10" (1/1) ... [2023-11-29 02:18:10,573 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@184ee7b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:18:10, skipping insertion in model container [2023-11-29 02:18:10,573 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:18:10" (1/1) ... [2023-11-29 02:18:10,598 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 02:18:10,735 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_ca72760b-8ce2-4517-9828-e76bfd129180/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-93.i[915,928] [2023-11-29 02:18:10,776 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:18:10,791 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 02:18:10,802 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_ca72760b-8ce2-4517-9828-e76bfd129180/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-93.i[915,928] [2023-11-29 02:18:10,826 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:18:10,843 INFO L206 MainTranslator]: Completed translation [2023-11-29 02:18:10,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:18:10 WrapperNode [2023-11-29 02:18:10,844 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 02:18:10,845 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 02:18:10,845 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 02:18:10,845 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 02:18:10,851 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:18:10" (1/1) ... [2023-11-29 02:18:10,862 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:18:10" (1/1) ... [2023-11-29 02:18:10,890 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 119 [2023-11-29 02:18:10,890 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 02:18:10,891 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 02:18:10,891 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 02:18:10,891 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 02:18:10,901 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:18:10" (1/1) ... [2023-11-29 02:18:10,901 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:18:10" (1/1) ... [2023-11-29 02:18:10,906 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:18:10" (1/1) ... [2023-11-29 02:18:10,918 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 02:18:10,918 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:18:10" (1/1) ... [2023-11-29 02:18:10,919 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:18:10" (1/1) ... [2023-11-29 02:18:10,929 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:18:10" (1/1) ... [2023-11-29 02:18:10,932 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:18:10" (1/1) ... [2023-11-29 02:18:10,935 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:18:10" (1/1) ... [2023-11-29 02:18:10,937 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:18:10" (1/1) ... [2023-11-29 02:18:10,941 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 02:18:10,943 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 02:18:10,943 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 02:18:10,943 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 02:18:10,944 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:18:10" (1/1) ... [2023-11-29 02:18:10,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:18:10,999 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca72760b-8ce2-4517-9828-e76bfd129180/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:18:11,022 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca72760b-8ce2-4517-9828-e76bfd129180/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 02:18:11,041 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca72760b-8ce2-4517-9828-e76bfd129180/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 02:18:11,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 02:18:11,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 02:18:11,068 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 02:18:11,068 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 02:18:11,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 02:18:11,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 02:18:11,152 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 02:18:11,154 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 02:18:22,782 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 02:18:22,833 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 02:18:22,833 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 02:18:22,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:18:22 BoogieIcfgContainer [2023-11-29 02:18:22,834 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 02:18:22,837 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 02:18:22,837 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 02:18:22,840 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 02:18:22,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 02:18:10" (1/3) ... [2023-11-29 02:18:22,841 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e99443d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:18:22, skipping insertion in model container [2023-11-29 02:18:22,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:18:10" (2/3) ... [2023-11-29 02:18:22,842 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e99443d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:18:22, skipping insertion in model container [2023-11-29 02:18:22,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:18:22" (3/3) ... [2023-11-29 02:18:22,843 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-93.i [2023-11-29 02:18:22,862 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 02:18:22,862 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 02:18:22,901 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 02:18:22,906 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;@200bc752, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 02:18:22,906 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 02:18:22,909 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 27 states have internal predecessors, (37), 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 02:18:22,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-29 02:18:22,922 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:18:22,923 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 02:18:22,923 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:18:22,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:18:22,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1004756318, now seen corresponding path program 1 times [2023-11-29 02:18:22,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:18:22,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [67424239] [2023-11-29 02:18:22,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:18:22,939 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 02:18:22,939 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca72760b-8ce2-4517-9828-e76bfd129180/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:18:22,940 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca72760b-8ce2-4517-9828-e76bfd129180/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 02:18:22,943 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca72760b-8ce2-4517-9828-e76bfd129180/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 02:18:24,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:24,637 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 02:18:24,643 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:18:24,671 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2023-11-29 02:18:24,671 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:18:24,671 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:18:24,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [67424239] [2023-11-29 02:18:24,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [67424239] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:18:24,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:18:24,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:18:24,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972936387] [2023-11-29 02:18:24,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:18:24,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 02:18:24,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:18:24,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 02:18:24,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 02:18:24,711 INFO L87 Difference]: Start difference. First operand has 47 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 27 states have internal predecessors, (37), 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 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (18), 2 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 02:18:25,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:18:25,706 INFO L93 Difference]: Finished difference Result 92 states and 161 transitions. [2023-11-29 02:18:25,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 02:18:25,709 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (18), 2 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 02:18:25,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:18:25,716 INFO L225 Difference]: With dead ends: 92 [2023-11-29 02:18:25,716 INFO L226 Difference]: Without dead ends: 44 [2023-11-29 02:18:25,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 107 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 02:18:25,723 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:18:25,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 02:18:25,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-11-29 02:18:25,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2023-11-29 02:18:25,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 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 02:18:25,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 65 transitions. [2023-11-29 02:18:25,762 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 65 transitions. Word has length 108 [2023-11-29 02:18:25,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:18:25,763 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 65 transitions. [2023-11-29 02:18:25,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (18), 2 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 02:18:25,763 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 65 transitions. [2023-11-29 02:18:25,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-29 02:18:25,767 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:18:25,767 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 02:18:25,793 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca72760b-8ce2-4517-9828-e76bfd129180/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 02:18:25,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca72760b-8ce2-4517-9828-e76bfd129180/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 02:18:25,968 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:18:25,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:18:25,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1882121826, now seen corresponding path program 1 times [2023-11-29 02:18:25,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:18:25,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [290178802] [2023-11-29 02:18:25,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:18:25,971 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 02:18:25,971 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca72760b-8ce2-4517-9828-e76bfd129180/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:18:25,971 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca72760b-8ce2-4517-9828-e76bfd129180/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 02:18:25,972 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca72760b-8ce2-4517-9828-e76bfd129180/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 02:18:27,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:27,631 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-29 02:18:27,637 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:19:23,903 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 267 proven. 36 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2023-11-29 02:19:23,903 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:19:36,983 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 02:19:36,983 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:19:36,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [290178802] [2023-11-29 02:19:36,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [290178802] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 02:19:36,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 02:19:36,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2023-11-29 02:19:36,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270284840] [2023-11-29 02:19:36,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:19:36,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:19:36,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:19:36,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:19:36,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2023-11-29 02:19:36,987 INFO L87 Difference]: Start difference. First operand 44 states and 65 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 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 02:19:43,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 6.33s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:19:47,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:19:53,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:19:53,269 INFO L93 Difference]: Finished difference Result 76 states and 105 transitions. [2023-11-29 02:19:53,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 02:19:53,270 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 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 02:19:53,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:19:53,273 INFO L225 Difference]: With dead ends: 76 [2023-11-29 02:19:53,273 INFO L226 Difference]: Without dead ends: 74 [2023-11-29 02:19:53,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2023-11-29 02:19:53,275 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 54 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 13 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.8s IncrementalHoareTripleChecker+Time [2023-11-29 02:19:53,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 242 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 55 Invalid, 2 Unknown, 0 Unchecked, 15.8s Time] [2023-11-29 02:19:53,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-11-29 02:19:53,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 59. [2023-11-29 02:19:53,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 34 states have internal predecessors, (38), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-29 02:19:53,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 84 transitions. [2023-11-29 02:19:53,296 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 84 transitions. Word has length 108 [2023-11-29 02:19:53,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:19:53,297 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 84 transitions. [2023-11-29 02:19:53,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 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 02:19:53,298 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 84 transitions. [2023-11-29 02:19:53,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-29 02:19:53,300 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:19:53,300 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:19:53,323 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca72760b-8ce2-4517-9828-e76bfd129180/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-29 02:19:53,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca72760b-8ce2-4517-9828-e76bfd129180/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 02:19:53,501 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:19:53,502 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:19:53,502 INFO L85 PathProgramCache]: Analyzing trace with hash -2030727135, now seen corresponding path program 1 times [2023-11-29 02:19:53,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:19:53,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [857275448] [2023-11-29 02:19:53,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:19:53,503 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 02:19:53,503 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca72760b-8ce2-4517-9828-e76bfd129180/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:19:53,504 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca72760b-8ce2-4517-9828-e76bfd129180/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 02:19:53,505 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca72760b-8ce2-4517-9828-e76bfd129180/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-29 02:19:55,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:19:55,109 INFO L262 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 02:19:55,112 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:20:03,965 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 15 proven. 288 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2023-11-29 02:20:03,965 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:20:05,759 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 15 proven. 36 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-11-29 02:20:05,759 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:20:05,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [857275448] [2023-11-29 02:20:05,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [857275448] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:20:05,760 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:20:05,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-11-29 02:20:05,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798420004] [2023-11-29 02:20:05,761 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:20:05,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 02:20:05,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:20:05,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 02:20:05,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-11-29 02:20:05,764 INFO L87 Difference]: Start difference. First operand 59 states and 84 transitions. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 4 states have call predecessors, (36), 4 states have call successors, (36) [2023-11-29 02:20:15,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 6.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:20:19,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:20:23,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:20:30,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 6.85s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:20:34,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:20:38,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 02:20:40,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:20:40,273 INFO L93 Difference]: Finished difference Result 109 states and 152 transitions. [2023-11-29 02:20:40,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 02:20:40,274 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 4 states have call predecessors, (36), 4 states have call successors, (36) Word has length 109 [2023-11-29 02:20:40,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:20:40,276 INFO L225 Difference]: With dead ends: 109 [2023-11-29 02:20:40,276 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 02:20:40,278 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2023-11-29 02:20:40,280 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 79 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 114 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.5s IncrementalHoareTripleChecker+Time [2023-11-29 02:20:40,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 57 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 123 Invalid, 6 Unknown, 0 Unchecked, 32.5s Time] [2023-11-29 02:20:40,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 02:20:40,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 02:20:40,282 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 02:20:40,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 02:20:40,282 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 109 [2023-11-29 02:20:40,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:20:40,283 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 02:20:40,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 4 states have call predecessors, (36), 4 states have call successors, (36) [2023-11-29 02:20:40,283 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 02:20:40,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 02:20:40,286 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 02:20:40,311 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca72760b-8ce2-4517-9828-e76bfd129180/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-29 02:20:40,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca72760b-8ce2-4517-9828-e76bfd129180/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 02:20:40,489 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-29 02:20:53,565 INFO L895 garLoopResultBuilder]: At program point L93(line 93) the Hoare annotation is: (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse0 (fp.neg .cse3)) (.cse1 (fp.neg .cse2))) (and (or (and (fp.leq ~var_1_7~0 .cse0) (fp.geq ~var_1_7~0 .cse1)) (and (fp.leq ~var_1_7~0 .cse2) (fp.geq ~var_1_7~0 .cse3))) (or (and (fp.geq ~var_1_1~0 .cse3) (fp.leq ~var_1_1~0 .cse2)) (and (fp.leq ~var_1_1~0 .cse0) (fp.geq ~var_1_1~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-11-29 02:20:53,565 INFO L895 garLoopResultBuilder]: At program point L93-1(line 93) the Hoare annotation is: (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse0 (fp.neg .cse3)) (.cse1 (fp.neg .cse2))) (and (or (and (fp.leq ~var_1_7~0 .cse0) (fp.geq ~var_1_7~0 .cse1)) (and (fp.leq ~var_1_7~0 .cse2) (fp.geq ~var_1_7~0 .cse3))) (or (and (fp.geq ~var_1_1~0 .cse3) (fp.leq ~var_1_1~0 .cse2)) (and (fp.leq ~var_1_1~0 .cse0) (fp.geq ~var_1_1~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-11-29 02:20:53,566 INFO L899 garLoopResultBuilder]: For program point L85(line 85) no Hoare annotation was computed. [2023-11-29 02:20:53,566 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-29 02:20:53,566 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-29 02:20:53,566 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-11-29 02:20:53,567 INFO L899 garLoopResultBuilder]: For program point L69(line 69) no Hoare annotation was computed. [2023-11-29 02:20:53,567 INFO L899 garLoopResultBuilder]: For program point L94(lines 66 95) no Hoare annotation was computed. [2023-11-29 02:20:53,567 INFO L895 garLoopResultBuilder]: At program point L78(line 78) the Hoare annotation is: (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse0 (fp.neg .cse3)) (.cse1 (fp.neg .cse2))) (and (or (and (fp.leq ~var_1_7~0 .cse0) (fp.geq ~var_1_7~0 .cse1)) (and (fp.leq ~var_1_7~0 .cse2) (fp.geq ~var_1_7~0 .cse3))) (or (and (fp.geq ~var_1_1~0 .cse3) (fp.leq ~var_1_1~0 .cse2)) (and (fp.leq ~var_1_1~0 .cse0) (fp.geq ~var_1_1~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-11-29 02:20:53,568 INFO L895 garLoopResultBuilder]: At program point L78-1(line 78) the Hoare annotation is: (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse0 (fp.neg .cse3)) (.cse1 (fp.neg .cse2))) (and (or (and (fp.leq ~var_1_7~0 .cse0) (fp.geq ~var_1_7~0 .cse1)) (and (fp.leq ~var_1_7~0 .cse2) (fp.geq ~var_1_7~0 .cse3))) (or (and (fp.geq ~var_1_1~0 .cse3) (fp.leq ~var_1_1~0 .cse2)) (and (fp.leq ~var_1_1~0 .cse0) (fp.geq ~var_1_1~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-11-29 02:20:53,568 INFO L895 garLoopResultBuilder]: At program point L87(line 87) the Hoare annotation is: (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse0 (fp.neg .cse3)) (.cse1 (fp.neg .cse2))) (and (or (and (fp.leq ~var_1_7~0 .cse0) (fp.geq ~var_1_7~0 .cse1)) (and (fp.leq ~var_1_7~0 .cse2) (fp.geq ~var_1_7~0 .cse3))) (or (and (fp.geq ~var_1_1~0 .cse3) (fp.leq ~var_1_1~0 .cse2)) (and (fp.leq ~var_1_1~0 .cse0) (fp.geq ~var_1_1~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-11-29 02:20:53,569 INFO L895 garLoopResultBuilder]: At program point L87-1(line 87) the Hoare annotation is: (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse0 (fp.neg .cse3)) (.cse1 (fp.neg .cse2))) (and (or (and (fp.leq ~var_1_7~0 .cse0) (fp.geq ~var_1_7~0 .cse1)) (and (fp.leq ~var_1_7~0 .cse2) (fp.geq ~var_1_7~0 .cse3))) (or (and (fp.geq ~var_1_1~0 .cse3) (fp.leq ~var_1_1~0 .cse2)) (and (fp.leq ~var_1_1~0 .cse0) (fp.geq ~var_1_1~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-11-29 02:20:53,569 INFO L899 garLoopResultBuilder]: For program point L79(line 79) no Hoare annotation was computed. [2023-11-29 02:20:53,569 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 02:20:53,569 INFO L895 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse0 (fp.neg .cse3)) (.cse1 (fp.neg .cse2))) (and (or (and (fp.leq ~var_1_7~0 .cse0) (fp.geq ~var_1_7~0 .cse1)) (and (fp.leq ~var_1_7~0 .cse2) (fp.geq ~var_1_7~0 .cse3))) (or (and (fp.geq ~var_1_1~0 .cse3) (fp.leq ~var_1_1~0 .cse2)) (and (fp.leq ~var_1_1~0 .cse0) (fp.geq ~var_1_1~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-11-29 02:20:53,570 INFO L899 garLoopResultBuilder]: For program point L71-1(line 71) no Hoare annotation was computed. [2023-11-29 02:20:53,570 INFO L899 garLoopResultBuilder]: For program point L88(line 88) no Hoare annotation was computed. [2023-11-29 02:20:53,570 INFO L895 garLoopResultBuilder]: At program point L81(line 81) the Hoare annotation is: (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse0 (fp.neg .cse3)) (.cse1 (fp.neg .cse2))) (and (or (and (fp.leq ~var_1_7~0 .cse0) (fp.geq ~var_1_7~0 .cse1)) (and (fp.leq ~var_1_7~0 .cse2) (fp.geq ~var_1_7~0 .cse3))) (or (and (fp.geq ~var_1_1~0 .cse3) (fp.leq ~var_1_1~0 .cse2)) (and (fp.leq ~var_1_1~0 .cse0) (fp.geq ~var_1_1~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-11-29 02:20:53,571 INFO L895 garLoopResultBuilder]: At program point L81-1(line 81) the Hoare annotation is: (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse0 (fp.neg .cse3)) (.cse1 (fp.neg .cse2))) (and (or (and (fp.leq ~var_1_7~0 .cse0) (fp.geq ~var_1_7~0 .cse1)) (and (fp.leq ~var_1_7~0 .cse2) (fp.geq ~var_1_7~0 .cse3))) (or (and (fp.geq ~var_1_1~0 .cse3) (fp.leq ~var_1_1~0 .cse2)) (and (fp.leq ~var_1_1~0 .cse0) (fp.geq ~var_1_1~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-11-29 02:20:53,571 INFO L895 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse0 (fp.neg .cse3)) (.cse1 (fp.neg .cse2))) (and (or (and (fp.leq ~var_1_7~0 .cse0) (fp.geq ~var_1_7~0 .cse1)) (and (fp.leq ~var_1_7~0 .cse2) (fp.geq ~var_1_7~0 .cse3))) (or (and (fp.geq ~var_1_1~0 .cse3) (fp.leq ~var_1_1~0 .cse2)) (and (fp.leq ~var_1_1~0 .cse0) (fp.geq ~var_1_1~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-11-29 02:20:53,571 INFO L895 garLoopResultBuilder]: At program point L73-1(line 73) the Hoare annotation is: (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse0 (fp.neg .cse3)) (.cse1 (fp.neg .cse2))) (and (or (and (fp.leq ~var_1_7~0 .cse0) (fp.geq ~var_1_7~0 .cse1)) (and (fp.leq ~var_1_7~0 .cse2) (fp.geq ~var_1_7~0 .cse3))) (or (and (fp.geq ~var_1_1~0 .cse3) (fp.leq ~var_1_1~0 .cse2)) (and (fp.leq ~var_1_1~0 .cse0) (fp.geq ~var_1_1~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-11-29 02:20:53,572 INFO L895 garLoopResultBuilder]: At program point L90(line 90) the Hoare annotation is: (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse0 (fp.neg .cse3)) (.cse1 (fp.neg .cse2))) (and (or (and (fp.leq ~var_1_7~0 .cse0) (fp.geq ~var_1_7~0 .cse1)) (and (fp.leq ~var_1_7~0 .cse2) (fp.geq ~var_1_7~0 .cse3))) (or (and (fp.geq ~var_1_1~0 .cse3) (fp.leq ~var_1_1~0 .cse2)) (and (fp.leq ~var_1_1~0 .cse0) (fp.geq ~var_1_1~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-11-29 02:20:53,572 INFO L895 garLoopResultBuilder]: At program point L90-1(line 90) the Hoare annotation is: (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse0 (fp.neg .cse3)) (.cse1 (fp.neg .cse2))) (and (or (and (fp.leq ~var_1_7~0 .cse0) (fp.geq ~var_1_7~0 .cse1)) (and (fp.leq ~var_1_7~0 .cse2) (fp.geq ~var_1_7~0 .cse3))) (or (and (fp.geq ~var_1_1~0 .cse3) (fp.leq ~var_1_1~0 .cse2)) (and (fp.leq ~var_1_1~0 .cse0) (fp.geq ~var_1_1~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-11-29 02:20:53,572 INFO L899 garLoopResultBuilder]: For program point L57(lines 57 63) no Hoare annotation was computed. [2023-11-29 02:20:53,573 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-29 02:20:53,573 INFO L899 garLoopResultBuilder]: For program point L82(line 82) no Hoare annotation was computed. [2023-11-29 02:20:53,573 INFO L899 garLoopResultBuilder]: For program point L74(line 74) no Hoare annotation was computed. [2023-11-29 02:20:53,573 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 49) no Hoare annotation was computed. [2023-11-29 02:20:53,573 INFO L899 garLoopResultBuilder]: For program point L41-1(lines 40 65) no Hoare annotation was computed. [2023-11-29 02:20:53,574 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-29 02:20:53,574 INFO L899 garLoopResultBuilder]: For program point L91(line 91) no Hoare annotation was computed. [2023-11-29 02:20:53,574 INFO L899 garLoopResultBuilder]: For program point L58(lines 58 60) no Hoare annotation was computed. [2023-11-29 02:20:53,574 INFO L899 garLoopResultBuilder]: For program point L50(lines 40 65) no Hoare annotation was computed. [2023-11-29 02:20:53,574 INFO L899 garLoopResultBuilder]: For program point L42(lines 42 46) no Hoare annotation was computed. [2023-11-29 02:20:53,575 INFO L895 garLoopResultBuilder]: At program point L108-3(lines 108 114) the Hoare annotation is: (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse0 (fp.neg .cse3)) (.cse1 (fp.neg .cse2))) (and (or (and (fp.leq ~var_1_7~0 .cse0) (fp.geq ~var_1_7~0 .cse1)) (and (fp.leq ~var_1_7~0 .cse2) (fp.geq ~var_1_7~0 .cse3))) (or (and (fp.geq ~var_1_1~0 .cse3) (fp.leq ~var_1_1~0 .cse2)) (and (fp.leq ~var_1_1~0 .cse0) (fp.geq ~var_1_1~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-11-29 02:20:53,575 INFO L899 garLoopResultBuilder]: For program point L108-4(lines 108 114) no Hoare annotation was computed. [2023-11-29 02:20:53,575 INFO L895 garLoopResultBuilder]: At program point L84(line 84) the Hoare annotation is: (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse0 (fp.neg .cse3)) (.cse1 (fp.neg .cse2))) (and (or (and (fp.leq ~var_1_7~0 .cse0) (fp.geq ~var_1_7~0 .cse1)) (and (fp.leq ~var_1_7~0 .cse2) (fp.geq ~var_1_7~0 .cse3))) (or (and (fp.geq ~var_1_1~0 .cse3) (fp.leq ~var_1_1~0 .cse2)) (and (fp.leq ~var_1_1~0 .cse0) (fp.geq ~var_1_1~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-11-29 02:20:53,576 INFO L895 garLoopResultBuilder]: At program point L84-1(line 84) the Hoare annotation is: (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse0 (fp.neg .cse3)) (.cse1 (fp.neg .cse2))) (and (or (and (fp.leq ~var_1_7~0 .cse0) (fp.geq ~var_1_7~0 .cse1)) (and (fp.leq ~var_1_7~0 .cse2) (fp.geq ~var_1_7~0 .cse3))) (or (and (fp.geq ~var_1_1~0 .cse3) (fp.leq ~var_1_1~0 .cse2)) (and (fp.leq ~var_1_1~0 .cse0) (fp.geq ~var_1_1~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-11-29 02:20:53,576 INFO L899 garLoopResultBuilder]: For program point L51(lines 51 53) no Hoare annotation was computed. [2023-11-29 02:20:53,576 INFO L895 garLoopResultBuilder]: At program point L76(line 76) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.geq ~var_1_1~0 .cse0) (fp.leq ~var_1_1~0 .cse1)) (and (fp.leq ~var_1_1~0 (fp.neg .cse0)) (fp.geq ~var_1_1~0 (fp.neg .cse1))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-29 02:20:53,576 INFO L899 garLoopResultBuilder]: For program point L76-1(line 76) no Hoare annotation was computed. [2023-11-29 02:20:53,576 INFO L895 garLoopResultBuilder]: At program point L68(line 68) the Hoare annotation is: (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse0 (fp.neg .cse3)) (.cse1 (fp.neg .cse2))) (and (or (and (fp.leq ~var_1_7~0 .cse0) (fp.geq ~var_1_7~0 .cse1)) (and (fp.leq ~var_1_7~0 .cse2) (fp.geq ~var_1_7~0 .cse3))) (or (and (fp.geq ~var_1_1~0 .cse3) (fp.leq ~var_1_1~0 .cse2)) (and (fp.leq ~var_1_1~0 .cse0) (fp.geq ~var_1_1~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-11-29 02:20:53,576 INFO L895 garLoopResultBuilder]: At program point L68-1(line 68) the Hoare annotation is: (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse0 (fp.neg .cse3)) (.cse1 (fp.neg .cse2))) (and (or (and (fp.leq ~var_1_7~0 .cse0) (fp.geq ~var_1_7~0 .cse1)) (and (fp.leq ~var_1_7~0 .cse2) (fp.geq ~var_1_7~0 .cse3))) (or (and (fp.geq ~var_1_1~0 .cse3) (fp.leq ~var_1_1~0 .cse2)) (and (fp.leq ~var_1_1~0 .cse0) (fp.geq ~var_1_1~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-11-29 02:20:53,577 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-29 02:20:53,577 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-29 02:20:53,577 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-29 02:20:53,577 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-29 02:20:53,580 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-29 02:20:53,582 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 02:20:53,593 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-29 02:20:53,594 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-29 02:20:53,594 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-29 02:20:53,594 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-29 02:20:53,594 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-29 02:20:53,594 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-29 02:20:53,595 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-29 02:20:53,595 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-29 02:20:53,595 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-29 02:20:53,595 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 02:20:53 BoogieIcfgContainer [2023-11-29 02:20:53,596 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 02:20:53,596 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 02:20:53,596 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 02:20:53,596 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 02:20:53,597 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:18:22" (3/4) ... [2023-11-29 02:20:53,598 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 02:20:53,601 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-29 02:20:53,607 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2023-11-29 02:20:53,608 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2023-11-29 02:20:53,608 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-29 02:20:53,609 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 02:20:53,711 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca72760b-8ce2-4517-9828-e76bfd129180/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 02:20:53,712 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca72760b-8ce2-4517-9828-e76bfd129180/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 02:20:53,712 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 02:20:53,713 INFO L158 Benchmark]: Toolchain (without parser) took 163148.24ms. Allocated memory was 69.2MB in the beginning and 465.6MB in the end (delta: 396.4MB). Free memory was 45.3MB in the beginning and 276.7MB in the end (delta: -231.4MB). Peak memory consumption was 165.6MB. Max. memory is 16.1GB. [2023-11-29 02:20:53,713 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 69.2MB. Free memory is still 44.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 02:20:53,714 INFO L158 Benchmark]: CACSL2BoogieTranslator took 278.12ms. Allocated memory is still 69.2MB. Free memory was 45.1MB in the beginning and 32.3MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 02:20:53,714 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.66ms. Allocated memory is still 69.2MB. Free memory was 32.0MB in the beginning and 30.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 02:20:53,715 INFO L158 Benchmark]: Boogie Preprocessor took 50.65ms. Allocated memory is still 69.2MB. Free memory was 30.2MB in the beginning and 27.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 02:20:53,715 INFO L158 Benchmark]: RCFGBuilder took 11891.50ms. Allocated memory was 69.2MB in the beginning and 88.1MB in the end (delta: 18.9MB). Free memory was 27.4MB in the beginning and 48.7MB in the end (delta: -21.2MB). Peak memory consumption was 3.6MB. Max. memory is 16.1GB. [2023-11-29 02:20:53,716 INFO L158 Benchmark]: TraceAbstraction took 150758.86ms. Allocated memory was 88.1MB in the beginning and 465.6MB in the end (delta: 377.5MB). Free memory was 48.1MB in the beginning and 283.0MB in the end (delta: -234.9MB). Peak memory consumption was 143.1MB. Max. memory is 16.1GB. [2023-11-29 02:20:53,716 INFO L158 Benchmark]: Witness Printer took 116.40ms. Allocated memory is still 465.6MB. Free memory was 283.0MB in the beginning and 276.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-29 02:20:53,718 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.23ms. Allocated memory is still 69.2MB. Free memory is still 44.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 278.12ms. Allocated memory is still 69.2MB. Free memory was 45.1MB in the beginning and 32.3MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.66ms. Allocated memory is still 69.2MB. Free memory was 32.0MB in the beginning and 30.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.65ms. Allocated memory is still 69.2MB. Free memory was 30.2MB in the beginning and 27.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 11891.50ms. Allocated memory was 69.2MB in the beginning and 88.1MB in the end (delta: 18.9MB). Free memory was 27.4MB in the beginning and 48.7MB in the end (delta: -21.2MB). Peak memory consumption was 3.6MB. Max. memory is 16.1GB. * TraceAbstraction took 150758.86ms. Allocated memory was 88.1MB in the beginning and 465.6MB in the end (delta: 377.5MB). Free memory was 48.1MB in the beginning and 283.0MB in the end (delta: -234.9MB). Peak memory consumption was 143.1MB. Max. memory is 16.1GB. * Witness Printer took 116.40ms. Allocated memory is still 465.6MB. Free memory was 283.0MB in the beginning and 276.7MB 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.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated * 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, 47 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 150.7s, OverallIterations: 3, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 51.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 13.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 8 mSolverCounterUnknown, 133 SdHoareTripleChecker+Valid, 49.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 133 mSDsluCounter, 361 SdHoareTripleChecker+Invalid, 47.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 197 mSDsCounter, 127 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 183 IncrementalHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 127 mSolverCounterUnsat, 164 mSDtfsCounter, 183 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 547 GetRequests, 518 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 6.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=2, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 15 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 78 PreInvPairs, 103 NumberOfFragments, 1002 HoareAnnotationTreeSize, 78 FomulaSimplifications, 341 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 20 FomulaSimplificationsInter, 850 FormulaSimplificationTreeSizeReductionInter, 13.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 4.6s SatisfiabilityAnalysisTime, 80.2s InterpolantComputationTime, 325 NumberOfCodeBlocks, 325 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 537 ConstructedInterpolants, 0 QuantifiedInterpolants, 4167 SizeOfPredicates, 24 NumberOfNonLiveVariables, 550 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 2700/3060 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: 108]: Loop Invariant Derived loop invariant: null RESULT: Ultimate proved your program to be correct! [2023-11-29 02:20:53,931 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca72760b-8ce2-4517-9828-e76bfd129180/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-11-29 02:20:54,054 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca72760b-8ce2-4517-9828-e76bfd129180/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE