./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-48.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ebf243-0838-40e2-aa3d-fececde54484/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ebf243-0838-40e2-aa3d-fececde54484/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ebf243-0838-40e2-aa3d-fececde54484/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ebf243-0838-40e2-aa3d-fececde54484/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-48.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ebf243-0838-40e2-aa3d-fececde54484/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ebf243-0838-40e2-aa3d-fececde54484/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 6a0c9b70a7c594a87830ac5b654e0b63f6a113b2d10fec796a2f1b49d4b55982 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:59:00,648 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:59:00,750 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ebf243-0838-40e2-aa3d-fececde54484/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:59:00,755 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:59:00,756 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:59:00,795 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:59:00,796 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:59:00,797 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:59:00,798 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:59:00,798 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:59:00,799 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:59:00,800 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:59:00,801 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:59:00,801 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:59:00,802 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:59:00,803 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:59:00,803 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:59:00,804 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:59:00,804 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:59:00,805 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:59:00,805 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:59:00,806 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:59:00,807 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:59:00,807 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:59:00,808 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:59:00,808 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:59:00,808 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:59:00,809 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:59:00,809 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:59:00,810 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:59:00,810 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:59:00,811 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:59:00,811 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:59:00,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:59:00,812 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:59:00,812 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:59:00,812 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:59:00,812 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:59:00,813 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:59:00,813 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_b2ebf243-0838-40e2-aa3d-fececde54484/bin/uautomizer-verify-WvqO1wxjHP/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_b2ebf243-0838-40e2-aa3d-fececde54484/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 6a0c9b70a7c594a87830ac5b654e0b63f6a113b2d10fec796a2f1b49d4b55982 [2023-11-06 22:59:01,144 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:59:01,178 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:59:01,181 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:59:01,182 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:59:01,183 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:59:01,185 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ebf243-0838-40e2-aa3d-fececde54484/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-48.i [2023-11-06 22:59:04,397 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:59:04,624 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:59:04,625 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ebf243-0838-40e2-aa3d-fececde54484/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-48.i [2023-11-06 22:59:04,641 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ebf243-0838-40e2-aa3d-fececde54484/bin/uautomizer-verify-WvqO1wxjHP/data/d6ba98928/6f39b9fe0d954acbb86fa1356cb244e2/FLAG184b5656b [2023-11-06 22:59:04,660 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ebf243-0838-40e2-aa3d-fececde54484/bin/uautomizer-verify-WvqO1wxjHP/data/d6ba98928/6f39b9fe0d954acbb86fa1356cb244e2 [2023-11-06 22:59:04,668 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:59:04,672 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:59:04,674 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:59:04,674 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:59:04,680 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:59:04,683 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:59:04" (1/1) ... [2023-11-06 22:59:04,685 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5413ec50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:04, skipping insertion in model container [2023-11-06 22:59:04,685 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:59:04" (1/1) ... [2023-11-06 22:59:04,732 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:59:04,925 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_b2ebf243-0838-40e2-aa3d-fececde54484/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-48.i[913,926] [2023-11-06 22:59:04,972 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:59:04,984 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:59:05,009 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_b2ebf243-0838-40e2-aa3d-fececde54484/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-48.i[913,926] [2023-11-06 22:59:05,039 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:59:05,055 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:59:05,055 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:05 WrapperNode [2023-11-06 22:59:05,055 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:59:05,056 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:59:05,056 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:59:05,057 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:59:05,063 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:05" (1/1) ... [2023-11-06 22:59:05,072 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:05" (1/1) ... [2023-11-06 22:59:05,115 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 131 [2023-11-06 22:59:05,115 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:59:05,116 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:59:05,116 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:59:05,116 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:59:05,127 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:05" (1/1) ... [2023-11-06 22:59:05,127 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:05" (1/1) ... [2023-11-06 22:59:05,130 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:05" (1/1) ... [2023-11-06 22:59:05,131 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:05" (1/1) ... [2023-11-06 22:59:05,141 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:05" (1/1) ... [2023-11-06 22:59:05,155 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:05" (1/1) ... [2023-11-06 22:59:05,162 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:05" (1/1) ... [2023-11-06 22:59:05,164 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:05" (1/1) ... [2023-11-06 22:59:05,180 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:59:05,181 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:59:05,181 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:59:05,182 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:59:05,183 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:05" (1/1) ... [2023-11-06 22:59:05,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:59:05,208 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ebf243-0838-40e2-aa3d-fececde54484/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:59:05,223 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ebf243-0838-40e2-aa3d-fececde54484/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:59:05,240 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ebf243-0838-40e2-aa3d-fececde54484/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:59:05,264 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:59:05,265 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:59:05,265 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:59:05,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:59:05,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:59:05,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:59:05,396 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:59:05,402 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:59:05,816 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:59:05,823 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:59:05,824 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:59:05,826 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:59:05 BoogieIcfgContainer [2023-11-06 22:59:05,826 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:59:05,829 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:59:05,829 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:59:05,832 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:59:05,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:59:04" (1/3) ... [2023-11-06 22:59:05,834 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@871a890 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:59:05, skipping insertion in model container [2023-11-06 22:59:05,834 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:05" (2/3) ... [2023-11-06 22:59:05,834 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@871a890 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:59:05, skipping insertion in model container [2023-11-06 22:59:05,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:59:05" (3/3) ... [2023-11-06 22:59:05,837 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-48.i [2023-11-06 22:59:05,856 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:59:05,857 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:59:05,904 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:59:05,911 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=LoopsAndPotentialCycles, 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;@5d40e0af, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:59:05,911 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:59:05,916 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 36 states have internal predecessors, (45), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-06 22:59:05,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-11-06 22:59:05,933 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:59:05,934 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 22:59:05,934 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:59:05,940 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:59:05,940 INFO L85 PathProgramCache]: Analyzing trace with hash -626773759, now seen corresponding path program 1 times [2023-11-06 22:59:05,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:59:05,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001162896] [2023-11-06 22:59:05,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:59:05,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:59:06,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:06,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:59:06,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:06,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:59:06,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:06,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:59:06,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:06,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:59:06,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:06,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:59:06,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:06,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:59:06,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:06,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-06 22:59:06,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:06,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-06 22:59:06,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:06,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-06 22:59:06,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:06,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-06 22:59:06,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:06,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:59:06,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:06,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:59:06,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:06,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-06 22:59:06,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:06,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-06 22:59:06,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:06,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-06 22:59:06,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:06,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-06 22:59:06,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:06,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:59:06,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:06,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:59:06,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:06,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-06 22:59:06,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:06,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-06 22:59:06,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:06,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-06 22:59:06,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:06,502 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-11-06 22:59:06,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:59:06,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001162896] [2023-11-06 22:59:06,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001162896] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:59:06,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:59:06,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:59:06,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873676288] [2023-11-06 22:59:06,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:59:06,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:59:06,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:59:06,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:59:06,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:59:06,556 INFO L87 Difference]: Start difference. First operand has 59 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 36 states have internal predecessors, (45), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-06 22:59:06,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:59:06,588 INFO L93 Difference]: Finished difference Result 111 states and 189 transitions. [2023-11-06 22:59:06,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:59:06,591 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 131 [2023-11-06 22:59:06,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:59:06,599 INFO L225 Difference]: With dead ends: 111 [2023-11-06 22:59:06,599 INFO L226 Difference]: Without dead ends: 55 [2023-11-06 22:59:06,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 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-06 22:59:06,607 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:59:06,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:59:06,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-11-06 22:59:06,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2023-11-06 22:59:06,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-06 22:59:06,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 79 transitions. [2023-11-06 22:59:06,669 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 79 transitions. Word has length 131 [2023-11-06 22:59:06,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:59:06,670 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 79 transitions. [2023-11-06 22:59:06,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-06 22:59:06,670 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 79 transitions. [2023-11-06 22:59:06,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-11-06 22:59:06,678 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:59:06,678 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 22:59:06,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:59:06,680 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:59:06,681 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:59:06,681 INFO L85 PathProgramCache]: Analyzing trace with hash 2128434103, now seen corresponding path program 1 times [2023-11-06 22:59:06,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:59:06,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663156025] [2023-11-06 22:59:06,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:59:06,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:59:06,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:07,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:59:07,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:07,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:59:07,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:07,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:59:07,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:07,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:59:07,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:07,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:59:07,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:07,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:59:07,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:07,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-06 22:59:07,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:07,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-06 22:59:07,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:07,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-06 22:59:07,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:07,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-06 22:59:07,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:07,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:59:07,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:07,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:59:07,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:07,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-06 22:59:07,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:07,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-06 22:59:07,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:07,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-06 22:59:07,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:07,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-06 22:59:07,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:07,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:59:07,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:07,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:59:07,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:07,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-06 22:59:07,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:07,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-06 22:59:07,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:07,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-06 22:59:07,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:07,346 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-11-06 22:59:07,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:59:07,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663156025] [2023-11-06 22:59:07,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663156025] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:59:07,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:59:07,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:59:07,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880007280] [2023-11-06 22:59:07,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:59:07,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:59:07,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:59:07,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:59:07,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:59:07,353 INFO L87 Difference]: Start difference. First operand 55 states and 79 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-06 22:59:07,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:59:07,432 INFO L93 Difference]: Finished difference Result 107 states and 155 transitions. [2023-11-06 22:59:07,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:59:07,433 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 131 [2023-11-06 22:59:07,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:59:07,435 INFO L225 Difference]: With dead ends: 107 [2023-11-06 22:59:07,436 INFO L226 Difference]: Without dead ends: 55 [2023-11-06 22:59:07,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:59:07,439 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 4 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:59:07,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 144 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:59:07,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-11-06 22:59:07,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2023-11-06 22:59:07,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-06 22:59:07,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 78 transitions. [2023-11-06 22:59:07,478 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 78 transitions. Word has length 131 [2023-11-06 22:59:07,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:59:07,480 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 78 transitions. [2023-11-06 22:59:07,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-06 22:59:07,480 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 78 transitions. [2023-11-06 22:59:07,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-11-06 22:59:07,484 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:59:07,484 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 22:59:07,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:59:07,485 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:59:07,485 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:59:07,485 INFO L85 PathProgramCache]: Analyzing trace with hash -2109274891, now seen corresponding path program 1 times [2023-11-06 22:59:07,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:59:07,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058170174] [2023-11-06 22:59:07,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:59:07,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:59:07,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:59:07,586 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:59:07,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:59:07,708 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:59:07,708 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:59:07,709 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:59:07,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:59:07,715 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-06 22:59:07,719 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:59:07,851 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:59:07 BoogieIcfgContainer [2023-11-06 22:59:07,851 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:59:07,852 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:59:07,852 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:59:07,853 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:59:07,853 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:59:05" (3/4) ... [2023-11-06 22:59:07,855 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:59:07,856 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:59:07,859 INFO L158 Benchmark]: Toolchain (without parser) took 3185.74ms. Allocated memory was 174.1MB in the beginning and 211.8MB in the end (delta: 37.7MB). Free memory was 126.9MB in the beginning and 148.3MB in the end (delta: -21.4MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2023-11-06 22:59:07,859 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 117.4MB. Free memory is still 67.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:59:07,860 INFO L158 Benchmark]: CACSL2BoogieTranslator took 381.99ms. Allocated memory is still 174.1MB. Free memory was 126.3MB in the beginning and 113.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-06 22:59:07,861 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.95ms. Allocated memory is still 174.1MB. Free memory was 113.7MB in the beginning and 110.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:59:07,861 INFO L158 Benchmark]: Boogie Preprocessor took 64.51ms. Allocated memory is still 174.1MB. Free memory was 110.7MB in the beginning and 109.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:59:07,862 INFO L158 Benchmark]: RCFGBuilder took 645.08ms. Allocated memory is still 174.1MB. Free memory was 109.0MB in the beginning and 91.2MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-06 22:59:07,862 INFO L158 Benchmark]: TraceAbstraction took 2022.90ms. Allocated memory was 174.1MB in the beginning and 211.8MB in the end (delta: 37.7MB). Free memory was 90.6MB in the beginning and 148.3MB in the end (delta: -57.7MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:59:07,863 INFO L158 Benchmark]: Witness Printer took 4.47ms. Allocated memory is still 211.8MB. Free memory is still 148.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:59:07,866 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.34ms. Allocated memory is still 117.4MB. Free memory is still 67.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 381.99ms. Allocated memory is still 174.1MB. Free memory was 126.3MB in the beginning and 113.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.95ms. Allocated memory is still 174.1MB. Free memory was 113.7MB in the beginning and 110.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.51ms. Allocated memory is still 174.1MB. Free memory was 110.7MB in the beginning and 109.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 645.08ms. Allocated memory is still 174.1MB. Free memory was 109.0MB in the beginning and 91.2MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2022.90ms. Allocated memory was 174.1MB in the beginning and 211.8MB in the end (delta: 37.7MB). Free memory was 90.6MB in the beginning and 148.3MB in the end (delta: -57.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.47ms. Allocated memory is still 211.8MB. Free memory is still 148.3MB. 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 someBinaryFLOATComparisonOperation at line 111. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 32.8; [L23] float var_1_2 = 255.675; [L24] float var_1_3 = 5.5; [L25] float var_1_4 = 128.75; [L26] float var_1_5 = 4.5; [L27] float var_1_6 = 9.25; [L28] unsigned char var_1_7 = 5; [L29] unsigned char var_1_11 = 200; [L30] unsigned char var_1_12 = 8; [L31] unsigned char var_1_13 = 4; [L32] unsigned char var_1_14 = 100; [L33] unsigned char var_1_15 = 64; [L34] unsigned char var_1_16 = 1; [L35] unsigned char var_1_17 = 200; [L36] unsigned char var_1_18 = 2; [L37] unsigned char var_1_19 = 0; [L38] unsigned long int var_1_20 = 1; [L39] signed long int var_1_21 = 64; [L40] unsigned char var_1_22 = 100; [L41] unsigned char last_1_var_1_7 = 5; VAL [isInitial=0, last_1_var_1_7=5, var_1_11=200, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_2=10227/40, var_1_3=11/2, var_1_4=515/4, var_1_5=9/2, var_1_6=37/4, var_1_7=5] [L115] isInitial = 1 [L116] FCALL initially() [L117] COND TRUE 1 [L118] CALL updateLastVariables() [L108] last_1_var_1_7 = var_1_7 VAL [isInitial=1, last_1_var_1_7=5, var_1_11=200, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_2=10227/40, var_1_3=11/2, var_1_4=515/4, var_1_5=9/2, var_1_6=37/4, var_1_7=5] [L118] RET updateLastVariables() [L119] CALL updateVariables() [L72] var_1_2 = __VERIFIER_nondet_float() [L73] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=200, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_3=11/2, var_1_4=515/4, var_1_5=9/2, var_1_6=37/4, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=5, var_1_11=200, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_3=11/2, var_1_4=515/4, var_1_5=9/2, var_1_6=37/4, var_1_7=5] [L73] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=200, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_3=11/2, var_1_4=515/4, var_1_5=9/2, var_1_6=37/4, var_1_7=5] [L74] var_1_3 = __VERIFIER_nondet_float() [L75] 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_7=5, var_1_11=200, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_3=519, var_1_4=515/4, var_1_5=9/2, var_1_6=37/4, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=5, var_1_11=200, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_3=519, var_1_4=515/4, var_1_5=9/2, var_1_6=37/4, var_1_7=5] [L75] 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_7=5, var_1_11=200, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_3=519, var_1_4=515/4, var_1_5=9/2, var_1_6=37/4, var_1_7=5] [L76] var_1_4 = __VERIFIER_nondet_float() [L77] CALL assume_abort_if_not((var_1_4 >= 0.0F && 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_7=5, var_1_11=200, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_3=519, var_1_4=518, var_1_5=9/2, var_1_6=37/4, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=5, var_1_11=200, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_3=519, var_1_4=518, var_1_5=9/2, var_1_6=37/4, var_1_7=5] [L77] RET assume_abort_if_not((var_1_4 >= 0.0F && 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_7=5, var_1_11=200, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_3=519, var_1_4=518, var_1_5=9/2, var_1_6=37/4, var_1_7=5] [L78] var_1_5 = __VERIFIER_nondet_float() [L79] CALL assume_abort_if_not((var_1_5 >= 0.0F && 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_7=5, var_1_11=200, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_3=519, var_1_4=518, var_1_5=520, var_1_6=37/4, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=5, var_1_11=200, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_3=519, var_1_4=518, var_1_5=520, var_1_6=37/4, var_1_7=5] [L79] RET assume_abort_if_not((var_1_5 >= 0.0F && 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_7=5, var_1_11=200, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_3=519, var_1_4=518, var_1_5=520, var_1_6=37/4, var_1_7=5] [L80] var_1_6 = __VERIFIER_nondet_float() [L81] CALL assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=200, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_3=519, var_1_4=518, var_1_5=520, var_1_6=517, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=5, var_1_11=200, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_3=519, var_1_4=518, var_1_5=520, var_1_6=517, var_1_7=5] [L81] RET assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=200, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_3=519, var_1_4=518, var_1_5=520, var_1_6=517, var_1_7=5] [L82] var_1_11 = __VERIFIER_nondet_uchar() [L83] CALL assume_abort_if_not(var_1_11 >= 190) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=254, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_3=519, var_1_4=518, var_1_5=520, var_1_6=517, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=5, var_1_11=254, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_3=519, var_1_4=518, var_1_5=520, var_1_6=517, var_1_7=5] [L83] RET assume_abort_if_not(var_1_11 >= 190) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=254, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_3=519, var_1_4=518, var_1_5=520, var_1_6=517, var_1_7=5] [L84] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=254, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_3=519, var_1_4=518, var_1_5=520, var_1_6=517, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=5, var_1_11=254, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_3=519, var_1_4=518, var_1_5=520, var_1_6=517, var_1_7=5] [L84] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=254, var_1_12=8, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_3=519, var_1_4=518, var_1_5=520, var_1_6=517, var_1_7=5] [L85] var_1_12 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=254, var_1_12=0, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_3=519, var_1_4=518, var_1_5=520, var_1_6=517, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=5, var_1_11=254, var_1_12=0, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_3=519, var_1_4=518, var_1_5=520, var_1_6=517, var_1_7=5] [L86] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=254, var_1_12=0, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_3=519, var_1_4=518, var_1_5=520, var_1_6=517, var_1_7=5] [L87] CALL assume_abort_if_not(var_1_12 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=254, var_1_12=0, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_3=519, var_1_4=518, var_1_5=520, var_1_6=517, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=5, var_1_11=254, var_1_12=0, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_3=519, var_1_4=518, var_1_5=520, var_1_6=517, var_1_7=5] [L87] RET assume_abort_if_not(var_1_12 <= 63) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=254, var_1_12=0, var_1_13=4, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_3=519, var_1_4=518, var_1_5=520, var_1_6=517, var_1_7=5] [L88] var_1_13 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=254, var_1_12=0, var_1_13=127, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_3=519, var_1_4=518, var_1_5=520, var_1_6=517, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=5, var_1_11=254, var_1_12=0, var_1_13=127, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_3=519, var_1_4=518, var_1_5=520, var_1_6=517, var_1_7=5] [L89] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=254, var_1_12=0, var_1_13=127, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_3=519, var_1_4=518, var_1_5=520, var_1_6=517, var_1_7=5] [L90] CALL assume_abort_if_not(var_1_13 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=254, var_1_12=0, var_1_13=127, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_3=519, var_1_4=518, var_1_5=520, var_1_6=517, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=5, var_1_11=254, var_1_12=0, var_1_13=127, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_3=519, var_1_4=518, var_1_5=520, var_1_6=517, var_1_7=5] [L90] RET assume_abort_if_not(var_1_13 <= 127) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=254, var_1_12=0, var_1_13=127, var_1_14=100, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_3=519, var_1_4=518, var_1_5=520, var_1_6=517, var_1_7=5] [L91] var_1_14 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_14 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=254, var_1_12=0, var_1_13=127, var_1_14=63, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_3=519, var_1_4=518, var_1_5=520, var_1_6=517, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=5, var_1_11=254, var_1_12=0, var_1_13=127, var_1_14=63, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_3=519, var_1_4=518, var_1_5=520, var_1_6=517, var_1_7=5] [L92] RET assume_abort_if_not(var_1_14 >= 63) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=254, var_1_12=0, var_1_13=127, var_1_14=63, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_3=519, var_1_4=518, var_1_5=520, var_1_6=517, var_1_7=5] [L93] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=254, var_1_12=0, var_1_13=127, var_1_14=63, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_3=519, var_1_4=518, var_1_5=520, var_1_6=517, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=5, var_1_11=254, var_1_12=0, var_1_13=127, var_1_14=63, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_3=519, var_1_4=518, var_1_5=520, var_1_6=517, var_1_7=5] [L93] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=254, var_1_12=0, var_1_13=127, var_1_14=63, var_1_15=64, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_3=519, var_1_4=518, var_1_5=520, var_1_6=517, var_1_7=5] [L94] var_1_15 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_15 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=254, var_1_12=0, var_1_13=127, var_1_14=63, var_1_15=63, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_3=519, var_1_4=518, var_1_5=520, var_1_6=517, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=5, var_1_11=254, var_1_12=0, var_1_13=127, var_1_14=63, var_1_15=63, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_3=519, var_1_4=518, var_1_5=520, var_1_6=517, var_1_7=5] [L95] RET assume_abort_if_not(var_1_15 >= 63) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=254, var_1_12=0, var_1_13=127, var_1_14=63, var_1_15=63, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_3=519, var_1_4=518, var_1_5=520, var_1_6=517, var_1_7=5] [L96] CALL assume_abort_if_not(var_1_15 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=254, var_1_12=0, var_1_13=127, var_1_14=63, var_1_15=63, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_3=519, var_1_4=518, var_1_5=520, var_1_6=517, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=5, var_1_11=254, var_1_12=0, var_1_13=127, var_1_14=63, var_1_15=63, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_3=519, var_1_4=518, var_1_5=520, var_1_6=517, var_1_7=5] [L96] RET assume_abort_if_not(var_1_15 <= 127) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=254, var_1_12=0, var_1_13=127, var_1_14=63, var_1_15=63, var_1_16=1, var_1_17=200, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_3=519, var_1_4=518, var_1_5=520, var_1_6=517, var_1_7=5] [L97] var_1_17 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_17 >= 191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=254, var_1_12=0, var_1_13=127, var_1_14=63, var_1_15=63, var_1_16=1, var_1_17=191, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_3=519, var_1_4=518, var_1_5=520, var_1_6=517, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=5, var_1_11=254, var_1_12=0, var_1_13=127, var_1_14=63, var_1_15=63, var_1_16=1, var_1_17=191, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_3=519, var_1_4=518, var_1_5=520, var_1_6=517, var_1_7=5] [L98] RET assume_abort_if_not(var_1_17 >= 191) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=254, var_1_12=0, var_1_13=127, var_1_14=63, var_1_15=63, var_1_16=1, var_1_17=191, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_3=519, var_1_4=518, var_1_5=520, var_1_6=517, var_1_7=5] [L99] CALL assume_abort_if_not(var_1_17 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=254, var_1_12=0, var_1_13=127, var_1_14=63, var_1_15=63, var_1_16=1, var_1_17=191, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_3=519, var_1_4=518, var_1_5=520, var_1_6=517, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=5, var_1_11=254, var_1_12=0, var_1_13=127, var_1_14=63, var_1_15=63, var_1_16=1, var_1_17=191, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_3=519, var_1_4=518, var_1_5=520, var_1_6=517, var_1_7=5] [L99] RET assume_abort_if_not(var_1_17 <= 255) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=254, var_1_12=0, var_1_13=127, var_1_14=63, var_1_15=63, var_1_16=1, var_1_17=191, var_1_18=2, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_3=519, var_1_4=518, var_1_5=520, var_1_6=517, var_1_7=5] [L100] var_1_18 = __VERIFIER_nondet_uchar() [L101] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=254, var_1_12=0, var_1_13=127, var_1_14=63, var_1_15=63, var_1_16=1, var_1_17=191, var_1_18=0, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_3=519, var_1_4=518, var_1_5=520, var_1_6=517, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=5, var_1_11=254, var_1_12=0, var_1_13=127, var_1_14=63, var_1_15=63, var_1_16=1, var_1_17=191, var_1_18=0, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_3=519, var_1_4=518, var_1_5=520, var_1_6=517, var_1_7=5] [L101] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=254, var_1_12=0, var_1_13=127, var_1_14=63, var_1_15=63, var_1_16=1, var_1_17=191, var_1_18=0, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_3=519, var_1_4=518, var_1_5=520, var_1_6=517, var_1_7=5] [L102] CALL assume_abort_if_not(var_1_18 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=254, var_1_12=0, var_1_13=127, var_1_14=63, var_1_15=63, var_1_16=1, var_1_17=191, var_1_18=0, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_3=519, var_1_4=518, var_1_5=520, var_1_6=517, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=5, var_1_11=254, var_1_12=0, var_1_13=127, var_1_14=63, var_1_15=63, var_1_16=1, var_1_17=191, var_1_18=0, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_3=519, var_1_4=518, var_1_5=520, var_1_6=517, var_1_7=5] [L102] RET assume_abort_if_not(var_1_18 <= 63) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=254, var_1_12=0, var_1_13=127, var_1_14=63, var_1_15=63, var_1_16=1, var_1_17=191, var_1_18=0, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_3=519, var_1_4=518, var_1_5=520, var_1_6=517, var_1_7=5] [L103] var_1_19 = __VERIFIER_nondet_uchar() [L104] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=254, var_1_12=0, var_1_13=127, var_1_14=63, var_1_15=63, var_1_16=1, var_1_17=191, var_1_18=0, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_3=519, var_1_4=518, var_1_5=520, var_1_6=517, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=5, var_1_11=254, var_1_12=0, var_1_13=127, var_1_14=63, var_1_15=63, var_1_16=1, var_1_17=191, var_1_18=0, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_3=519, var_1_4=518, var_1_5=520, var_1_6=517, var_1_7=5] [L104] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=254, var_1_12=0, var_1_13=127, var_1_14=63, var_1_15=63, var_1_16=1, var_1_17=191, var_1_18=0, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_3=519, var_1_4=518, var_1_5=520, var_1_6=517, var_1_7=5] [L105] CALL assume_abort_if_not(var_1_19 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11=254, var_1_12=0, var_1_13=127, var_1_14=63, var_1_15=63, var_1_16=1, var_1_17=191, var_1_18=0, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_3=519, var_1_4=518, var_1_5=520, var_1_6=517, var_1_7=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=5, var_1_11=254, var_1_12=0, var_1_13=127, var_1_14=63, var_1_15=63, var_1_16=1, var_1_17=191, var_1_18=0, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_3=519, var_1_4=518, var_1_5=520, var_1_6=517, var_1_7=5] [L105] RET assume_abort_if_not(var_1_19 <= 0) VAL [isInitial=1, last_1_var_1_7=5, var_1_11=254, var_1_12=0, var_1_13=127, var_1_14=63, var_1_15=63, var_1_16=1, var_1_17=191, var_1_18=0, var_1_19=0, var_1_1=164/5, var_1_20=1, var_1_21=64, var_1_22=100, var_1_3=519, var_1_4=518, var_1_5=520, var_1_6=517, var_1_7=5] [L119] RET updateVariables() [L120] CALL step() [L45] COND FALSE !(var_1_2 <= var_1_3) [L52] var_1_1 = var_1_6 VAL [isInitial=1, last_1_var_1_7=5, var_1_11=254, var_1_12=0, var_1_13=127, var_1_14=63, var_1_15=63, var_1_16=1, var_1_17=191, var_1_18=0, var_1_19=0, var_1_1=517, var_1_20=1, var_1_21=64, var_1_22=100, var_1_3=519, var_1_4=518, var_1_5=520, var_1_6=517, var_1_7=5] [L54] var_1_20 = var_1_14 [L55] var_1_21 = var_1_17 [L56] var_1_22 = 4 [L57] signed long int stepLocal_0 = var_1_21; VAL [isInitial=1, last_1_var_1_7=5, stepLocal_0=191, var_1_11=254, var_1_12=0, var_1_13=127, var_1_14=63, var_1_15=63, var_1_16=1, var_1_17=191, var_1_18=0, var_1_19=0, var_1_1=517, var_1_20=63, var_1_21=191, var_1_22=4, var_1_3=519, var_1_4=518, var_1_5=520, var_1_6=517, var_1_7=5] [L58] COND FALSE !(((var_1_17 - var_1_12) - (8 + var_1_18)) > stepLocal_0) [L61] var_1_16 = var_1_19 VAL [isInitial=1, last_1_var_1_7=5, stepLocal_0=191, var_1_11=254, var_1_12=0, var_1_13=127, var_1_14=63, var_1_15=63, var_1_16=0, var_1_17=191, var_1_18=0, var_1_19=0, var_1_1=517, var_1_20=63, var_1_21=191, var_1_22=4, var_1_3=519, var_1_4=518, var_1_5=520, var_1_6=517, var_1_7=5] [L63] COND FALSE !(\read(var_1_16)) VAL [isInitial=1, last_1_var_1_7=5, stepLocal_0=191, var_1_11=254, var_1_12=0, var_1_13=127, var_1_14=63, var_1_15=63, var_1_16=0, var_1_17=191, var_1_18=0, var_1_19=0, var_1_1=517, var_1_20=63, var_1_21=191, var_1_22=4, var_1_3=519, var_1_4=518, var_1_5=520, var_1_6=517, var_1_7=5] [L120] RET step() [L121] CALL, EXPR property() [L111-L112] return ((((((var_1_2 <= var_1_3) ? ((var_1_3 < ((var_1_4 - var_1_5) + 1.395f)) ? (var_1_1 == ((float) var_1_6)) : (var_1_1 == ((float) var_1_6))) : (var_1_1 == ((float) var_1_6))) && (var_1_16 ? ((last_1_var_1_7 != last_1_var_1_7) ? (var_1_7 == ((unsigned char) ((var_1_11 - var_1_12) - var_1_13))) : (var_1_7 == ((unsigned char) (var_1_11 - (((((var_1_14) > (var_1_15)) ? (var_1_14) : (var_1_15))) - var_1_12))))) : 1)) && ((((var_1_17 - var_1_12) - (8 + var_1_18)) > var_1_21) ? (var_1_16 == ((unsigned char) (! var_1_19))) : (var_1_16 == ((unsigned char) var_1_19)))) && (var_1_20 == ((unsigned long int) var_1_14))) && (var_1_21 == ((signed long int) var_1_17))) && (var_1_22 == ((unsigned char) 4)) ; VAL [\result=0, isInitial=1, last_1_var_1_7=5, var_1_11=254, var_1_12=0, var_1_13=127, var_1_14=63, var_1_15=63, var_1_16=0, var_1_17=191, var_1_18=0, var_1_19=0, var_1_1=517, var_1_20=63, var_1_21=191, var_1_22=4, var_1_3=519, var_1_4=518, var_1_5=520, var_1_6=517, var_1_7=5] [L121] RET, EXPR property() [L121] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_7=5, var_1_11=254, var_1_12=0, var_1_13=127, var_1_14=63, var_1_15=63, var_1_16=0, var_1_17=191, var_1_18=0, var_1_19=0, var_1_1=517, var_1_20=63, var_1_21=191, var_1_22=4, var_1_3=519, var_1_4=518, var_1_5=520, var_1_6=517, var_1_7=5] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_7=5, var_1_11=254, var_1_12=0, var_1_13=127, var_1_14=63, var_1_15=63, var_1_16=0, var_1_17=191, var_1_18=0, var_1_19=0, var_1_1=517, var_1_20=63, var_1_21=191, var_1_22=4, var_1_3=519, var_1_4=518, var_1_5=520, var_1_6=517, var_1_7=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 59 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 3, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4 mSDsluCounter, 223 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 68 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7 IncrementalHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 155 mSDtfsCounter, 7 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 113 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 393 NumberOfCodeBlocks, 393 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 260 ConstructedInterpolants, 0 QuantifiedInterpolants, 272 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 1680/1680 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-06 22:59:07,889 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ebf243-0838-40e2-aa3d-fececde54484/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ebf243-0838-40e2-aa3d-fececde54484/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ebf243-0838-40e2-aa3d-fececde54484/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ebf243-0838-40e2-aa3d-fececde54484/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ebf243-0838-40e2-aa3d-fececde54484/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-48.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ebf243-0838-40e2-aa3d-fececde54484/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ebf243-0838-40e2-aa3d-fececde54484/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 6a0c9b70a7c594a87830ac5b654e0b63f6a113b2d10fec796a2f1b49d4b55982 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:59:10,511 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:59:10,633 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ebf243-0838-40e2-aa3d-fececde54484/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-06 22:59:10,641 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:59:10,641 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:59:10,688 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:59:10,689 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:59:10,689 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:59:10,690 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:59:10,691 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:59:10,691 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:59:10,692 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:59:10,692 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:59:10,693 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:59:10,694 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:59:10,694 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:59:10,694 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:59:10,695 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:59:10,695 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:59:10,696 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:59:10,696 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:59:10,697 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:59:10,698 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 22:59:10,698 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 22:59:10,699 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:59:10,699 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:59:10,700 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:59:10,700 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:59:10,701 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:59:10,701 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:59:10,703 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:59:10,703 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:59:10,703 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:59:10,704 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:59:10,704 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 22:59:10,705 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 22:59:10,705 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:59:10,705 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:59:10,705 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:59:10,707 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:59:10,707 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 22:59:10,707 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:59:10,708 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_b2ebf243-0838-40e2-aa3d-fececde54484/bin/uautomizer-verify-WvqO1wxjHP/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_b2ebf243-0838-40e2-aa3d-fececde54484/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 6a0c9b70a7c594a87830ac5b654e0b63f6a113b2d10fec796a2f1b49d4b55982 [2023-11-06 22:59:11,106 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:59:11,135 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:59:11,138 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:59:11,139 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:59:11,139 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:59:11,141 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ebf243-0838-40e2-aa3d-fececde54484/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-48.i [2023-11-06 22:59:14,341 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:59:14,657 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:59:14,657 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ebf243-0838-40e2-aa3d-fececde54484/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-48.i [2023-11-06 22:59:14,668 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ebf243-0838-40e2-aa3d-fececde54484/bin/uautomizer-verify-WvqO1wxjHP/data/8d3f601a1/d5ac1420269340a1b7ed2c9a0b90dec6/FLAGe6ca028f3 [2023-11-06 22:59:14,685 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ebf243-0838-40e2-aa3d-fececde54484/bin/uautomizer-verify-WvqO1wxjHP/data/8d3f601a1/d5ac1420269340a1b7ed2c9a0b90dec6 [2023-11-06 22:59:14,688 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:59:14,690 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:59:14,691 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:59:14,691 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:59:14,697 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:59:14,698 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:59:14" (1/1) ... [2023-11-06 22:59:14,699 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fd7a2ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:14, skipping insertion in model container [2023-11-06 22:59:14,699 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:59:14" (1/1) ... [2023-11-06 22:59:14,729 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:59:14,887 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_b2ebf243-0838-40e2-aa3d-fececde54484/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-48.i[913,926] [2023-11-06 22:59:14,959 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:59:14,977 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:59:14,990 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_b2ebf243-0838-40e2-aa3d-fececde54484/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-48.i[913,926] [2023-11-06 22:59:15,015 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:59:15,035 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:59:15,036 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:15 WrapperNode [2023-11-06 22:59:15,036 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:59:15,037 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:59:15,038 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:59:15,038 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:59:15,046 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:15" (1/1) ... [2023-11-06 22:59:15,069 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:15" (1/1) ... [2023-11-06 22:59:15,142 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 131 [2023-11-06 22:59:15,142 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:59:15,143 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:59:15,144 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:59:15,144 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:59:15,154 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:15" (1/1) ... [2023-11-06 22:59:15,154 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:15" (1/1) ... [2023-11-06 22:59:15,160 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:15" (1/1) ... [2023-11-06 22:59:15,160 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:15" (1/1) ... [2023-11-06 22:59:15,172 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:15" (1/1) ... [2023-11-06 22:59:15,176 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:15" (1/1) ... [2023-11-06 22:59:15,179 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:15" (1/1) ... [2023-11-06 22:59:15,181 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:15" (1/1) ... [2023-11-06 22:59:15,186 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:59:15,187 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:59:15,187 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:59:15,187 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:59:15,188 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:15" (1/1) ... [2023-11-06 22:59:15,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:59:15,212 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ebf243-0838-40e2-aa3d-fececde54484/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:59:15,228 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ebf243-0838-40e2-aa3d-fececde54484/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:59:15,245 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ebf243-0838-40e2-aa3d-fececde54484/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:59:15,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:59:15,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 22:59:15,274 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:59:15,274 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:59:15,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:59:15,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:59:15,413 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:59:15,416 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:59:16,797 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:59:16,806 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:59:16,807 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:59:16,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:59:16 BoogieIcfgContainer [2023-11-06 22:59:16,809 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:59:16,812 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:59:16,813 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:59:16,823 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:59:16,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:59:14" (1/3) ... [2023-11-06 22:59:16,824 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21abef72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:59:16, skipping insertion in model container [2023-11-06 22:59:16,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:15" (2/3) ... [2023-11-06 22:59:16,826 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21abef72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:59:16, skipping insertion in model container [2023-11-06 22:59:16,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:59:16" (3/3) ... [2023-11-06 22:59:16,829 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-48.i [2023-11-06 22:59:16,846 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:59:16,846 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:59:16,908 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:59:16,916 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=LoopsAndPotentialCycles, 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;@5562b937, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:59:16,916 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:59:16,921 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 36 states have internal predecessors, (45), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-06 22:59:16,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-11-06 22:59:16,940 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:59:16,941 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 22:59:16,942 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:59:16,953 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:59:16,953 INFO L85 PathProgramCache]: Analyzing trace with hash -626773759, now seen corresponding path program 1 times [2023-11-06 22:59:16,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:59:16,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1870093814] [2023-11-06 22:59:16,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:59:16,977 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-06 22:59:16,977 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ebf243-0838-40e2-aa3d-fececde54484/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:59:16,983 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ebf243-0838-40e2-aa3d-fececde54484/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:59:17,013 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ebf243-0838-40e2-aa3d-fececde54484/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:59:17,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:17,353 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-06 22:59:17,365 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:59:17,482 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 656 trivial. 0 not checked. [2023-11-06 22:59:17,482 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:59:17,483 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:59:17,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1870093814] [2023-11-06 22:59:17,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1870093814] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:59:17,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:59:17,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:59:17,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692264763] [2023-11-06 22:59:17,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:59:17,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:59:17,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:59:17,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:59:17,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:59:17,548 INFO L87 Difference]: Start difference. First operand has 59 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 36 states have internal predecessors, (45), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-06 22:59:17,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:59:17,607 INFO L93 Difference]: Finished difference Result 111 states and 189 transitions. [2023-11-06 22:59:17,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:59:17,611 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 131 [2023-11-06 22:59:17,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:59:17,623 INFO L225 Difference]: With dead ends: 111 [2023-11-06 22:59:17,624 INFO L226 Difference]: Without dead ends: 55 [2023-11-06 22:59:17,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 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-06 22:59:17,635 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:59:17,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:59:17,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-11-06 22:59:17,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2023-11-06 22:59:17,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-06 22:59:17,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 79 transitions. [2023-11-06 22:59:17,703 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 79 transitions. Word has length 131 [2023-11-06 22:59:17,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:59:17,703 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 79 transitions. [2023-11-06 22:59:17,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-06 22:59:17,704 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 79 transitions. [2023-11-06 22:59:17,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-11-06 22:59:17,717 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:59:17,717 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 22:59:17,733 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ebf243-0838-40e2-aa3d-fececde54484/bin/uautomizer-verify-WvqO1wxjHP/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)] Ended with exit code 0 [2023-11-06 22:59:17,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ebf243-0838-40e2-aa3d-fececde54484/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:59:17,933 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:59:17,933 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:59:17,934 INFO L85 PathProgramCache]: Analyzing trace with hash 2128434103, now seen corresponding path program 1 times [2023-11-06 22:59:17,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:59:17,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2110635142] [2023-11-06 22:59:17,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:59:17,935 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-06 22:59:17,935 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ebf243-0838-40e2-aa3d-fececde54484/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:59:17,937 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ebf243-0838-40e2-aa3d-fececde54484/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:59:17,956 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ebf243-0838-40e2-aa3d-fececde54484/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:59:18,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:18,250 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:59:18,258 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:59:18,475 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2023-11-06 22:59:18,476 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:59:18,476 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:59:18,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2110635142] [2023-11-06 22:59:18,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2110635142] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:59:18,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:59:18,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:59:18,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241548806] [2023-11-06 22:59:18,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:59:18,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:59:18,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:59:18,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:59:18,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:59:18,494 INFO L87 Difference]: Start difference. First operand 55 states and 79 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-06 22:59:19,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:59:19,281 INFO L93 Difference]: Finished difference Result 175 states and 245 transitions. [2023-11-06 22:59:19,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-06 22:59:19,283 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) Word has length 131 [2023-11-06 22:59:19,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:59:19,286 INFO L225 Difference]: With dead ends: 175 [2023-11-06 22:59:19,287 INFO L226 Difference]: Without dead ends: 123 [2023-11-06 22:59:19,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2023-11-06 22:59:19,290 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 128 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:59:19,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 178 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:59:19,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-11-06 22:59:19,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 60. [2023-11-06 22:59:19,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-06 22:59:19,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 83 transitions. [2023-11-06 22:59:19,316 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 83 transitions. Word has length 131 [2023-11-06 22:59:19,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:59:19,317 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 83 transitions. [2023-11-06 22:59:19,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-06 22:59:19,318 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 83 transitions. [2023-11-06 22:59:19,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-11-06 22:59:19,320 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:59:19,320 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 22:59:19,343 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ebf243-0838-40e2-aa3d-fececde54484/bin/uautomizer-verify-WvqO1wxjHP/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)] Forceful destruction successful, exit code 0 [2023-11-06 22:59:19,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ebf243-0838-40e2-aa3d-fececde54484/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:59:19,537 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:59:19,537 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:59:19,538 INFO L85 PathProgramCache]: Analyzing trace with hash -2109274891, now seen corresponding path program 1 times [2023-11-06 22:59:19,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:59:19,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [489379147] [2023-11-06 22:59:19,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:59:19,539 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-06 22:59:19,539 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ebf243-0838-40e2-aa3d-fececde54484/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:59:19,541 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ebf243-0838-40e2-aa3d-fececde54484/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:59:19,563 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ebf243-0838-40e2-aa3d-fececde54484/bin/uautomizer-verify-WvqO1wxjHP/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-06 22:59:19,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:19,794 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-06 22:59:19,803 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:59:54,224 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 365 proven. 359 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2023-11-06 22:59:54,225 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:00:24,432 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 69 proven. 48 refuted. 0 times theorem prover too weak. 723 trivial. 0 not checked. [2023-11-06 23:00:24,432 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:00:24,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [489379147] [2023-11-06 23:00:24,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [489379147] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:00:24,433 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 23:00:24,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 13] total 34 [2023-11-06 23:00:24,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327119633] [2023-11-06 23:00:24,434 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 23:00:24,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-11-06 23:00:24,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:00:24,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-11-06 23:00:24,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2023-11-06 23:00:24,438 INFO L87 Difference]: Start difference. First operand 60 states and 83 transitions. Second operand has 34 states, 34 states have (on average 2.6470588235294117) internal successors, (90), 34 states have internal predecessors, (90), 7 states have call successors, (42), 6 states have call predecessors, (42), 13 states have return successors, (42), 9 states have call predecessors, (42), 7 states have call successors, (42) [2023-11-06 23:00:43,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:00:43,529 INFO L93 Difference]: Finished difference Result 183 states and 250 transitions. [2023-11-06 23:00:43,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-11-06 23:00:43,531 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.6470588235294117) internal successors, (90), 34 states have internal predecessors, (90), 7 states have call successors, (42), 6 states have call predecessors, (42), 13 states have return successors, (42), 9 states have call predecessors, (42), 7 states have call successors, (42) Word has length 131 [2023-11-06 23:00:43,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:00:43,532 INFO L225 Difference]: With dead ends: 183 [2023-11-06 23:00:43,532 INFO L226 Difference]: Without dead ends: 0 [2023-11-06 23:00:43,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1507 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=1299, Invalid=4553, Unknown=0, NotChecked=0, Total=5852 [2023-11-06 23:00:43,542 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 153 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 1603 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 1745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 1603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2023-11-06 23:00:43,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 552 Invalid, 1745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 1603 Invalid, 0 Unknown, 0 Unchecked, 10.7s Time] [2023-11-06 23:00:43,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-06 23:00:43,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-06 23:00:43,546 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-06 23:00:43,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-06 23:00:43,546 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 131 [2023-11-06 23:00:43,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:00:43,547 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-06 23:00:43,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.6470588235294117) internal successors, (90), 34 states have internal predecessors, (90), 7 states have call successors, (42), 6 states have call predecessors, (42), 13 states have return successors, (42), 9 states have call predecessors, (42), 7 states have call successors, (42) [2023-11-06 23:00:43,547 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-06 23:00:43,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-06 23:00:43,550 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 23:00:43,571 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ebf243-0838-40e2-aa3d-fececde54484/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-06 23:00:43,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ebf243-0838-40e2-aa3d-fececde54484/bin/uautomizer-verify-WvqO1wxjHP/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-06 23:00:43,768 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-06 23:00:48,032 INFO L899 garLoopResultBuilder]: For program point L64(lines 64 68) no Hoare annotation was computed. [2023-11-06 23:00:48,032 INFO L899 garLoopResultBuilder]: For program point L93(line 93) no Hoare annotation was computed. [2023-11-06 23:00:48,033 INFO L895 garLoopResultBuilder]: At program point L89(line 89) the Hoare annotation is: (and (bvsle ((_ zero_extend 24) ~var_1_19~0) (_ bv0 32)) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_6~0 .cse0) (fp.geq ~var_1_6~0 .cse1)) (and (fp.geq ~var_1_6~0 (fp.neg .cse0)) (fp.leq ~var_1_6~0 (fp.neg .cse1))))) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv63 32)) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-06 23:00:48,033 INFO L895 garLoopResultBuilder]: At program point L89-1(line 89) the Hoare annotation is: (and (bvsle ((_ zero_extend 24) ~var_1_19~0) (_ bv0 32)) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_6~0 .cse0) (fp.geq ~var_1_6~0 .cse1)) (and (fp.geq ~var_1_6~0 (fp.neg .cse0)) (fp.leq ~var_1_6~0 (fp.neg .cse1))))) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv63 32)) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-06 23:00:48,033 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-06 23:00:48,033 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-06 23:00:48,033 INFO L895 garLoopResultBuilder]: At program point L81(line 81) the Hoare annotation is: (and (bvsle ((_ zero_extend 24) ~var_1_19~0) (_ bv0 32)) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-06 23:00:48,033 INFO L899 garLoopResultBuilder]: For program point L81-1(line 81) no Hoare annotation was computed. [2023-11-06 23:00:48,033 INFO L895 garLoopResultBuilder]: At program point L19-3(line 19) the Hoare annotation is: (let ((.cse0 ((_ zero_extend 24) ~var_1_17~0))) (and (= ~var_1_6~0 ~var_1_1~0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) (bvsle ((_ zero_extend 24) ~var_1_19~0) (_ bv0 32)) (bvsge .cse0 (_ bv191 32)) (= |ULTIMATE.start_property_#res#1| (_ bv1 32)) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_6~0 .cse1) (fp.geq ~var_1_6~0 .cse2)) (and (fp.geq ~var_1_6~0 (fp.neg .cse1)) (fp.leq ~var_1_6~0 (fp.neg .cse2))))) (= .cse0 ~var_1_21~0) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv63 32)) (bvsle ((_ zero_extend 24) ~var_1_18~0) (_ bv63 32)) (= ~var_1_20~0 ((_ zero_extend 24) ~var_1_14~0)) (= (_ bv4 8) ~var_1_22~0) (= currentRoundingMode roundNearestTiesToEven) (= ~var_1_16~0 ~var_1_19~0))) [2023-11-06 23:00:48,034 INFO L895 garLoopResultBuilder]: At program point L77(line 77) the Hoare annotation is: (and (bvsle ((_ zero_extend 24) ~var_1_19~0) (_ bv0 32)) (bvsge ((_ zero_extend 24) ~var_1_17~0) (_ bv191 32)) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_6~0 .cse0) (fp.geq ~var_1_6~0 .cse1)) (and (fp.geq ~var_1_6~0 (fp.neg .cse0)) (fp.leq ~var_1_6~0 (fp.neg .cse1))))) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv63 32)) (bvsle ((_ zero_extend 24) ~var_1_18~0) (_ bv63 32)) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-06 23:00:48,034 INFO L899 garLoopResultBuilder]: For program point L77-1(line 77) no Hoare annotation was computed. [2023-11-06 23:00:48,034 INFO L899 garLoopResultBuilder]: For program point L44(lines 44 70) no Hoare annotation was computed. [2023-11-06 23:00:48,034 INFO L895 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: (and (bvsle ((_ zero_extend 24) ~var_1_19~0) (_ bv0 32)) (bvsge ((_ zero_extend 24) ~var_1_17~0) (_ bv191 32)) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_6~0 .cse0) (fp.geq ~var_1_6~0 .cse1)) (and (fp.geq ~var_1_6~0 (fp.neg .cse0)) (fp.leq ~var_1_6~0 (fp.neg .cse1))))) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv63 32)) (bvsle ((_ zero_extend 24) ~var_1_18~0) (_ bv63 32)) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-06 23:00:48,034 INFO L895 garLoopResultBuilder]: At program point main_returnLabel#1(lines 114 125) the Hoare annotation is: false [2023-11-06 23:00:48,034 INFO L899 garLoopResultBuilder]: For program point L73-1(line 73) no Hoare annotation was computed. [2023-11-06 23:00:48,034 INFO L899 garLoopResultBuilder]: For program point L102(line 102) no Hoare annotation was computed. [2023-11-06 23:00:48,035 INFO L895 garLoopResultBuilder]: At program point L98(line 98) the Hoare annotation is: (and (bvsle ((_ zero_extend 24) ~var_1_19~0) (_ bv0 32)) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_6~0 .cse0) (fp.geq ~var_1_6~0 .cse1)) (and (fp.geq ~var_1_6~0 (fp.neg .cse0)) (fp.leq ~var_1_6~0 (fp.neg .cse1))))) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv63 32)) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-06 23:00:48,035 INFO L895 garLoopResultBuilder]: At program point L98-1(line 98) the Hoare annotation is: (and (bvsle ((_ zero_extend 24) ~var_1_19~0) (_ bv0 32)) (bvsge ((_ zero_extend 24) ~var_1_17~0) (_ bv191 32)) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_6~0 .cse0) (fp.geq ~var_1_6~0 .cse1)) (and (fp.geq ~var_1_6~0 (fp.neg .cse0)) (fp.leq ~var_1_6~0 (fp.neg .cse1))))) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv63 32)) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-06 23:00:48,035 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-06 23:00:48,035 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-06 23:00:48,035 INFO L899 garLoopResultBuilder]: For program point L90(line 90) no Hoare annotation was computed. [2023-11-06 23:00:48,036 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-06 23:00:48,036 INFO L895 garLoopResultBuilder]: At program point L86(line 86) the Hoare annotation is: (and (bvsle ((_ zero_extend 24) ~var_1_19~0) (_ bv0 32)) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_6~0 .cse0) (fp.geq ~var_1_6~0 .cse1)) (and (fp.geq ~var_1_6~0 (fp.neg .cse0)) (fp.leq ~var_1_6~0 (fp.neg .cse1))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-06 23:00:48,036 INFO L895 garLoopResultBuilder]: At program point L86-1(line 86) the Hoare annotation is: (and (bvsle ((_ zero_extend 24) ~var_1_19~0) (_ bv0 32)) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_6~0 .cse0) (fp.geq ~var_1_6~0 .cse1)) (and (fp.geq ~var_1_6~0 (fp.neg .cse0)) (fp.leq ~var_1_6~0 (fp.neg .cse1))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-06 23:00:48,037 INFO L895 garLoopResultBuilder]: At program point property_returnLabel#1(lines 110 113) the Hoare annotation is: (let ((.cse0 ((_ zero_extend 24) ~var_1_17~0))) (and (= ~var_1_6~0 ~var_1_1~0) (bvsle ((_ zero_extend 24) ~var_1_19~0) (_ bv0 32)) (bvsge .cse0 (_ bv191 32)) (= |ULTIMATE.start_property_#res#1| (_ bv1 32)) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_6~0 .cse1) (fp.geq ~var_1_6~0 .cse2)) (and (fp.geq ~var_1_6~0 (fp.neg .cse1)) (fp.leq ~var_1_6~0 (fp.neg .cse2))))) (= .cse0 ~var_1_21~0) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv63 32)) (bvsle ((_ zero_extend 24) ~var_1_18~0) (_ bv63 32)) (= ~var_1_20~0 ((_ zero_extend 24) ~var_1_14~0)) (= (_ bv4 8) ~var_1_22~0) (= currentRoundingMode roundNearestTiesToEven) (= ~var_1_16~0 ~var_1_19~0))) [2023-11-06 23:00:48,037 INFO L899 garLoopResultBuilder]: For program point L45(lines 45 53) no Hoare annotation was computed. [2023-11-06 23:00:48,037 INFO L899 garLoopResultBuilder]: For program point L45-1(lines 45 53) no Hoare annotation was computed. [2023-11-06 23:00:48,037 INFO L899 garLoopResultBuilder]: For program point L107(lines 107 109) no Hoare annotation was computed. [2023-11-06 23:00:48,037 INFO L899 garLoopResultBuilder]: For program point L99(line 99) no Hoare annotation was computed. [2023-11-06 23:00:48,038 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-06 23:00:48,038 INFO L895 garLoopResultBuilder]: At program point L95(line 95) the Hoare annotation is: (and (bvsle ((_ zero_extend 24) ~var_1_19~0) (_ bv0 32)) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_6~0 .cse0) (fp.geq ~var_1_6~0 .cse1)) (and (fp.geq ~var_1_6~0 (fp.neg .cse0)) (fp.leq ~var_1_6~0 (fp.neg .cse1))))) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv63 32)) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-06 23:00:48,038 INFO L895 garLoopResultBuilder]: At program point L95-1(line 95) the Hoare annotation is: (and (bvsle ((_ zero_extend 24) ~var_1_19~0) (_ bv0 32)) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_6~0 .cse0) (fp.geq ~var_1_6~0 .cse1)) (and (fp.geq ~var_1_6~0 (fp.neg .cse0)) (fp.leq ~var_1_6~0 (fp.neg .cse1))))) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv63 32)) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-06 23:00:48,038 INFO L899 garLoopResultBuilder]: For program point L58(lines 58 62) no Hoare annotation was computed. [2023-11-06 23:00:48,039 INFO L899 garLoopResultBuilder]: For program point L58-2(lines 44 70) no Hoare annotation was computed. [2023-11-06 23:00:48,039 INFO L899 garLoopResultBuilder]: For program point L87(line 87) no Hoare annotation was computed. [2023-11-06 23:00:48,039 INFO L895 garLoopResultBuilder]: At program point L83(line 83) the Hoare annotation is: (and (bvsle ((_ zero_extend 24) ~var_1_19~0) (_ bv0 32)) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_6~0 .cse0) (fp.geq ~var_1_6~0 .cse1)) (and (fp.geq ~var_1_6~0 (fp.neg .cse0)) (fp.leq ~var_1_6~0 (fp.neg .cse1))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-06 23:00:48,039 INFO L895 garLoopResultBuilder]: At program point L83-1(line 83) the Hoare annotation is: (and (bvsle ((_ zero_extend 24) ~var_1_19~0) (_ bv0 32)) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_6~0 .cse0) (fp.geq ~var_1_6~0 .cse1)) (and (fp.geq ~var_1_6~0 (fp.neg .cse0)) (fp.leq ~var_1_6~0 (fp.neg .cse1))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-06 23:00:48,040 INFO L895 garLoopResultBuilder]: At program point L79(line 79) the Hoare annotation is: (and (bvsle ((_ zero_extend 24) ~var_1_19~0) (_ bv0 32)) (bvsge ((_ zero_extend 24) ~var_1_17~0) (_ bv191 32)) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_6~0 .cse0) (fp.geq ~var_1_6~0 .cse1)) (and (fp.geq ~var_1_6~0 (fp.neg .cse0)) (fp.leq ~var_1_6~0 (fp.neg .cse1))))) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv63 32)) (bvsle ((_ zero_extend 24) ~var_1_18~0) (_ bv63 32)) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-06 23:00:48,040 INFO L899 garLoopResultBuilder]: For program point L79-1(line 79) no Hoare annotation was computed. [2023-11-06 23:00:48,040 INFO L899 garLoopResultBuilder]: For program point L46(lines 46 50) no Hoare annotation was computed. [2023-11-06 23:00:48,040 INFO L895 garLoopResultBuilder]: At program point L75(line 75) the Hoare annotation is: (and (bvsle ((_ zero_extend 24) ~var_1_19~0) (_ bv0 32)) (bvsge ((_ zero_extend 24) ~var_1_17~0) (_ bv191 32)) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_6~0 .cse0) (fp.geq ~var_1_6~0 .cse1)) (and (fp.geq ~var_1_6~0 (fp.neg .cse0)) (fp.leq ~var_1_6~0 (fp.neg .cse1))))) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv63 32)) (bvsle ((_ zero_extend 24) ~var_1_18~0) (_ bv63 32)) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-06 23:00:48,040 INFO L899 garLoopResultBuilder]: For program point L42(lines 42 43) no Hoare annotation was computed. [2023-11-06 23:00:48,041 INFO L899 garLoopResultBuilder]: For program point L75-1(line 75) no Hoare annotation was computed. [2023-11-06 23:00:48,041 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-06 23:00:48,041 INFO L895 garLoopResultBuilder]: At program point L104(line 104) the Hoare annotation is: (and (bvsge ((_ zero_extend 24) ~var_1_17~0) (_ bv191 32)) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_6~0 .cse0) (fp.geq ~var_1_6~0 .cse1)) (and (fp.geq ~var_1_6~0 (fp.neg .cse0)) (fp.leq ~var_1_6~0 (fp.neg .cse1))))) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv63 32)) (bvsle ((_ zero_extend 24) ~var_1_18~0) (_ bv63 32)) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-06 23:00:48,041 INFO L895 garLoopResultBuilder]: At program point L104-1(line 104) the Hoare annotation is: (and (bvsge ((_ zero_extend 24) ~var_1_17~0) (_ bv191 32)) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_6~0 .cse0) (fp.geq ~var_1_6~0 .cse1)) (and (fp.geq ~var_1_6~0 (fp.neg .cse0)) (fp.leq ~var_1_6~0 (fp.neg .cse1))))) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv63 32)) (bvsle ((_ zero_extend 24) ~var_1_18~0) (_ bv63 32)) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-06 23:00:48,041 INFO L899 garLoopResultBuilder]: For program point L96(line 96) no Hoare annotation was computed. [2023-11-06 23:00:48,042 INFO L895 garLoopResultBuilder]: At program point L92(line 92) the Hoare annotation is: (and (bvsle ((_ zero_extend 24) ~var_1_19~0) (_ bv0 32)) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_6~0 .cse0) (fp.geq ~var_1_6~0 .cse1)) (and (fp.geq ~var_1_6~0 (fp.neg .cse0)) (fp.leq ~var_1_6~0 (fp.neg .cse1))))) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv63 32)) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-06 23:00:48,042 INFO L895 garLoopResultBuilder]: At program point L92-1(line 92) the Hoare annotation is: (and (bvsle ((_ zero_extend 24) ~var_1_19~0) (_ bv0 32)) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_6~0 .cse0) (fp.geq ~var_1_6~0 .cse1)) (and (fp.geq ~var_1_6~0 (fp.neg .cse0)) (fp.leq ~var_1_6~0 (fp.neg .cse1))))) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv63 32)) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-06 23:00:48,042 INFO L899 garLoopResultBuilder]: For program point L84(line 84) no Hoare annotation was computed. [2023-11-06 23:00:48,042 INFO L895 garLoopResultBuilder]: At program point L117-2(lines 117 123) the Hoare annotation is: (and (bvsle ((_ zero_extend 24) ~var_1_19~0) (_ bv0 32)) (bvsge ((_ zero_extend 24) ~var_1_17~0) (_ bv191 32)) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_6~0 .cse0) (fp.geq ~var_1_6~0 .cse1)) (and (fp.geq ~var_1_6~0 (fp.neg .cse0)) (fp.leq ~var_1_6~0 (fp.neg .cse1))))) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv63 32)) (bvsle ((_ zero_extend 24) ~var_1_18~0) (_ bv63 32)) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-06 23:00:48,043 INFO L899 garLoopResultBuilder]: For program point L117-3(lines 117 123) no Hoare annotation was computed. [2023-11-06 23:00:48,043 INFO L899 garLoopResultBuilder]: For program point L105(lines 71 106) no Hoare annotation was computed. [2023-11-06 23:00:48,043 INFO L895 garLoopResultBuilder]: At program point L101(line 101) the Hoare annotation is: (and (bvsle ((_ zero_extend 24) ~var_1_19~0) (_ bv0 32)) (bvsge ((_ zero_extend 24) ~var_1_17~0) (_ bv191 32)) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_6~0 .cse0) (fp.geq ~var_1_6~0 .cse1)) (and (fp.geq ~var_1_6~0 (fp.neg .cse0)) (fp.leq ~var_1_6~0 (fp.neg .cse1))))) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv63 32)) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-06 23:00:48,043 INFO L895 garLoopResultBuilder]: At program point L101-1(line 101) the Hoare annotation is: (and (bvsle ((_ zero_extend 24) ~var_1_19~0) (_ bv0 32)) (bvsge ((_ zero_extend 24) ~var_1_17~0) (_ bv191 32)) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_6~0 .cse0) (fp.geq ~var_1_6~0 .cse1)) (and (fp.geq ~var_1_6~0 (fp.neg .cse0)) (fp.leq ~var_1_6~0 (fp.neg .cse1))))) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv63 32)) (= currentRoundingMode roundNearestTiesToEven)) [2023-11-06 23:00:48,044 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-06 23:00:48,044 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-06 23:00:48,044 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-06 23:00:48,044 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-06 23:00:48,048 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-06 23:00:48,050 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 23:00:48,064 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-06 23:00:48,065 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-06 23:00:48,065 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-06 23:00:48,065 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-06 23:00:48,066 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-06 23:00:48,068 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-06 23:00:48,068 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-06 23:00:48,068 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-06 23:00:48,069 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-06 23:00:48,069 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-06 23:00:48,070 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-06 23:00:48,070 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-06 23:00:48,070 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-06 23:00:48,070 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-06 23:00:48,070 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-06 23:00:48,071 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-06 23:00:48,071 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-06 23:00:48,071 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-06 23:00:48,072 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-06 23:00:48,072 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-06 23:00:48,073 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-06 23:00:48,073 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-06 23:00:48,074 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-06 23:00:48,074 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-06 23:00:48,074 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-06 23:00:48,081 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-06 23:00:48,081 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-06 23:00:48,082 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-06 23:00:48,082 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-06 23:00:48,082 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-06 23:00:48,083 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 11:00:48 BoogieIcfgContainer [2023-11-06 23:00:48,085 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 23:00:48,085 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 23:00:48,086 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 23:00:48,086 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 23:00:48,087 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:59:16" (3/4) ... [2023-11-06 23:00:48,089 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-06 23:00:48,094 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-06 23:00:48,101 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2023-11-06 23:00:48,101 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-11-06 23:00:48,102 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-06 23:00:48,102 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-06 23:00:48,143 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((var_1_6 == var_1_1) && (var_1_19 <= 0)) && (var_1_17 >= 191)) && (\result == 1)) && (var_1_17 == var_1_21)) && (var_1_12 <= 63)) && (var_1_18 <= 63)) && (var_1_20 == var_1_14)) && (4 == var_1_22)) && (var_1_16 == var_1_19)) [2023-11-06 23:00:48,146 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((var_1_6 == var_1_1) && (cond == 1)) && (var_1_19 <= 0)) && (var_1_17 >= 191)) && (\result == 1)) && (var_1_17 == var_1_21)) && (var_1_12 <= 63)) && (var_1_18 <= 63)) && (var_1_20 == var_1_14)) && (4 == var_1_22)) && (var_1_16 == var_1_19)) [2023-11-06 23:00:48,183 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((var_1_6 == var_1_1) && (var_1_19 <= 0)) && (var_1_17 >= 191)) && (\result == 1)) && (var_1_17 == var_1_21)) && (var_1_12 <= 63)) && (var_1_18 <= 63)) && (var_1_20 == var_1_14)) && (4 == var_1_22)) && (var_1_16 == var_1_19)) [2023-11-06 23:00:48,183 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((var_1_6 == var_1_1) && (cond == 1)) && (var_1_19 <= 0)) && (var_1_17 >= 191)) && (\result == 1)) && (var_1_17 == var_1_21)) && (var_1_12 <= 63)) && (var_1_18 <= 63)) && (var_1_20 == var_1_14)) && (4 == var_1_22)) && (var_1_16 == var_1_19)) [2023-11-06 23:00:48,195 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ebf243-0838-40e2-aa3d-fececde54484/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 23:00:48,196 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ebf243-0838-40e2-aa3d-fececde54484/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.yaml [2023-11-06 23:00:48,196 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 23:00:48,197 INFO L158 Benchmark]: Toolchain (without parser) took 93507.57ms. Allocated memory was 71.3MB in the beginning and 847.2MB in the end (delta: 775.9MB). Free memory was 47.6MB in the beginning and 419.7MB in the end (delta: -372.1MB). Peak memory consumption was 404.4MB. Max. memory is 16.1GB. [2023-11-06 23:00:48,197 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 71.3MB. Free memory is still 47.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:00:48,198 INFO L158 Benchmark]: CACSL2BoogieTranslator took 345.44ms. Allocated memory is still 71.3MB. Free memory was 47.4MB in the beginning and 34.1MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-06 23:00:48,198 INFO L158 Benchmark]: Boogie Procedure Inliner took 105.36ms. Allocated memory was 71.3MB in the beginning and 102.8MB in the end (delta: 31.5MB). Free memory was 34.1MB in the beginning and 80.7MB in the end (delta: -46.5MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. [2023-11-06 23:00:48,199 INFO L158 Benchmark]: Boogie Preprocessor took 42.87ms. Allocated memory is still 102.8MB. Free memory was 80.7MB in the beginning and 79.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:00:48,199 INFO L158 Benchmark]: RCFGBuilder took 1622.40ms. Allocated memory is still 102.8MB. Free memory was 79.1MB in the beginning and 63.2MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-06 23:00:48,200 INFO L158 Benchmark]: TraceAbstraction took 91272.50ms. Allocated memory was 102.8MB in the beginning and 847.2MB in the end (delta: 744.5MB). Free memory was 62.7MB in the beginning and 425.0MB in the end (delta: -362.2MB). Peak memory consumption was 384.2MB. Max. memory is 16.1GB. [2023-11-06 23:00:48,200 INFO L158 Benchmark]: Witness Printer took 110.92ms. Allocated memory is still 847.2MB. Free memory was 425.0MB in the beginning and 419.7MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 23:00:48,202 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 71.3MB. Free memory is still 47.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 345.44ms. Allocated memory is still 71.3MB. Free memory was 47.4MB in the beginning and 34.1MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 105.36ms. Allocated memory was 71.3MB in the beginning and 102.8MB in the end (delta: 31.5MB). Free memory was 34.1MB in the beginning and 80.7MB in the end (delta: -46.5MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.87ms. Allocated memory is still 102.8MB. Free memory was 80.7MB in the beginning and 79.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1622.40ms. Allocated memory is still 102.8MB. Free memory was 79.1MB in the beginning and 63.2MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 91272.50ms. Allocated memory was 102.8MB in the beginning and 847.2MB in the end (delta: 744.5MB). Free memory was 62.7MB in the beginning and 425.0MB in the end (delta: -362.2MB). Peak memory consumption was 384.2MB. Max. memory is 16.1GB. * Witness Printer took 110.92ms. Allocated memory is still 847.2MB. Free memory was 425.0MB in the beginning and 419.7MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. 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 - 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 - 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 - 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, 59 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 91.2s, OverallIterations: 3, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 20.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 302 SdHoareTripleChecker+Valid, 11.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 281 mSDsluCounter, 809 SdHoareTripleChecker+Invalid, 10.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 590 mSDsCounter, 230 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1756 IncrementalHoareTripleChecker+Invalid, 1986 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 230 mSolverCounterUnsat, 219 mSDtfsCounter, 1756 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 578 GetRequests, 488 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1558 ImplicationChecksByTransitivity, 14.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=2, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 63 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 130 PreInvPairs, 176 NumberOfFragments, 964 HoareAnnotationTreeSize, 130 FomulaSimplifications, 1598 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 26 FomulaSimplificationsInter, 6796 FormulaSimplificationTreeSizeReductionInter, 4.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 65.0s InterpolantComputationTime, 393 NumberOfCodeBlocks, 393 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 520 ConstructedInterpolants, 9 QuantifiedInterpolants, 8631 SizeOfPredicates, 35 NumberOfNonLiveVariables, 639 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 2953/3360 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: 114]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 110]: Loop Invariant [2023-11-06 23:00:48,215 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-06 23:00:48,216 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-06 23:00:48,216 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-06 23:00:48,216 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-06 23:00:48,217 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-06 23:00:48,217 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-06 23:00:48,218 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-06 23:00:48,218 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-06 23:00:48,218 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-06 23:00:48,218 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated Derived loop invariant: ((((((((((var_1_6 == var_1_1) && (var_1_19 <= 0)) && (var_1_17 >= 191)) && (\result == 1)) && (var_1_17 == var_1_21)) && (var_1_12 <= 63)) && (var_1_18 <= 63)) && (var_1_20 == var_1_14)) && (4 == var_1_22)) && (var_1_16 == var_1_19)) - InvariantResult [Line: 117]: Loop Invariant [2023-11-06 23:00:48,219 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-06 23:00:48,219 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-06 23:00:48,219 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-06 23:00:48,220 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-06 23:00:48,220 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-06 23:00:48,221 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-06 23:00:48,221 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-06 23:00:48,221 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-06 23:00:48,221 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-06 23:00:48,221 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated Derived loop invariant: ((((var_1_19 <= 0) && (var_1_17 >= 191)) && (var_1_12 <= 63)) && (var_1_18 <= 63)) - InvariantResult [Line: 19]: Loop Invariant [2023-11-06 23:00:48,222 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-06 23:00:48,223 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-06 23:00:48,223 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-06 23:00:48,223 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-06 23:00:48,223 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-06 23:00:48,224 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-06 23:00:48,224 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-06 23:00:48,224 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-06 23:00:48,225 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-11-06 23:00:48,225 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated Derived loop invariant: (((((((((((var_1_6 == var_1_1) && (cond == 1)) && (var_1_19 <= 0)) && (var_1_17 >= 191)) && (\result == 1)) && (var_1_17 == var_1_21)) && (var_1_12 <= 63)) && (var_1_18 <= 63)) && (var_1_20 == var_1_14)) && (4 == var_1_22)) && (var_1_16 == var_1_19)) RESULT: Ultimate proved your program to be correct! [2023-11-06 23:00:48,274 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2ebf243-0838-40e2-aa3d-fececde54484/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE