./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-0.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a27d26d-587a-4667-8f06-5ac55660e909/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a27d26d-587a-4667-8f06-5ac55660e909/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a27d26d-587a-4667-8f06-5ac55660e909/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a27d26d-587a-4667-8f06-5ac55660e909/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-0.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a27d26d-587a-4667-8f06-5ac55660e909/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a27d26d-587a-4667-8f06-5ac55660e909/bin/uautomizer-verify-qhAvR1uOyd --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 236e9a83f25840205b9c3455bfa2071e05298d6f23a3b7465f829136c71d4a4c --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 13:27:19,081 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 13:27:19,167 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a27d26d-587a-4667-8f06-5ac55660e909/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 13:27:19,174 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 13:27:19,174 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 13:27:19,225 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 13:27:19,227 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 13:27:19,227 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 13:27:19,228 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 13:27:19,228 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 13:27:19,229 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 13:27:19,229 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 13:27:19,230 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 13:27:19,231 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 13:27:19,231 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 13:27:19,231 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 13:27:19,232 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 13:27:19,232 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 13:27:19,232 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 13:27:19,232 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 13:27:19,232 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 13:27:19,232 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 13:27:19,233 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 13:27:19,233 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 13:27:19,233 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 13:27:19,233 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 13:27:19,234 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 13:27:19,234 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 13:27:19,234 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 13:27:19,234 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 13:27:19,235 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 13:27:19,235 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 13:27:19,235 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:27:19,235 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 13:27:19,236 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 13:27:19,236 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 13:27:19,236 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 13:27:19,237 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 13:27:19,237 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 13:27:19,237 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 13:27:19,237 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 13:27:19,237 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 13:27:19,238 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_8a27d26d-587a-4667-8f06-5ac55660e909/bin/uautomizer-verify-qhAvR1uOyd Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 236e9a83f25840205b9c3455bfa2071e05298d6f23a3b7465f829136c71d4a4c [2024-11-13 13:27:19,615 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 13:27:19,630 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 13:27:19,634 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 13:27:19,636 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 13:27:19,637 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 13:27:19,640 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a27d26d-587a-4667-8f06-5ac55660e909/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-0.i Unable to find full path for "g++" [2024-11-13 13:27:22,073 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 13:27:22,523 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 13:27:22,531 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a27d26d-587a-4667-8f06-5ac55660e909/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-0.i [2024-11-13 13:27:22,555 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a27d26d-587a-4667-8f06-5ac55660e909/bin/uautomizer-verify-qhAvR1uOyd/data/0bb774d8a/d396a5a1eab549d69847b91cf3329ed3/FLAG6e42718d4 [2024-11-13 13:27:22,627 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a27d26d-587a-4667-8f06-5ac55660e909/bin/uautomizer-verify-qhAvR1uOyd/data/0bb774d8a/d396a5a1eab549d69847b91cf3329ed3 [2024-11-13 13:27:22,631 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 13:27:22,633 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 13:27:22,636 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 13:27:22,636 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 13:27:22,642 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 13:27:22,643 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:27:22" (1/1) ... [2024-11-13 13:27:22,644 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35f9b46f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:27:22, skipping insertion in model container [2024-11-13 13:27:22,644 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:27:22" (1/1) ... [2024-11-13 13:27:22,668 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 13:27:22,894 WARN L250 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_8a27d26d-587a-4667-8f06-5ac55660e909/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-0.i[918,931] [2024-11-13 13:27:22,986 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:27:23,002 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 13:27:23,022 WARN L250 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_8a27d26d-587a-4667-8f06-5ac55660e909/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-0.i[918,931] [2024-11-13 13:27:23,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:27:23,088 INFO L204 MainTranslator]: Completed translation [2024-11-13 13:27:23,088 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:27:23 WrapperNode [2024-11-13 13:27:23,089 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 13:27:23,090 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 13:27:23,090 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 13:27:23,090 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 13:27:23,097 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:27:23" (1/1) ... [2024-11-13 13:27:23,107 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:27:23" (1/1) ... [2024-11-13 13:27:23,136 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 106 [2024-11-13 13:27:23,136 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 13:27:23,137 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 13:27:23,137 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 13:27:23,137 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 13:27:23,151 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:27:23" (1/1) ... [2024-11-13 13:27:23,152 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:27:23" (1/1) ... [2024-11-13 13:27:23,157 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:27:23" (1/1) ... [2024-11-13 13:27:23,172 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-13 13:27:23,172 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:27:23" (1/1) ... [2024-11-13 13:27:23,173 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:27:23" (1/1) ... [2024-11-13 13:27:23,181 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:27:23" (1/1) ... [2024-11-13 13:27:23,185 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:27:23" (1/1) ... [2024-11-13 13:27:23,187 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:27:23" (1/1) ... [2024-11-13 13:27:23,189 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:27:23" (1/1) ... [2024-11-13 13:27:23,192 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 13:27:23,193 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 13:27:23,193 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 13:27:23,193 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 13:27:23,194 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:27:23" (1/1) ... [2024-11-13 13:27:23,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:27:23,221 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a27d26d-587a-4667-8f06-5ac55660e909/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:27:23,236 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a27d26d-587a-4667-8f06-5ac55660e909/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 13:27:23,244 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a27d26d-587a-4667-8f06-5ac55660e909/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 13:27:23,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 13:27:23,274 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 13:27:23,275 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 13:27:23,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 13:27:23,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 13:27:23,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 13:27:23,381 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 13:27:23,384 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 13:27:23,743 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-13 13:27:23,743 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 13:27:23,757 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 13:27:23,758 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 13:27:23,759 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:27:23 BoogieIcfgContainer [2024-11-13 13:27:23,759 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 13:27:23,761 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 13:27:23,764 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 13:27:23,770 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 13:27:23,771 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 01:27:22" (1/3) ... [2024-11-13 13:27:23,771 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b1c3445 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:27:23, skipping insertion in model container [2024-11-13 13:27:23,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:27:23" (2/3) ... [2024-11-13 13:27:23,772 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b1c3445 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:27:23, skipping insertion in model container [2024-11-13 13:27:23,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:27:23" (3/3) ... [2024-11-13 13:27:23,774 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-0.i [2024-11-13 13:27:23,794 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 13:27:23,796 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-0.i that has 2 procedures, 43 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 13:27:23,890 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 13:27:23,911 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@72c607c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 13:27:23,911 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 13:27:23,919 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 32 states have internal predecessors, (45), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-13 13:27:23,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-13 13:27:23,932 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:27:23,933 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:27:23,934 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:27:23,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:27:23,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1134737847, now seen corresponding path program 1 times [2024-11-13 13:27:23,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:27:23,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093626563] [2024-11-13 13:27:23,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:27:23,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:27:24,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:24,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:27:24,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:24,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 13:27:24,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:24,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 13:27:24,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:24,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 13:27:24,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:24,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 13:27:24,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:24,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 13:27:24,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:24,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 13:27:24,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:24,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 13:27:24,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:24,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 13:27:24,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:24,441 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-13 13:27:24,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:27:24,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093626563] [2024-11-13 13:27:24,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093626563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:27:24,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:27:24,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:27:24,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768114388] [2024-11-13 13:27:24,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:27:24,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 13:27:24,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:27:24,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 13:27:24,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 13:27:24,489 INFO L87 Difference]: Start difference. First operand has 43 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 32 states have internal predecessors, (45), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-13 13:27:24,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:27:24,513 INFO L93 Difference]: Finished difference Result 78 states and 127 transitions. [2024-11-13 13:27:24,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 13:27:24,515 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 67 [2024-11-13 13:27:24,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:27:24,523 INFO L225 Difference]: With dead ends: 78 [2024-11-13 13:27:24,523 INFO L226 Difference]: Without dead ends: 38 [2024-11-13 13:27:24,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 13:27:24,531 INFO L432 NwaCegarLoop]: 53 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, 53 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 [2024-11-13 13:27:24,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:27:24,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-13 13:27:24,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-13 13:27:24,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-13 13:27:24,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 53 transitions. [2024-11-13 13:27:24,600 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 53 transitions. Word has length 67 [2024-11-13 13:27:24,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:27:24,602 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 53 transitions. [2024-11-13 13:27:24,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-13 13:27:24,603 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 53 transitions. [2024-11-13 13:27:24,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-13 13:27:24,607 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:27:24,608 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:27:24,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 13:27:24,609 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:27:24,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:27:24,609 INFO L85 PathProgramCache]: Analyzing trace with hash 622760957, now seen corresponding path program 1 times [2024-11-13 13:27:24,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:27:24,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602825314] [2024-11-13 13:27:24,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:27:24,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:27:24,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:25,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:27:25,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:25,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 13:27:25,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:25,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 13:27:25,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:25,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 13:27:25,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:25,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 13:27:25,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:25,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 13:27:25,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:25,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 13:27:25,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:25,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 13:27:25,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:25,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 13:27:25,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:25,438 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-13 13:27:25,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:27:25,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602825314] [2024-11-13 13:27:25,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602825314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:27:25,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:27:25,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:27:25,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715362065] [2024-11-13 13:27:25,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:27:25,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:27:25,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:27:25,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:27:25,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:27:25,446 INFO L87 Difference]: Start difference. First operand 38 states and 53 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-13 13:27:25,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:27:25,656 INFO L93 Difference]: Finished difference Result 109 states and 154 transitions. [2024-11-13 13:27:25,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:27:25,657 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 67 [2024-11-13 13:27:25,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:27:25,659 INFO L225 Difference]: With dead ends: 109 [2024-11-13 13:27:25,659 INFO L226 Difference]: Without dead ends: 74 [2024-11-13 13:27:25,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:27:25,661 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 34 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:27:25,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 135 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 13:27:25,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-13 13:27:25,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 62. [2024-11-13 13:27:25,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 41 states have internal predecessors, (51), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-13 13:27:25,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 87 transitions. [2024-11-13 13:27:25,683 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 87 transitions. Word has length 67 [2024-11-13 13:27:25,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:27:25,684 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 87 transitions. [2024-11-13 13:27:25,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-13 13:27:25,685 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 87 transitions. [2024-11-13 13:27:25,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-13 13:27:25,686 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:27:25,687 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:27:25,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 13:27:25,687 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:27:25,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:27:25,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1302819327, now seen corresponding path program 1 times [2024-11-13 13:27:25,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:27:25,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508095154] [2024-11-13 13:27:25,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:27:25,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:27:25,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:26,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:27:26,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:26,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 13:27:26,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:26,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 13:27:26,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:26,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 13:27:26,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:26,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 13:27:26,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:26,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 13:27:26,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:26,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 13:27:26,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:26,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 13:27:26,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:26,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 13:27:26,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:27:26,484 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-13 13:27:26,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:27:26,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508095154] [2024-11-13 13:27:26,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508095154] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:27:26,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:27:26,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:27:26,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357544054] [2024-11-13 13:27:26,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:27:26,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:27:26,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:27:26,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:27:26,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:27:26,488 INFO L87 Difference]: Start difference. First operand 62 states and 87 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-13 13:27:26,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:27:26,664 INFO L93 Difference]: Finished difference Result 141 states and 197 transitions. [2024-11-13 13:27:26,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:27:26,665 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 67 [2024-11-13 13:27:26,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:27:26,666 INFO L225 Difference]: With dead ends: 141 [2024-11-13 13:27:26,667 INFO L226 Difference]: Without dead ends: 105 [2024-11-13 13:27:26,667 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:27:26,668 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 54 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:27:26,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 147 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:27:26,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-13 13:27:26,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 95. [2024-11-13 13:27:26,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 64 states have (on average 1.25) internal successors, (80), 64 states have internal predecessors, (80), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-13 13:27:26,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 134 transitions. [2024-11-13 13:27:26,715 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 134 transitions. Word has length 67 [2024-11-13 13:27:26,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:27:26,716 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 134 transitions. [2024-11-13 13:27:26,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-13 13:27:26,716 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 134 transitions. [2024-11-13 13:27:26,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-13 13:27:26,721 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:27:26,721 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:27:26,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 13:27:26,722 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:27:26,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:27:26,722 INFO L85 PathProgramCache]: Analyzing trace with hash 909792317, now seen corresponding path program 1 times [2024-11-13 13:27:26,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:27:26,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861399168] [2024-11-13 13:27:26,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:27:26,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:27:26,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:27:26,855 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 13:27:26,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:27:27,021 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 13:27:27,021 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 13:27:27,022 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 13:27:27,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 13:27:27,029 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-13 13:27:27,138 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 13:27:27,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 01:27:27 BoogieIcfgContainer [2024-11-13 13:27:27,147 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 13:27:27,150 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 13:27:27,150 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 13:27:27,151 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 13:27:27,152 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:27:23" (3/4) ... [2024-11-13 13:27:27,155 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 13:27:27,156 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 13:27:27,159 INFO L158 Benchmark]: Toolchain (without parser) took 4524.59ms. Allocated memory is still 142.6MB. Free memory was 107.0MB in the beginning and 104.7MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:27:27,159 INFO L158 Benchmark]: CDTParser took 0.85ms. Allocated memory is still 167.8MB. Free memory is still 106.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:27:27,160 INFO L158 Benchmark]: CACSL2BoogieTranslator took 453.29ms. Allocated memory is still 142.6MB. Free memory was 106.7MB in the beginning and 93.7MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 13:27:27,160 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.72ms. Allocated memory is still 142.6MB. Free memory was 93.7MB in the beginning and 91.9MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 13:27:27,160 INFO L158 Benchmark]: Boogie Preprocessor took 55.07ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 89.5MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:27:27,161 INFO L158 Benchmark]: RCFGBuilder took 566.29ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 73.4MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 13:27:27,161 INFO L158 Benchmark]: TraceAbstraction took 3386.18ms. Allocated memory is still 142.6MB. Free memory was 72.8MB in the beginning and 104.8MB in the end (delta: -32.0MB). Peak memory consumption was 38.3MB. Max. memory is 16.1GB. [2024-11-13 13:27:27,161 INFO L158 Benchmark]: Witness Printer took 5.72ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 104.7MB in the end (delta: 41.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:27:27,167 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.85ms. Allocated memory is still 167.8MB. Free memory is still 106.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 453.29ms. Allocated memory is still 142.6MB. Free memory was 106.7MB in the beginning and 93.7MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.72ms. Allocated memory is still 142.6MB. Free memory was 93.7MB in the beginning and 91.9MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.07ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 89.5MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 566.29ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 73.4MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3386.18ms. Allocated memory is still 142.6MB. Free memory was 72.8MB in the beginning and 104.8MB in the end (delta: -32.0MB). Peak memory consumption was 38.3MB. Max. memory is 16.1GB. * Witness Printer took 5.72ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 104.7MB in the end (delta: 41.5kB). 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 95, overapproximation of someBinaryFLOATComparisonOperation at line 93, overapproximation of someBinaryFLOATComparisonOperation at line 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 44, overapproximation of someBinaryDOUBLEComparisonOperation at line 89, overapproximation of someBinaryDOUBLEComparisonOperation at line 91, overapproximation of someBinaryDOUBLEComparisonOperation at line 62, overapproximation of someBinaryDOUBLEComparisonOperation at line 88, overapproximation of someBinaryDOUBLEComparisonOperation at line 106. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 0; [L23] signed long int var_1_5 = 2; [L24] signed short int var_1_6 = -10; [L25] unsigned long int var_1_7 = 1; [L26] unsigned char var_1_8 = 0; [L27] unsigned long int var_1_9 = 3470417420; [L28] unsigned char var_1_10 = 0; [L29] double var_1_12 = 25.6; [L30] double var_1_13 = 1.75; [L31] float var_1_14 = 5.4; [L32] float var_1_15 = 127.5; [L33] float var_1_16 = 3.5; [L34] signed long int var_1_17 = 64; [L35] signed long int last_1_var_1_1 = 0; [L36] signed long int last_1_var_1_5 = 2; [L37] signed short int last_1_var_1_6 = -10; [L38] unsigned long int last_1_var_1_7 = 1; [L39] float last_1_var_1_14 = 5.4; [L40] signed long int last_1_var_1_17 = 64; VAL [isInitial=0, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L110] isInitial = 1 [L111] FCALL initially() [L112] COND TRUE 1 [L113] CALL updateLastVariables() [L98] last_1_var_1_1 = var_1_1 [L99] last_1_var_1_5 = var_1_5 [L100] last_1_var_1_6 = var_1_6 [L101] last_1_var_1_7 = var_1_7 [L102] last_1_var_1_14 = var_1_14 [L103] last_1_var_1_17 = var_1_17 VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L113] RET updateLastVariables() [L114] CALL updateVariables() [L81] var_1_9 = __VERIFIER_nondet_ulong() [L82] CALL assume_abort_if_not(var_1_9 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L82] RET assume_abort_if_not(var_1_9 >= 2147483647) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L83] CALL assume_abort_if_not(var_1_9 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L83] RET assume_abort_if_not(var_1_9 <= 4294967295) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L84] var_1_10 = __VERIFIER_nondet_uchar() [L85] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L85] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L86] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L86] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L87] var_1_12 = __VERIFIER_nondet_double() [L88] CALL assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L88] RET assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L89] CALL assume_abort_if_not(var_1_12 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L89] RET assume_abort_if_not(var_1_12 != 0.0F) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L90] var_1_13 = __VERIFIER_nondet_double() [L91] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L91] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L92] var_1_15 = __VERIFIER_nondet_float() [L93] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L93] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_16=7/2, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L94] var_1_16 = __VERIFIER_nondet_float() [L95] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L95] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L114] RET updateVariables() [L115] CALL step() [L44] COND TRUE ((last_1_var_1_14 + last_1_var_1_14) / 9.2) < ((((last_1_var_1_14) < (var_1_16)) ? (last_1_var_1_14) : (var_1_16))) [L45] var_1_17 = ((((last_1_var_1_1) > (last_1_var_1_6)) ? (last_1_var_1_1) : (last_1_var_1_6))) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=0, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L49] COND FALSE !(last_1_var_1_7 > (- last_1_var_1_5)) [L52] var_1_1 = (((((1 - last_1_var_1_7)) < (16)) ? ((1 - last_1_var_1_7)) : (16))) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=0, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L54] COND FALSE !(last_1_var_1_17 < (- last_1_var_1_1)) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=0, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L57] COND FALSE !(var_1_17 > var_1_17) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=0, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L62] COND FALSE !((var_1_12 * last_1_var_1_14) > var_1_13) [L69] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=3470417425, var_1_16=3470417425, var_1_17=0, var_1_1=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L71] COND TRUE var_1_6 < var_1_17 [L72] var_1_5 = ((var_1_17 - var_1_6) + var_1_6) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=3470417425, var_1_16=3470417425, var_1_17=0, var_1_1=0, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L74] COND TRUE (- 8u) >= (var_1_9 - var_1_6) [L75] var_1_8 = (! var_1_10) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=3470417425, var_1_16=3470417425, var_1_17=0, var_1_1=0, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L115] RET step() [L116] CALL, EXPR property() [L106-L107] return (((((((last_1_var_1_7 > (- last_1_var_1_5)) ? (var_1_1 == ((signed long int) ((((last_1_var_1_5) > ((last_1_var_1_7 + last_1_var_1_6))) ? (last_1_var_1_5) : ((last_1_var_1_7 + last_1_var_1_6)))))) : (var_1_1 == ((signed long int) (((((1 - last_1_var_1_7)) < (16)) ? ((1 - last_1_var_1_7)) : (16)))))) && ((var_1_6 < var_1_17) ? (var_1_5 == ((signed long int) ((var_1_17 - var_1_6) + var_1_6))) : 1)) && ((last_1_var_1_17 < (- last_1_var_1_1)) ? (var_1_6 == ((signed short int) (32 - last_1_var_1_6))) : 1)) && ((var_1_17 > var_1_17) ? ((var_1_6 <= var_1_1) ? (var_1_7 == ((unsigned long int) ((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))))) : 1) : 1)) && (((- 8u) >= (var_1_9 - var_1_6)) ? (var_1_8 == ((unsigned char) (! var_1_10))) : (var_1_8 == ((unsigned char) (((var_1_14 / var_1_12) >= var_1_14) || var_1_10))))) && (((var_1_12 * last_1_var_1_14) > var_1_13) ? ((var_1_9 < var_1_7) ? (var_1_14 == ((float) var_1_15)) : (var_1_14 == ((float) var_1_15))) : (var_1_14 == ((float) var_1_16)))) && ((((last_1_var_1_14 + last_1_var_1_14) / 9.2) < ((((last_1_var_1_14) < (var_1_16)) ? (last_1_var_1_14) : (var_1_16)))) ? (var_1_17 == ((signed long int) ((((last_1_var_1_1) > (last_1_var_1_6)) ? (last_1_var_1_1) : (last_1_var_1_6))))) : (var_1_17 == ((signed long int) last_1_var_1_6))) ; VAL [\result=0, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=3470417425, var_1_16=3470417425, var_1_17=0, var_1_1=0, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L116] RET, EXPR property() [L116] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=3470417425, var_1_16=3470417425, var_1_17=0, var_1_1=0, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=3470417425, var_1_16=3470417425, var_1_17=0, var_1_1=0, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 43 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, OverallIterations: 4, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 88 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 88 mSDsluCounter, 335 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 177 mSDsCounter, 56 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 33 IncrementalHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 56 mSolverCounterUnsat, 158 mSDtfsCounter, 33 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95occurred in iteration=3, InterpolantAutomatonStates: 10, 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, 22 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 268 NumberOfCodeBlocks, 268 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 198 ConstructedInterpolants, 0 QuantifiedInterpolants, 456 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 432/432 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 [2024-11-13 13:27:27,207 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a27d26d-587a-4667-8f06-5ac55660e909/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a27d26d-587a-4667-8f06-5ac55660e909/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a27d26d-587a-4667-8f06-5ac55660e909/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a27d26d-587a-4667-8f06-5ac55660e909/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a27d26d-587a-4667-8f06-5ac55660e909/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-0.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a27d26d-587a-4667-8f06-5ac55660e909/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a27d26d-587a-4667-8f06-5ac55660e909/bin/uautomizer-verify-qhAvR1uOyd --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 236e9a83f25840205b9c3455bfa2071e05298d6f23a3b7465f829136c71d4a4c --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 13:27:30,586 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 13:27:30,716 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a27d26d-587a-4667-8f06-5ac55660e909/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-13 13:27:30,725 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 13:27:30,725 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 13:27:30,800 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 13:27:30,801 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 13:27:30,801 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 13:27:30,802 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 13:27:30,802 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 13:27:30,802 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 13:27:30,802 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 13:27:30,805 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 13:27:30,806 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 13:27:30,807 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 13:27:30,807 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 13:27:30,807 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 13:27:30,808 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 13:27:30,808 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 13:27:30,808 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 13:27:30,808 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 13:27:30,808 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 13:27:30,808 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 13:27:30,808 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 13:27:30,808 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 13:27:30,808 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 13:27:30,808 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 13:27:30,809 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 13:27:30,809 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 13:27:30,809 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 13:27:30,809 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 13:27:30,809 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 13:27:30,809 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 13:27:30,809 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 13:27:30,809 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:27:30,810 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 13:27:30,810 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 13:27:30,811 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 13:27:30,811 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 13:27:30,811 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 13:27:30,811 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 13:27:30,811 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 13:27:30,811 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 13:27:30,811 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 13:27:30,812 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_8a27d26d-587a-4667-8f06-5ac55660e909/bin/uautomizer-verify-qhAvR1uOyd Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 236e9a83f25840205b9c3455bfa2071e05298d6f23a3b7465f829136c71d4a4c [2024-11-13 13:27:31,257 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 13:27:31,267 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 13:27:31,270 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 13:27:31,272 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 13:27:31,272 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 13:27:31,274 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a27d26d-587a-4667-8f06-5ac55660e909/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-0.i Unable to find full path for "g++" [2024-11-13 13:27:33,788 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 13:27:34,116 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 13:27:34,120 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a27d26d-587a-4667-8f06-5ac55660e909/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-0.i [2024-11-13 13:27:34,134 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a27d26d-587a-4667-8f06-5ac55660e909/bin/uautomizer-verify-qhAvR1uOyd/data/09d054370/9c423caa50f540d3910bfe30426b681c/FLAGed61f3cb3 [2024-11-13 13:27:34,168 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a27d26d-587a-4667-8f06-5ac55660e909/bin/uautomizer-verify-qhAvR1uOyd/data/09d054370/9c423caa50f540d3910bfe30426b681c [2024-11-13 13:27:34,175 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 13:27:34,177 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 13:27:34,179 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 13:27:34,181 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 13:27:34,187 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 13:27:34,188 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:27:34" (1/1) ... [2024-11-13 13:27:34,189 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@491f346 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:27:34, skipping insertion in model container [2024-11-13 13:27:34,190 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:27:34" (1/1) ... [2024-11-13 13:27:34,223 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 13:27:34,452 WARN L250 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_8a27d26d-587a-4667-8f06-5ac55660e909/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-0.i[918,931] [2024-11-13 13:27:34,561 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:27:34,588 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 13:27:34,601 WARN L250 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_8a27d26d-587a-4667-8f06-5ac55660e909/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-0.i[918,931] [2024-11-13 13:27:34,629 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:27:34,654 INFO L204 MainTranslator]: Completed translation [2024-11-13 13:27:34,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:27:34 WrapperNode [2024-11-13 13:27:34,656 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 13:27:34,658 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 13:27:34,658 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 13:27:34,658 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 13:27:34,668 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:27:34" (1/1) ... [2024-11-13 13:27:34,689 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:27:34" (1/1) ... [2024-11-13 13:27:34,733 INFO L138 Inliner]: procedures = 27, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 106 [2024-11-13 13:27:34,734 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 13:27:34,734 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 13:27:34,735 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 13:27:34,735 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 13:27:34,749 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:27:34" (1/1) ... [2024-11-13 13:27:34,749 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:27:34" (1/1) ... [2024-11-13 13:27:34,755 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:27:34" (1/1) ... [2024-11-13 13:27:34,782 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-13 13:27:34,782 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:27:34" (1/1) ... [2024-11-13 13:27:34,783 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:27:34" (1/1) ... [2024-11-13 13:27:34,792 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:27:34" (1/1) ... [2024-11-13 13:27:34,797 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:27:34" (1/1) ... [2024-11-13 13:27:34,799 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:27:34" (1/1) ... [2024-11-13 13:27:34,801 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:27:34" (1/1) ... [2024-11-13 13:27:34,804 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 13:27:34,806 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 13:27:34,806 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 13:27:34,806 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 13:27:34,807 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:27:34" (1/1) ... [2024-11-13 13:27:34,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:27:34,851 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a27d26d-587a-4667-8f06-5ac55660e909/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:27:34,866 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a27d26d-587a-4667-8f06-5ac55660e909/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 13:27:34,871 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a27d26d-587a-4667-8f06-5ac55660e909/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 13:27:34,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 13:27:34,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 13:27:34,911 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 13:27:34,912 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 13:27:34,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 13:27:34,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 13:27:35,049 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 13:27:35,052 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 13:27:58,357 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-13 13:27:58,357 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 13:27:58,372 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 13:27:58,372 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 13:27:58,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:27:58 BoogieIcfgContainer [2024-11-13 13:27:58,373 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 13:27:58,376 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 13:27:58,376 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 13:27:58,383 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 13:27:58,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 01:27:34" (1/3) ... [2024-11-13 13:27:58,385 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c9ae238 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:27:58, skipping insertion in model container [2024-11-13 13:27:58,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:27:34" (2/3) ... [2024-11-13 13:27:58,385 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c9ae238 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:27:58, skipping insertion in model container [2024-11-13 13:27:58,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:27:58" (3/3) ... [2024-11-13 13:27:58,389 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-0.i [2024-11-13 13:27:58,411 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 13:27:58,413 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-0.i that has 2 procedures, 43 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 13:27:58,503 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 13:27:58,520 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2eb4ef69, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 13:27:58,521 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 13:27:58,526 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 32 states have internal predecessors, (45), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-13 13:27:58,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-13 13:27:58,540 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:27:58,540 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:27:58,541 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:27:58,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:27:58,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1134737847, now seen corresponding path program 1 times [2024-11-13 13:27:58,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:27:58,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [564933719] [2024-11-13 13:27:58,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:27:58,568 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 [2024-11-13 13:27:58,568 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a27d26d-587a-4667-8f06-5ac55660e909/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:27:58,573 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a27d26d-587a-4667-8f06-5ac55660e909/bin/uautomizer-verify-qhAvR1uOyd/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) [2024-11-13 13:27:58,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a27d26d-587a-4667-8f06-5ac55660e909/bin/uautomizer-verify-qhAvR1uOyd/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 [2024-11-13 13:28:00,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:00,884 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-13 13:28:00,891 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:28:00,930 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-13 13:28:00,931 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:28:00,931 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:28:00,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [564933719] [2024-11-13 13:28:00,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [564933719] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:28:00,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:28:00,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:28:00,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459475469] [2024-11-13 13:28:00,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:28:00,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 13:28:00,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:28:00,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 13:28:00,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 13:28:00,972 INFO L87 Difference]: Start difference. First operand has 43 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 32 states have internal predecessors, (45), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) 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, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-13 13:28:01,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:28:01,006 INFO L93 Difference]: Finished difference Result 78 states and 127 transitions. [2024-11-13 13:28:01,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 13:28:01,008 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, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 67 [2024-11-13 13:28:01,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:28:01,015 INFO L225 Difference]: With dead ends: 78 [2024-11-13 13:28:01,015 INFO L226 Difference]: Without dead ends: 38 [2024-11-13 13:28:01,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 13:28:01,022 INFO L432 NwaCegarLoop]: 53 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, 53 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 [2024-11-13 13:28:01,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:28:01,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-13 13:28:01,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-13 13:28:01,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-13 13:28:01,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 53 transitions. [2024-11-13 13:28:01,070 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 53 transitions. Word has length 67 [2024-11-13 13:28:01,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:28:01,070 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 53 transitions. [2024-11-13 13:28:01,071 INFO L472 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, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-13 13:28:01,072 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 53 transitions. [2024-11-13 13:28:01,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-13 13:28:01,075 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:28:01,075 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:28:01,100 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a27d26d-587a-4667-8f06-5ac55660e909/bin/uautomizer-verify-qhAvR1uOyd/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 [2024-11-13 13:28:01,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a27d26d-587a-4667-8f06-5ac55660e909/bin/uautomizer-verify-qhAvR1uOyd/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 [2024-11-13 13:28:01,276 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:28:01,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:28:01,277 INFO L85 PathProgramCache]: Analyzing trace with hash 622760957, now seen corresponding path program 1 times [2024-11-13 13:28:01,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:28:01,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [242397113] [2024-11-13 13:28:01,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:28:01,278 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 [2024-11-13 13:28:01,278 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a27d26d-587a-4667-8f06-5ac55660e909/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:28:01,284 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a27d26d-587a-4667-8f06-5ac55660e909/bin/uautomizer-verify-qhAvR1uOyd/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) [2024-11-13 13:28:01,286 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a27d26d-587a-4667-8f06-5ac55660e909/bin/uautomizer-verify-qhAvR1uOyd/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 [2024-11-13 13:28:03,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:03,492 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 13:28:03,497 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:28:09,155 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-13 13:28:09,155 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:28:09,155 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:28:09,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [242397113] [2024-11-13 13:28:09,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [242397113] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:28:09,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:28:09,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:28:09,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469468086] [2024-11-13 13:28:09,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:28:09,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:28:09,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:28:09,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:28:09,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:28:09,160 INFO L87 Difference]: Start difference. First operand 38 states and 53 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-13 13:28:14,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.72s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:28:18,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:28:22,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:28:27,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.67s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:28:31,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:28:31,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:28:31,686 INFO L93 Difference]: Finished difference Result 116 states and 162 transitions. [2024-11-13 13:28:31,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:28:31,920 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 67 [2024-11-13 13:28:31,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:28:31,922 INFO L225 Difference]: With dead ends: 116 [2024-11-13 13:28:31,922 INFO L226 Difference]: Without dead ends: 81 [2024-11-13 13:28:31,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:28:31,924 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 51 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 19 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.3s IncrementalHoareTripleChecker+Time [2024-11-13 13:28:31,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 147 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 11 Invalid, 5 Unknown, 0 Unchecked, 22.3s Time] [2024-11-13 13:28:31,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-13 13:28:31,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 71. [2024-11-13 13:28:31,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 50 states have (on average 1.3) internal successors, (65), 50 states have internal predecessors, (65), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-13 13:28:31,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 101 transitions. [2024-11-13 13:28:31,949 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 101 transitions. Word has length 67 [2024-11-13 13:28:31,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:28:31,950 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 101 transitions. [2024-11-13 13:28:31,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-13 13:28:31,951 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 101 transitions. [2024-11-13 13:28:31,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-13 13:28:31,952 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:28:31,953 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:28:31,991 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a27d26d-587a-4667-8f06-5ac55660e909/bin/uautomizer-verify-qhAvR1uOyd/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 [2024-11-13 13:28:32,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a27d26d-587a-4667-8f06-5ac55660e909/bin/uautomizer-verify-qhAvR1uOyd/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 [2024-11-13 13:28:32,154 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:28:32,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:28:32,154 INFO L85 PathProgramCache]: Analyzing trace with hash 229733947, now seen corresponding path program 1 times [2024-11-13 13:28:32,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:28:32,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [860169084] [2024-11-13 13:28:32,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:28:32,155 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 [2024-11-13 13:28:32,155 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a27d26d-587a-4667-8f06-5ac55660e909/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:28:32,158 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a27d26d-587a-4667-8f06-5ac55660e909/bin/uautomizer-verify-qhAvR1uOyd/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) [2024-11-13 13:28:32,160 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a27d26d-587a-4667-8f06-5ac55660e909/bin/uautomizer-verify-qhAvR1uOyd/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 [2024-11-13 13:28:34,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:34,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 13:28:34,377 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:28:41,013 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-13 13:28:41,017 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:28:41,018 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:28:41,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [860169084] [2024-11-13 13:28:41,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [860169084] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:28:41,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:28:41,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:28:41,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910978606] [2024-11-13 13:28:41,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:28:41,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:28:41,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:28:41,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:28:41,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:28:41,021 INFO L87 Difference]: Start difference. First operand 71 states and 101 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-13 13:28:45,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.34s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:28:49,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:28:54,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.35s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:28:59,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.66s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:29:03,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:29:07,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.39s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:29:11,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:29:16,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.34s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:29:21,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.65s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:29:25,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:29:25,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:29:25,076 INFO L93 Difference]: Finished difference Result 181 states and 257 transitions. [2024-11-13 13:29:25,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:29:25,333 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 67 [2024-11-13 13:29:25,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:29:25,342 INFO L225 Difference]: With dead ends: 181 [2024-11-13 13:29:25,343 INFO L226 Difference]: Without dead ends: 113 [2024-11-13 13:29:25,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:29:25,345 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 30 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 19 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 43.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 43.7s IncrementalHoareTripleChecker+Time [2024-11-13 13:29:25,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 136 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 12 Invalid, 10 Unknown, 0 Unchecked, 43.7s Time] [2024-11-13 13:29:25,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-13 13:29:25,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 95. [2024-11-13 13:29:25,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 64 states have (on average 1.25) internal successors, (80), 64 states have internal predecessors, (80), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-13 13:29:25,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 134 transitions. [2024-11-13 13:29:25,375 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 134 transitions. Word has length 67 [2024-11-13 13:29:25,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:29:25,376 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 134 transitions. [2024-11-13 13:29:25,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-13 13:29:25,377 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 134 transitions. [2024-11-13 13:29:25,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-13 13:29:25,379 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:29:25,379 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:29:25,410 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a27d26d-587a-4667-8f06-5ac55660e909/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-13 13:29:25,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a27d26d-587a-4667-8f06-5ac55660e909/bin/uautomizer-verify-qhAvR1uOyd/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 [2024-11-13 13:29:25,580 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:29:25,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:29:25,581 INFO L85 PathProgramCache]: Analyzing trace with hash 909792317, now seen corresponding path program 1 times [2024-11-13 13:29:25,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:29:25,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1551165509] [2024-11-13 13:29:25,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:29:25,582 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 [2024-11-13 13:29:25,582 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a27d26d-587a-4667-8f06-5ac55660e909/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:29:25,590 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a27d26d-587a-4667-8f06-5ac55660e909/bin/uautomizer-verify-qhAvR1uOyd/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) [2024-11-13 13:29:25,592 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a27d26d-587a-4667-8f06-5ac55660e909/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-13 13:29:27,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:27,702 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-13 13:29:27,708 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:30:03,213 WARN L286 SmtUtils]: Spent 5.30s on a formula simplification. DAG size of input: 4 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:30:15,133 WARN L286 SmtUtils]: Spent 7.15s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:30:22,079 WARN L286 SmtUtils]: Spent 6.83s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:30:33,169 WARN L286 SmtUtils]: Spent 8.35s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:30:37,217 WARN L851 $PredicateComparison]: unable to prove that (and (= c_~last_1_var_1_14~0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 27.0 5.0)))) (let ((.cse1 ((_ sign_extend 16) c_~last_1_var_1_6~0))) (let ((.cse0 (bvsgt (_ bv0 32) .cse1))) (or (and (not .cse0) (= c_~var_1_17~0 .cse1)) (and .cse0 (= (_ bv0 32) c_~var_1_17~0))))) (= (_ bv64 32) c_~last_1_var_1_17~0) (= (_ bv1 32) c_~last_1_var_1_7~0) (fp.lt (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode c_~last_1_var_1_14~0 c_~last_1_var_1_14~0)) ((_ to_fp 11 53) c_currentRoundingMode (/ 46.0 5.0))) ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_16~0)) (fp.leq c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (= c_~last_1_var_1_5~0 (_ bv2 32)) (= (_ bv1 32) c_~var_1_7~0) (= (_ bv0 32) c_~last_1_var_1_1~0) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-13 13:30:41,316 WARN L873 $PredicateComparison]: unable to prove that (and (= c_~last_1_var_1_14~0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 27.0 5.0)))) (let ((.cse1 ((_ sign_extend 16) c_~last_1_var_1_6~0))) (let ((.cse0 (bvsgt (_ bv0 32) .cse1))) (or (and (not .cse0) (= c_~var_1_17~0 .cse1)) (and .cse0 (= (_ bv0 32) c_~var_1_17~0))))) (= (_ bv64 32) c_~last_1_var_1_17~0) (= (_ bv1 32) c_~last_1_var_1_7~0) (fp.lt (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode c_~last_1_var_1_14~0 c_~last_1_var_1_14~0)) ((_ to_fp 11 53) c_currentRoundingMode (/ 46.0 5.0))) ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_16~0)) (fp.leq c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (= c_~last_1_var_1_5~0 (_ bv2 32)) (= (_ bv1 32) c_~var_1_7~0) (= (_ bv0 32) c_~last_1_var_1_1~0) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2024-11-13 13:30:48,776 WARN L286 SmtUtils]: Spent 6.64s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:31:00,375 WARN L286 SmtUtils]: Spent 7.29s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:31:14,305 WARN L286 SmtUtils]: Spent 6.53s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:31:22,754 WARN L286 SmtUtils]: Spent 8.35s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:31:26,807 WARN L851 $PredicateComparison]: unable to prove that (and (= c_~last_1_var_1_14~0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 27.0 5.0)))) (let ((.cse1 ((_ sign_extend 16) c_~last_1_var_1_6~0))) (let ((.cse0 (bvsgt (_ bv0 32) .cse1))) (or (and (not .cse0) (= c_~var_1_17~0 .cse1)) (and .cse0 (= (_ bv0 32) c_~var_1_17~0))))) (= (_ bv64 32) c_~last_1_var_1_17~0) (= (_ bv0 32) c_~var_1_1~0) (= (_ bv1 32) c_~last_1_var_1_7~0) (fp.lt (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode c_~last_1_var_1_14~0 c_~last_1_var_1_14~0)) ((_ to_fp 11 53) c_currentRoundingMode (/ 46.0 5.0))) ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_16~0)) (fp.leq c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (= c_~last_1_var_1_5~0 (_ bv2 32)) (= (_ bv1 32) c_~var_1_7~0) (= (_ bv0 32) c_~last_1_var_1_1~0) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-13 13:31:30,896 WARN L873 $PredicateComparison]: unable to prove that (and (= c_~last_1_var_1_14~0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 27.0 5.0)))) (let ((.cse1 ((_ sign_extend 16) c_~last_1_var_1_6~0))) (let ((.cse0 (bvsgt (_ bv0 32) .cse1))) (or (and (not .cse0) (= c_~var_1_17~0 .cse1)) (and .cse0 (= (_ bv0 32) c_~var_1_17~0))))) (= (_ bv64 32) c_~last_1_var_1_17~0) (= (_ bv0 32) c_~var_1_1~0) (= (_ bv1 32) c_~last_1_var_1_7~0) (fp.lt (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode c_~last_1_var_1_14~0 c_~last_1_var_1_14~0)) ((_ to_fp 11 53) c_currentRoundingMode (/ 46.0 5.0))) ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_16~0)) (fp.leq c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (= c_~last_1_var_1_5~0 (_ bv2 32)) (= (_ bv1 32) c_~var_1_7~0) (= (_ bv0 32) c_~last_1_var_1_1~0) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2024-11-13 13:31:39,664 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:31:48,978 WARN L286 SmtUtils]: Spent 6.67s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:31:55,048 WARN L286 SmtUtils]: Spent 5.70s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:32:04,339 WARN L286 SmtUtils]: Spent 5.28s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:32:13,058 WARN L286 SmtUtils]: Spent 8.35s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:32:21,579 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:32:33,834 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:32:44,087 WARN L286 SmtUtils]: Spent 5.82s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:32:52,227 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:33:00,892 WARN L286 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:33:09,903 WARN L286 SmtUtils]: Spent 5.10s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:33:18,201 WARN L286 SmtUtils]: Spent 8.30s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:33:32,401 WARN L286 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:33:41,929 WARN L286 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:33:53,590 WARN L286 SmtUtils]: Spent 8.30s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:34:02,038 WARN L286 SmtUtils]: Spent 8.45s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:34:06,114 WARN L851 $PredicateComparison]: unable to prove that (and (= c_~last_1_var_1_14~0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 27.0 5.0)))) (let ((.cse1 ((_ sign_extend 16) c_~last_1_var_1_6~0))) (let ((.cse0 (bvsgt (_ bv0 32) .cse1))) (or (and (not .cse0) (= c_~var_1_17~0 .cse1)) (and .cse0 (= (_ bv0 32) c_~var_1_17~0))))) (= (_ bv64 32) c_~last_1_var_1_17~0) (= c_~var_1_14~0 c_~var_1_16~0) (= (_ bv0 32) c_~var_1_1~0) (= (_ bv1 32) c_~last_1_var_1_7~0) (fp.lt (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode c_~last_1_var_1_14~0 c_~last_1_var_1_14~0)) ((_ to_fp 11 53) c_currentRoundingMode (/ 46.0 5.0))) ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_16~0)) (fp.leq c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (= c_~last_1_var_1_5~0 (_ bv2 32)) (= (_ bv1 32) c_~var_1_7~0) (= (_ bv0 32) c_~last_1_var_1_1~0) (not (fp.gt (fp.mul c_currentRoundingMode c_~var_1_12~0 ((_ to_fp 11 53) c_currentRoundingMode c_~last_1_var_1_14~0)) c_~var_1_13~0)) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-13 13:34:10,241 WARN L873 $PredicateComparison]: unable to prove that (and (= c_~last_1_var_1_14~0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 27.0 5.0)))) (let ((.cse1 ((_ sign_extend 16) c_~last_1_var_1_6~0))) (let ((.cse0 (bvsgt (_ bv0 32) .cse1))) (or (and (not .cse0) (= c_~var_1_17~0 .cse1)) (and .cse0 (= (_ bv0 32) c_~var_1_17~0))))) (= (_ bv64 32) c_~last_1_var_1_17~0) (= c_~var_1_14~0 c_~var_1_16~0) (= (_ bv0 32) c_~var_1_1~0) (= (_ bv1 32) c_~last_1_var_1_7~0) (fp.lt (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode c_~last_1_var_1_14~0 c_~last_1_var_1_14~0)) ((_ to_fp 11 53) c_currentRoundingMode (/ 46.0 5.0))) ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_16~0)) (fp.leq c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (= c_~last_1_var_1_5~0 (_ bv2 32)) (= (_ bv1 32) c_~var_1_7~0) (= (_ bv0 32) c_~last_1_var_1_1~0) (not (fp.gt (fp.mul c_currentRoundingMode c_~var_1_12~0 ((_ to_fp 11 53) c_currentRoundingMode c_~last_1_var_1_14~0)) c_~var_1_13~0)) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2024-11-13 13:34:19,895 WARN L286 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:34:28,196 WARN L286 SmtUtils]: Spent 8.30s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:34:37,863 WARN L286 SmtUtils]: Spent 8.29s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:34:44,890 WARN L286 SmtUtils]: Spent 7.03s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:34:56,578 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:35:04,792 WARN L286 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:35:11,833 WARN L286 SmtUtils]: Spent 7.04s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:35:22,330 WARN L286 SmtUtils]: Spent 8.33s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:35:30,597 WARN L286 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:35:39,187 WARN L286 SmtUtils]: Spent 8.59s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:35:43,278 WARN L851 $PredicateComparison]: unable to prove that (and (= c_~last_1_var_1_14~0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 27.0 5.0)))) (let ((.cse1 ((_ sign_extend 16) c_~last_1_var_1_6~0))) (let ((.cse0 (bvsgt (_ bv0 32) .cse1))) (or (and (not .cse0) (= c_~var_1_17~0 .cse1)) (and .cse0 (= (_ bv0 32) c_~var_1_17~0))))) (= (_ bv64 32) c_~last_1_var_1_17~0) (= c_~var_1_14~0 c_~var_1_16~0) (= (_ bv0 32) c_~var_1_1~0) (= (_ bv1 32) c_~last_1_var_1_7~0) (fp.lt (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode c_~last_1_var_1_14~0 c_~last_1_var_1_14~0)) ((_ to_fp 11 53) c_currentRoundingMode (/ 46.0 5.0))) ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_16~0)) (fp.leq c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (= c_~last_1_var_1_5~0 (_ bv2 32)) (= (_ bv1 32) c_~var_1_7~0) (= (_ bv0 32) c_~last_1_var_1_1~0) (not (fp.gt (fp.mul c_currentRoundingMode c_~var_1_12~0 ((_ to_fp 11 53) c_currentRoundingMode c_~last_1_var_1_14~0)) c_~var_1_13~0)) (= c_currentRoundingMode roundNearestTiesToEven) (= c_~var_1_5~0 (let ((.cse2 ((_ sign_extend 16) c_~var_1_6~0))) (bvadd .cse2 (bvneg .cse2) c_~var_1_17~0)))) is different from false [2024-11-13 13:35:47,399 WARN L873 $PredicateComparison]: unable to prove that (and (= c_~last_1_var_1_14~0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 27.0 5.0)))) (let ((.cse1 ((_ sign_extend 16) c_~last_1_var_1_6~0))) (let ((.cse0 (bvsgt (_ bv0 32) .cse1))) (or (and (not .cse0) (= c_~var_1_17~0 .cse1)) (and .cse0 (= (_ bv0 32) c_~var_1_17~0))))) (= (_ bv64 32) c_~last_1_var_1_17~0) (= c_~var_1_14~0 c_~var_1_16~0) (= (_ bv0 32) c_~var_1_1~0) (= (_ bv1 32) c_~last_1_var_1_7~0) (fp.lt (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode c_~last_1_var_1_14~0 c_~last_1_var_1_14~0)) ((_ to_fp 11 53) c_currentRoundingMode (/ 46.0 5.0))) ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_16~0)) (fp.leq c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (= c_~last_1_var_1_5~0 (_ bv2 32)) (= (_ bv1 32) c_~var_1_7~0) (= (_ bv0 32) c_~last_1_var_1_1~0) (not (fp.gt (fp.mul c_currentRoundingMode c_~var_1_12~0 ((_ to_fp 11 53) c_currentRoundingMode c_~last_1_var_1_14~0)) c_~var_1_13~0)) (= c_currentRoundingMode roundNearestTiesToEven) (= c_~var_1_5~0 (let ((.cse2 ((_ sign_extend 16) c_~var_1_6~0))) (bvadd .cse2 (bvneg .cse2) c_~var_1_17~0)))) is different from true [2024-11-13 13:35:55,244 WARN L286 SmtUtils]: Spent 7.78s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:36:03,610 WARN L286 SmtUtils]: Spent 8.37s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:36:11,911 WARN L286 SmtUtils]: Spent 8.30s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:36:21,959 WARN L286 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:36:31,370 WARN L286 SmtUtils]: Spent 8.30s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:36:39,694 WARN L286 SmtUtils]: Spent 8.32s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:36:48,845 WARN L286 SmtUtils]: Spent 8.30s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:36:57,150 WARN L286 SmtUtils]: Spent 8.30s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:37:07,448 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:37:15,679 WARN L286 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:37:26,920 WARN L286 SmtUtils]: Spent 8.30s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:37:38,107 WARN L286 SmtUtils]: Spent 8.56s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:37:46,361 WARN L286 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:37:50,440 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ sign_extend 16) c_~var_1_6~0))) (let ((.cse2 (bvneg .cse4))) (and (= c_~last_1_var_1_14~0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 27.0 5.0)))) (let ((.cse1 ((_ sign_extend 16) c_~last_1_var_1_6~0))) (let ((.cse0 (bvsgt (_ bv0 32) .cse1))) (or (and (not .cse0) (= c_~var_1_17~0 .cse1)) (and .cse0 (= (_ bv0 32) c_~var_1_17~0))))) (bvuge (_ bv4294967288 32) (bvadd c_~var_1_9~0 .cse2)) (= (_ bv64 32) c_~last_1_var_1_17~0) (= c_~var_1_14~0 c_~var_1_16~0) (= (_ bv0 32) c_~var_1_1~0) (= (_ bv1 32) c_~last_1_var_1_7~0) (fp.lt (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode c_~last_1_var_1_14~0 c_~last_1_var_1_14~0)) ((_ to_fp 11 53) c_currentRoundingMode (/ 46.0 5.0))) ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_16~0)) (fp.leq c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (= c_~last_1_var_1_5~0 (_ bv2 32)) (= (_ bv1 32) c_~var_1_7~0) (let ((.cse3 (= (_ bv0 8) c_~var_1_10~0))) (or (and (= (_ bv1 8) c_~var_1_8~0) .cse3) (and (not .cse3) (= (_ bv0 8) c_~var_1_8~0)))) (= (_ bv0 32) c_~last_1_var_1_1~0) (not (fp.gt (fp.mul c_currentRoundingMode c_~var_1_12~0 ((_ to_fp 11 53) c_currentRoundingMode c_~last_1_var_1_14~0)) c_~var_1_13~0)) (= c_currentRoundingMode roundNearestTiesToEven) (= c_~var_1_5~0 (bvadd .cse4 .cse2 c_~var_1_17~0))))) is different from false [2024-11-13 13:37:54,572 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ sign_extend 16) c_~var_1_6~0))) (let ((.cse2 (bvneg .cse4))) (and (= c_~last_1_var_1_14~0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 27.0 5.0)))) (let ((.cse1 ((_ sign_extend 16) c_~last_1_var_1_6~0))) (let ((.cse0 (bvsgt (_ bv0 32) .cse1))) (or (and (not .cse0) (= c_~var_1_17~0 .cse1)) (and .cse0 (= (_ bv0 32) c_~var_1_17~0))))) (bvuge (_ bv4294967288 32) (bvadd c_~var_1_9~0 .cse2)) (= (_ bv64 32) c_~last_1_var_1_17~0) (= c_~var_1_14~0 c_~var_1_16~0) (= (_ bv0 32) c_~var_1_1~0) (= (_ bv1 32) c_~last_1_var_1_7~0) (fp.lt (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode c_~last_1_var_1_14~0 c_~last_1_var_1_14~0)) ((_ to_fp 11 53) c_currentRoundingMode (/ 46.0 5.0))) ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_16~0)) (fp.leq c_~var_1_16~0 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (= c_~last_1_var_1_5~0 (_ bv2 32)) (= (_ bv1 32) c_~var_1_7~0) (let ((.cse3 (= (_ bv0 8) c_~var_1_10~0))) (or (and (= (_ bv1 8) c_~var_1_8~0) .cse3) (and (not .cse3) (= (_ bv0 8) c_~var_1_8~0)))) (= (_ bv0 32) c_~last_1_var_1_1~0) (not (fp.gt (fp.mul c_currentRoundingMode c_~var_1_12~0 ((_ to_fp 11 53) c_currentRoundingMode c_~last_1_var_1_14~0)) c_~var_1_13~0)) (= c_currentRoundingMode roundNearestTiesToEven) (= c_~var_1_5~0 (bvadd .cse4 .cse2 c_~var_1_17~0))))) is different from true