./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-78.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_6c14f4b2-49a8-4ce7-9145-63faee4d1cfb/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c14f4b2-49a8-4ce7-9145-63faee4d1cfb/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_6c14f4b2-49a8-4ce7-9145-63faee4d1cfb/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c14f4b2-49a8-4ce7-9145-63faee4d1cfb/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-78.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c14f4b2-49a8-4ce7-9145-63faee4d1cfb/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_6c14f4b2-49a8-4ce7-9145-63faee4d1cfb/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 e6bb6165a865ae599fbbbb878eea3788e6b54201c0af68fa4b08e901e99cc922 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 15:05:13,373 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 15:05:13,470 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c14f4b2-49a8-4ce7-9145-63faee4d1cfb/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 15:05:13,481 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 15:05:13,482 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 15:05:13,529 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 15:05:13,532 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 15:05:13,533 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 15:05:13,534 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 15:05:13,534 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 15:05:13,534 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 15:05:13,534 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 15:05:13,535 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 15:05:13,535 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 15:05:13,536 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 15:05:13,537 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 15:05:13,537 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 15:05:13,537 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 15:05:13,537 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 15:05:13,537 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 15:05:13,538 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 15:05:13,538 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 15:05:13,538 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 15:05:13,538 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 15:05:13,539 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 15:05:13,539 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 15:05:13,539 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 15:05:13,539 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 15:05:13,540 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 15:05:13,540 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 15:05:13,540 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 15:05:13,540 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 15:05:13,541 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:05:13,541 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 15:05:13,541 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 15:05:13,541 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 15:05:13,542 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 15:05:13,542 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 15:05:13,543 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 15:05:13,543 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 15:05:13,543 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 15:05:13,543 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 15:05:13,543 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_6c14f4b2-49a8-4ce7-9145-63faee4d1cfb/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 -> e6bb6165a865ae599fbbbb878eea3788e6b54201c0af68fa4b08e901e99cc922 [2024-11-13 15:05:13,901 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 15:05:13,911 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 15:05:13,915 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 15:05:13,916 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 15:05:13,917 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 15:05:13,918 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c14f4b2-49a8-4ce7-9145-63faee4d1cfb/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-78.i Unable to find full path for "g++" [2024-11-13 15:05:16,101 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 15:05:16,423 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 15:05:16,423 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c14f4b2-49a8-4ce7-9145-63faee4d1cfb/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-78.i [2024-11-13 15:05:16,433 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c14f4b2-49a8-4ce7-9145-63faee4d1cfb/bin/uautomizer-verify-qhAvR1uOyd/data/b41599708/27bd6dd0759f4610b790512ff67f8356/FLAGe02cd2c8a [2024-11-13 15:05:16,450 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c14f4b2-49a8-4ce7-9145-63faee4d1cfb/bin/uautomizer-verify-qhAvR1uOyd/data/b41599708/27bd6dd0759f4610b790512ff67f8356 [2024-11-13 15:05:16,452 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 15:05:16,454 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 15:05:16,455 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 15:05:16,456 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 15:05:16,460 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 15:05:16,460 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:05:16" (1/1) ... [2024-11-13 15:05:16,461 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d4bcc88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:05:16, skipping insertion in model container [2024-11-13 15:05:16,462 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:05:16" (1/1) ... [2024-11-13 15:05:16,483 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 15:05:16,679 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_6c14f4b2-49a8-4ce7-9145-63faee4d1cfb/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-78.i[916,929] [2024-11-13 15:05:16,723 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:05:16,738 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 15:05:16,749 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_6c14f4b2-49a8-4ce7-9145-63faee4d1cfb/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-78.i[916,929] [2024-11-13 15:05:16,770 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:05:16,786 INFO L204 MainTranslator]: Completed translation [2024-11-13 15:05:16,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:05:16 WrapperNode [2024-11-13 15:05:16,787 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 15:05:16,788 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 15:05:16,788 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 15:05:16,788 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 15:05:16,795 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:05:16" (1/1) ... [2024-11-13 15:05:16,803 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:05:16" (1/1) ... [2024-11-13 15:05:16,830 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 100 [2024-11-13 15:05:16,831 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 15:05:16,831 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 15:05:16,832 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 15:05:16,832 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 15:05:16,845 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:05:16" (1/1) ... [2024-11-13 15:05:16,845 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:05:16" (1/1) ... [2024-11-13 15:05:16,848 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:05:16" (1/1) ... [2024-11-13 15:05:16,872 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 15:05:16,876 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:05:16" (1/1) ... [2024-11-13 15:05:16,876 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:05:16" (1/1) ... [2024-11-13 15:05:16,887 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:05:16" (1/1) ... [2024-11-13 15:05:16,895 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:05:16" (1/1) ... [2024-11-13 15:05:16,897 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:05:16" (1/1) ... [2024-11-13 15:05:16,898 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:05:16" (1/1) ... [2024-11-13 15:05:16,901 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 15:05:16,902 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 15:05:16,902 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 15:05:16,902 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 15:05:16,903 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:05:16" (1/1) ... [2024-11-13 15:05:16,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:05:16,927 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c14f4b2-49a8-4ce7-9145-63faee4d1cfb/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:05:16,949 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c14f4b2-49a8-4ce7-9145-63faee4d1cfb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 15:05:16,953 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c14f4b2-49a8-4ce7-9145-63faee4d1cfb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 15:05:16,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 15:05:16,978 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 15:05:16,979 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 15:05:16,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 15:05:16,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 15:05:16,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 15:05:17,061 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 15:05:17,063 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 15:05:17,339 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-13 15:05:17,339 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 15:05:17,352 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 15:05:17,353 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 15:05:17,353 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:05:17 BoogieIcfgContainer [2024-11-13 15:05:17,353 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 15:05:17,356 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 15:05:17,356 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 15:05:17,361 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 15:05:17,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 03:05:16" (1/3) ... [2024-11-13 15:05:17,363 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@319582a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:05:17, skipping insertion in model container [2024-11-13 15:05:17,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:05:16" (2/3) ... [2024-11-13 15:05:17,363 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@319582a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:05:17, skipping insertion in model container [2024-11-13 15:05:17,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:05:17" (3/3) ... [2024-11-13 15:05:17,365 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-78.i [2024-11-13 15:05:17,383 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 15:05:17,385 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-78.i that has 2 procedures, 48 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 15:05:17,468 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 15:05:17,487 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;@63ba35c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 15:05:17,487 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 15:05:17,492 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-13 15:05:17,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-13 15:05:17,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:05:17,506 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:05:17,506 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:05:17,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:05:17,512 INFO L85 PathProgramCache]: Analyzing trace with hash 998516227, now seen corresponding path program 1 times [2024-11-13 15:05:17,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:05:17,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742669167] [2024-11-13 15:05:17,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:05:17,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:05:17,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:17,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:05:17,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:17,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 15:05:17,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:17,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 15:05:17,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:17,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 15:05:17,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:17,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 15:05:17,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:17,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 15:05:17,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:17,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:05:17,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:17,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 15:05:17,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:17,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 15:05:17,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:17,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 15:05:17,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:17,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 15:05:17,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:17,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:05:17,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:17,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 15:05:17,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:17,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 15:05:17,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:17,909 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 15:05:17,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:05:17,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742669167] [2024-11-13 15:05:17,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742669167] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:05:17,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:05:17,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:05:17,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587020899] [2024-11-13 15:05:17,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:05:17,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 15:05:17,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:05:17,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 15:05:17,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 15:05:17,943 INFO L87 Difference]: Start difference. First operand has 48 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-13 15:05:17,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:05:17,994 INFO L93 Difference]: Finished difference Result 89 states and 148 transitions. [2024-11-13 15:05:17,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 15:05:17,999 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 92 [2024-11-13 15:05:18,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:05:18,009 INFO L225 Difference]: With dead ends: 89 [2024-11-13 15:05:18,009 INFO L226 Difference]: Without dead ends: 44 [2024-11-13 15:05:18,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 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 15:05:18,018 INFO L432 NwaCegarLoop]: 63 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, 63 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 15:05:18,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:05:18,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-13 15:05:18,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-11-13 15:05:18,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-13 15:05:18,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 63 transitions. [2024-11-13 15:05:18,079 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 63 transitions. Word has length 92 [2024-11-13 15:05:18,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:05:18,080 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 63 transitions. [2024-11-13 15:05:18,080 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-13 15:05:18,082 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 63 transitions. [2024-11-13 15:05:18,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-13 15:05:18,087 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:05:18,087 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:05:18,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 15:05:18,089 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:05:18,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:05:18,090 INFO L85 PathProgramCache]: Analyzing trace with hash 821077187, now seen corresponding path program 1 times [2024-11-13 15:05:18,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:05:18,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899325024] [2024-11-13 15:05:18,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:05:18,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:05:18,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:18,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:05:18,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:18,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 15:05:18,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:18,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 15:05:18,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:18,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 15:05:18,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:18,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 15:05:18,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:18,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 15:05:18,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:18,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:05:18,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:18,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 15:05:18,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:18,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 15:05:18,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:18,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 15:05:18,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:18,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 15:05:18,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:18,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:05:18,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:18,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 15:05:18,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:18,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 15:05:18,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:18,746 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 15:05:18,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:05:18,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899325024] [2024-11-13 15:05:18,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899325024] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:05:18,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:05:18,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:05:18,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117049440] [2024-11-13 15:05:18,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:05:18,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:05:18,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:05:18,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:05:18,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:05:18,752 INFO L87 Difference]: Start difference. First operand 44 states and 63 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 15:05:18,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:05:18,876 INFO L93 Difference]: Finished difference Result 126 states and 183 transitions. [2024-11-13 15:05:18,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:05:18,878 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 92 [2024-11-13 15:05:18,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:05:18,880 INFO L225 Difference]: With dead ends: 126 [2024-11-13 15:05:18,881 INFO L226 Difference]: Without dead ends: 85 [2024-11-13 15:05:18,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 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 15:05:18,884 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 29 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:05:18,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 170 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:05:18,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-13 15:05:18,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2024-11-13 15:05:18,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 51 states have internal predecessors, (62), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-13 15:05:18,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 118 transitions. [2024-11-13 15:05:18,926 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 118 transitions. Word has length 92 [2024-11-13 15:05:18,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:05:18,926 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 118 transitions. [2024-11-13 15:05:18,926 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 15:05:18,927 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 118 transitions. [2024-11-13 15:05:18,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-13 15:05:18,929 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:05:18,929 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:05:18,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 15:05:18,932 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:05:18,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:05:18,933 INFO L85 PathProgramCache]: Analyzing trace with hash 822924229, now seen corresponding path program 1 times [2024-11-13 15:05:18,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:05:18,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96455295] [2024-11-13 15:05:18,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:05:18,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:05:19,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:21,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:05:21,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:21,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 15:05:21,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:21,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 15:05:21,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:21,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 15:05:21,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:21,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 15:05:21,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:21,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 15:05:21,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:21,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:05:21,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:21,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 15:05:21,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:21,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 15:05:21,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:21,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 15:05:21,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:21,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 15:05:21,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:21,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:05:21,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:21,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 15:05:21,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:21,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 15:05:21,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:21,600 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 15:05:21,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:05:21,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96455295] [2024-11-13 15:05:21,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96455295] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:05:21,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:05:21,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 15:05:21,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684632904] [2024-11-13 15:05:21,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:05:21,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 15:05:21,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:05:21,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 15:05:21,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-13 15:05:21,606 INFO L87 Difference]: Start difference. First operand 82 states and 118 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 15:05:22,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:05:22,320 INFO L93 Difference]: Finished difference Result 159 states and 211 transitions. [2024-11-13 15:05:22,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 15:05:22,321 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 92 [2024-11-13 15:05:22,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:05:22,323 INFO L225 Difference]: With dead ends: 159 [2024-11-13 15:05:22,324 INFO L226 Difference]: Without dead ends: 157 [2024-11-13 15:05:22,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2024-11-13 15:05:22,325 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 149 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 15:05:22,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 400 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 15:05:22,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-13 15:05:22,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 129. [2024-11-13 15:05:22,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 82 states have (on average 1.170731707317073) internal successors, (96), 84 states have internal predecessors, (96), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-13 15:05:22,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 180 transitions. [2024-11-13 15:05:22,383 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 180 transitions. Word has length 92 [2024-11-13 15:05:22,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:05:22,384 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 180 transitions. [2024-11-13 15:05:22,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 15:05:22,384 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 180 transitions. [2024-11-13 15:05:22,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-13 15:05:22,389 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:05:22,389 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:05:22,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 15:05:22,390 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:05:22,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:05:22,390 INFO L85 PathProgramCache]: Analyzing trace with hash 429897219, now seen corresponding path program 1 times [2024-11-13 15:05:22,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:05:22,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233038362] [2024-11-13 15:05:22,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:05:22,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:05:22,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:05:22,456 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 15:05:22,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:05:22,540 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 15:05:22,541 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 15:05:22,542 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 15:05:22,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 15:05:22,548 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-13 15:05:22,639 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 15:05:22,643 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 03:05:22 BoogieIcfgContainer [2024-11-13 15:05:22,644 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 15:05:22,644 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 15:05:22,644 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 15:05:22,645 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 15:05:22,645 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:05:17" (3/4) ... [2024-11-13 15:05:22,648 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 15:05:22,649 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 15:05:22,650 INFO L158 Benchmark]: Toolchain (without parser) took 6195.98ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 92.2MB in the beginning and 71.2MB in the end (delta: 21.0MB). Peak memory consumption was 47.0MB. Max. memory is 16.1GB. [2024-11-13 15:05:22,650 INFO L158 Benchmark]: CDTParser took 0.51ms. Allocated memory is still 117.4MB. Free memory is still 74.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 15:05:22,651 INFO L158 Benchmark]: CACSL2BoogieTranslator took 331.85ms. Allocated memory is still 117.4MB. Free memory was 92.0MB in the beginning and 79.7MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 15:05:22,651 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.36ms. Allocated memory is still 117.4MB. Free memory was 79.7MB in the beginning and 78.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 15:05:22,652 INFO L158 Benchmark]: Boogie Preprocessor took 69.52ms. Allocated memory is still 117.4MB. Free memory was 78.0MB in the beginning and 75.9MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 15:05:22,652 INFO L158 Benchmark]: RCFGBuilder took 451.73ms. Allocated memory is still 117.4MB. Free memory was 75.9MB in the beginning and 62.0MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 15:05:22,653 INFO L158 Benchmark]: TraceAbstraction took 5287.58ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 61.3MB in the beginning and 71.3MB in the end (delta: -10.0MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. [2024-11-13 15:05:22,653 INFO L158 Benchmark]: Witness Printer took 4.97ms. Allocated memory is still 142.6MB. Free memory was 71.3MB in the beginning and 71.2MB in the end (delta: 21.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 15:05:22,655 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.51ms. Allocated memory is still 117.4MB. Free memory is still 74.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 331.85ms. Allocated memory is still 117.4MB. Free memory was 92.0MB in the beginning and 79.7MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.36ms. Allocated memory is still 117.4MB. Free memory was 79.7MB in the beginning and 78.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 69.52ms. Allocated memory is still 117.4MB. Free memory was 78.0MB in the beginning and 75.9MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 451.73ms. Allocated memory is still 117.4MB. Free memory was 75.9MB in the beginning and 62.0MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5287.58ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 61.3MB in the beginning and 71.3MB in the end (delta: -10.0MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. * Witness Printer took 4.97ms. Allocated memory is still 142.6MB. Free memory was 71.3MB in the beginning and 71.2MB in the end (delta: 21.1kB). 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 to_int at line 90, overapproximation of someBinaryFLOATComparisonOperation at line 36, overapproximation of someBinaryFLOATComparisonOperation at line 90. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -200; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 1; [L25] signed long int var_1_9 = 100; [L26] signed long int var_1_10 = 4; [L27] signed long int var_1_11 = 128; [L28] signed long int var_1_12 = 128; [L29] signed long int var_1_13 = 0; [L30] signed long int var_1_14 = 127; [L31] unsigned char var_1_15 = 1; [L32] unsigned char var_1_16 = 16; VAL [isInitial=0, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_9=100] [L94] isInitial = 1 [L95] FCALL initially() [L96] COND TRUE 1 [L97] FCALL updateLastVariables() [L98] CALL updateVariables() [L65] var_1_2 = __VERIFIER_nondet_uchar() [L66] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_3=1, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_3=1, var_1_9=100] [L66] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_3=1, var_1_9=100] [L67] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=1, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=1, var_1_9=100] [L67] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=1, var_1_9=100] [L68] var_1_3 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_9=100] [L69] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_9=100] [L70] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L70] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L71] var_1_10 = __VERIFIER_nondet_long() [L72] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L72] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_10=2147483646, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L73] CALL assume_abort_if_not(var_1_10 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L73] RET assume_abort_if_not(var_1_10 <= 2147483647) VAL [isInitial=1, var_1_10=2147483646, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L74] var_1_11 = __VERIFIER_nondet_long() [L75] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L75] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L76] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L76] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L77] var_1_13 = __VERIFIER_nondet_long() [L78] CALL assume_abort_if_not(var_1_13 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=2147483647, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=2147483647, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L78] RET assume_abort_if_not(var_1_13 >= 2147483647) VAL [isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=2147483647, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L79] CALL assume_abort_if_not(var_1_13 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=2147483647, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=2147483647, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L79] RET assume_abort_if_not(var_1_13 <= 2147483647) VAL [isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=2147483647, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L80] var_1_14 = __VERIFIER_nondet_long() [L81] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L81] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L82] CALL assume_abort_if_not(var_1_14 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L82] RET assume_abort_if_not(var_1_14 <= 2147483647) VAL [isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L83] var_1_16 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L84] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L85] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_16=0, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_16=0, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L85] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_16=0, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L98] RET updateVariables() [L99] CALL step() [L36] COND FALSE !(0.8f > (- var_1_10)) VAL [isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_16=0, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L39] unsigned char stepLocal_1 = var_1_15 > var_1_15; [L40] unsigned char stepLocal_0 = var_1_3; VAL [isInitial=1, stepLocal_0=-256, stepLocal_1=0, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_16=0, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L41] COND FALSE !(var_1_2 && stepLocal_0) VAL [isInitial=1, stepLocal_1=0, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_16=0, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L48] COND TRUE \read(var_1_2) [L49] var_1_9 = (var_1_10 - var_1_11) VAL [isInitial=1, stepLocal_1=0, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_16=0, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=0] [L57] signed long int stepLocal_2 = var_1_1; VAL [isInitial=1, stepLocal_1=0, stepLocal_2=-200, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_16=0, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=0] [L58] COND FALSE !(stepLocal_2 <= ((((8u) < 0 ) ? -(8u) : (8u)))) [L61] var_1_12 = ((var_1_13 - var_1_14) - var_1_11) VAL [isInitial=1, stepLocal_1=0, var_1_10=2147483646, var_1_11=2147483646, var_1_12=1, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_16=0, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=0] [L99] RET step() [L100] CALL, EXPR property() [L90-L91] return ((((var_1_2 && var_1_3) ? ((var_1_2 && (var_1_15 > var_1_15)) ? (var_1_1 == ((signed long int) (var_1_15 - var_1_15))) : (var_1_1 == ((signed long int) ((var_1_15 + 5) - var_1_15)))) : 1) && (var_1_2 ? (var_1_9 == ((signed long int) (var_1_10 - var_1_11))) : ((var_1_1 < var_1_15) ? (var_1_9 == ((signed long int) ((((var_1_11) > (var_1_10)) ? (var_1_11) : (var_1_10))))) : (var_1_9 == ((signed long int) var_1_10))))) && ((var_1_1 <= ((((8u) < 0 ) ? -(8u) : (8u)))) ? (var_1_12 == ((signed long int) (var_1_10 - 99.5))) : (var_1_12 == ((signed long int) ((var_1_13 - var_1_14) - var_1_11))))) && ((0.8f > (- var_1_10)) ? (var_1_15 == ((unsigned char) var_1_16)) : 1) ; VAL [\result=0, isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=1, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_16=0, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=0] [L100] RET, EXPR property() [L100] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=1, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_16=0, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=1, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_16=0, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 48 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.1s, OverallIterations: 4, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 178 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 178 mSDsluCounter, 633 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 422 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 241 IncrementalHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 211 mSDtfsCounter, 241 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=129occurred in iteration=3, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 31 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 368 NumberOfCodeBlocks, 368 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 273 ConstructedInterpolants, 0 QuantifiedInterpolants, 966 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 1092/1092 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 15:05:22,689 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c14f4b2-49a8-4ce7-9145-63faee4d1cfb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c14f4b2-49a8-4ce7-9145-63faee4d1cfb/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c14f4b2-49a8-4ce7-9145-63faee4d1cfb/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_6c14f4b2-49a8-4ce7-9145-63faee4d1cfb/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c14f4b2-49a8-4ce7-9145-63faee4d1cfb/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-78.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c14f4b2-49a8-4ce7-9145-63faee4d1cfb/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_6c14f4b2-49a8-4ce7-9145-63faee4d1cfb/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 e6bb6165a865ae599fbbbb878eea3788e6b54201c0af68fa4b08e901e99cc922 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 15:05:25,513 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 15:05:25,632 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c14f4b2-49a8-4ce7-9145-63faee4d1cfb/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-13 15:05:25,642 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 15:05:25,642 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 15:05:25,682 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 15:05:25,683 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 15:05:25,684 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 15:05:25,684 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 15:05:25,685 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 15:05:25,686 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 15:05:25,686 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 15:05:25,686 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 15:05:25,686 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 15:05:25,687 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 15:05:25,687 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 15:05:25,687 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 15:05:25,687 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 15:05:25,687 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 15:05:25,688 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 15:05:25,688 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 15:05:25,688 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 15:05:25,688 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 15:05:25,688 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 15:05:25,688 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 15:05:25,688 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 15:05:25,688 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 15:05:25,688 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 15:05:25,688 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 15:05:25,689 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 15:05:25,689 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 15:05:25,689 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 15:05:25,689 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 15:05:25,689 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 15:05:25,689 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:05:25,689 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 15:05:25,689 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 15:05:25,689 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 15:05:25,690 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 15:05:25,690 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 15:05:25,690 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 15:05:25,690 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 15:05:25,690 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 15:05:25,690 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 15:05:25,690 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_6c14f4b2-49a8-4ce7-9145-63faee4d1cfb/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 -> e6bb6165a865ae599fbbbb878eea3788e6b54201c0af68fa4b08e901e99cc922 [2024-11-13 15:05:26,022 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 15:05:26,030 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 15:05:26,032 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 15:05:26,034 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 15:05:26,034 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 15:05:26,035 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c14f4b2-49a8-4ce7-9145-63faee4d1cfb/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-78.i Unable to find full path for "g++" [2024-11-13 15:05:28,179 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 15:05:28,530 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 15:05:28,531 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c14f4b2-49a8-4ce7-9145-63faee4d1cfb/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-78.i [2024-11-13 15:05:28,548 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c14f4b2-49a8-4ce7-9145-63faee4d1cfb/bin/uautomizer-verify-qhAvR1uOyd/data/c3c782dc7/0ecdcd9a31e24090a534d2da8eceb0aa/FLAGe50513d80 [2024-11-13 15:05:28,575 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c14f4b2-49a8-4ce7-9145-63faee4d1cfb/bin/uautomizer-verify-qhAvR1uOyd/data/c3c782dc7/0ecdcd9a31e24090a534d2da8eceb0aa [2024-11-13 15:05:28,578 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 15:05:28,579 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 15:05:28,581 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 15:05:28,581 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 15:05:28,586 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 15:05:28,587 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:05:28" (1/1) ... [2024-11-13 15:05:28,588 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ebe7064 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:05:28, skipping insertion in model container [2024-11-13 15:05:28,589 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:05:28" (1/1) ... [2024-11-13 15:05:28,611 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 15:05:28,818 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_6c14f4b2-49a8-4ce7-9145-63faee4d1cfb/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-78.i[916,929] [2024-11-13 15:05:28,906 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:05:28,933 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 15:05:28,951 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_6c14f4b2-49a8-4ce7-9145-63faee4d1cfb/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-78.i[916,929] [2024-11-13 15:05:28,987 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:05:29,013 INFO L204 MainTranslator]: Completed translation [2024-11-13 15:05:29,015 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:05:29 WrapperNode [2024-11-13 15:05:29,016 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 15:05:29,017 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 15:05:29,017 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 15:05:29,017 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 15:05:29,026 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:05:29" (1/1) ... [2024-11-13 15:05:29,043 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:05:29" (1/1) ... [2024-11-13 15:05:29,081 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 96 [2024-11-13 15:05:29,083 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 15:05:29,084 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 15:05:29,084 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 15:05:29,084 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 15:05:29,095 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:05:29" (1/1) ... [2024-11-13 15:05:29,095 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:05:29" (1/1) ... [2024-11-13 15:05:29,099 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:05:29" (1/1) ... [2024-11-13 15:05:29,123 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 15:05:29,124 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:05:29" (1/1) ... [2024-11-13 15:05:29,124 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:05:29" (1/1) ... [2024-11-13 15:05:29,140 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:05:29" (1/1) ... [2024-11-13 15:05:29,148 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:05:29" (1/1) ... [2024-11-13 15:05:29,150 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:05:29" (1/1) ... [2024-11-13 15:05:29,154 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:05:29" (1/1) ... [2024-11-13 15:05:29,164 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 15:05:29,165 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 15:05:29,165 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 15:05:29,165 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 15:05:29,167 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:05:29" (1/1) ... [2024-11-13 15:05:29,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:05:29,204 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c14f4b2-49a8-4ce7-9145-63faee4d1cfb/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:05:29,222 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c14f4b2-49a8-4ce7-9145-63faee4d1cfb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 15:05:29,228 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c14f4b2-49a8-4ce7-9145-63faee4d1cfb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 15:05:29,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 15:05:29,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 15:05:29,261 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 15:05:29,261 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 15:05:29,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 15:05:29,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 15:05:29,370 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 15:05:29,373 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 15:05:32,866 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-13 15:05:32,867 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 15:05:32,880 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 15:05:32,880 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 15:05:32,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:05:32 BoogieIcfgContainer [2024-11-13 15:05:32,881 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 15:05:32,885 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 15:05:32,885 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 15:05:32,893 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 15:05:32,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 03:05:28" (1/3) ... [2024-11-13 15:05:32,894 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5288c947 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:05:32, skipping insertion in model container [2024-11-13 15:05:32,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:05:29" (2/3) ... [2024-11-13 15:05:32,896 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5288c947 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:05:32, skipping insertion in model container [2024-11-13 15:05:32,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:05:32" (3/3) ... [2024-11-13 15:05:32,898 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-78.i [2024-11-13 15:05:32,919 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 15:05:32,922 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-78.i that has 2 procedures, 48 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 15:05:33,003 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 15:05:33,017 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;@449db91d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 15:05:33,017 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 15:05:33,022 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-13 15:05:33,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-13 15:05:33,035 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:05:33,036 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:05:33,036 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:05:33,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:05:33,043 INFO L85 PathProgramCache]: Analyzing trace with hash 998516227, now seen corresponding path program 1 times [2024-11-13 15:05:33,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:05:33,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1485857077] [2024-11-13 15:05:33,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:05:33,085 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 15:05:33,085 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c14f4b2-49a8-4ce7-9145-63faee4d1cfb/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:05:33,094 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c14f4b2-49a8-4ce7-9145-63faee4d1cfb/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 15:05:33,097 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c14f4b2-49a8-4ce7-9145-63faee4d1cfb/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 15:05:33,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:33,376 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-13 15:05:33,384 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:05:33,428 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2024-11-13 15:05:33,428 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:05:33,429 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:05:33,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1485857077] [2024-11-13 15:05:33,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1485857077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:05:33,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:05:33,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:05:33,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618688064] [2024-11-13 15:05:33,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:05:33,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 15:05:33,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:05:33,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 15:05:33,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 15:05:33,471 INFO L87 Difference]: Start difference. First operand has 48 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) 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, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-13 15:05:33,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:05:33,511 INFO L93 Difference]: Finished difference Result 89 states and 148 transitions. [2024-11-13 15:05:33,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 15:05:33,514 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, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 92 [2024-11-13 15:05:33,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:05:33,524 INFO L225 Difference]: With dead ends: 89 [2024-11-13 15:05:33,524 INFO L226 Difference]: Without dead ends: 44 [2024-11-13 15:05:33,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 91 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 15:05:33,535 INFO L432 NwaCegarLoop]: 63 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, 63 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 15:05:33,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:05:33,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-13 15:05:33,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-11-13 15:05:33,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-13 15:05:33,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 63 transitions. [2024-11-13 15:05:33,596 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 63 transitions. Word has length 92 [2024-11-13 15:05:33,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:05:33,597 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 63 transitions. [2024-11-13 15:05:33,597 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, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-13 15:05:33,597 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 63 transitions. [2024-11-13 15:05:33,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-13 15:05:33,604 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:05:33,604 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:05:33,612 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c14f4b2-49a8-4ce7-9145-63faee4d1cfb/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 15:05:33,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c14f4b2-49a8-4ce7-9145-63faee4d1cfb/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 15:05:33,806 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:05:33,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:05:33,808 INFO L85 PathProgramCache]: Analyzing trace with hash 821077187, now seen corresponding path program 1 times [2024-11-13 15:05:33,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:05:33,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [321433413] [2024-11-13 15:05:33,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:05:33,812 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 15:05:33,812 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c14f4b2-49a8-4ce7-9145-63faee4d1cfb/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:05:33,815 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c14f4b2-49a8-4ce7-9145-63faee4d1cfb/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 15:05:33,820 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c14f4b2-49a8-4ce7-9145-63faee4d1cfb/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 15:05:34,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:34,095 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 15:05:34,101 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:05:34,979 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 15:05:34,979 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:05:34,980 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:05:34,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [321433413] [2024-11-13 15:05:34,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [321433413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:05:34,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:05:34,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:05:34,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281586353] [2024-11-13 15:05:34,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:05:34,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:05:34,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:05:34,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:05:34,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:05:34,985 INFO L87 Difference]: Start difference. First operand 44 states and 63 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 15:05:36,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:05:37,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:05:39,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.47s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:05:39,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:05:39,856 INFO L93 Difference]: Finished difference Result 126 states and 183 transitions. [2024-11-13 15:05:39,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:05:39,877 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 92 [2024-11-13 15:05:39,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:05:39,890 INFO L225 Difference]: With dead ends: 126 [2024-11-13 15:05:39,890 INFO L226 Difference]: Without dead ends: 85 [2024-11-13 15:05:39,891 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 89 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 15:05:39,894 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 12 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-11-13 15:05:39,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 170 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-11-13 15:05:39,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-13 15:05:39,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2024-11-13 15:05:39,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 51 states have internal predecessors, (62), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-13 15:05:39,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 118 transitions. [2024-11-13 15:05:39,942 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 118 transitions. Word has length 92 [2024-11-13 15:05:39,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:05:39,943 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 118 transitions. [2024-11-13 15:05:39,943 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 15:05:39,943 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 118 transitions. [2024-11-13 15:05:39,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-13 15:05:39,947 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:05:39,947 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:05:39,954 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c14f4b2-49a8-4ce7-9145-63faee4d1cfb/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 15:05:40,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c14f4b2-49a8-4ce7-9145-63faee4d1cfb/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 15:05:40,148 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:05:40,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:05:40,149 INFO L85 PathProgramCache]: Analyzing trace with hash 822924229, now seen corresponding path program 1 times [2024-11-13 15:05:40,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:05:40,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1321517147] [2024-11-13 15:05:40,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:05:40,150 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 15:05:40,150 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c14f4b2-49a8-4ce7-9145-63faee4d1cfb/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:05:40,153 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c14f4b2-49a8-4ce7-9145-63faee4d1cfb/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 15:05:40,156 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c14f4b2-49a8-4ce7-9145-63faee4d1cfb/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 15:05:40,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:05:40,359 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 15:05:40,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:05:40,525 ERROR L246 FreeRefinementEngine]: Caught known exception: Invalid model [2024-11-13 15:05:40,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1802937448] [2024-11-13 15:05:40,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:05:40,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:05:40,526 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c14f4b2-49a8-4ce7-9145-63faee4d1cfb/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:05:40,530 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c14f4b2-49a8-4ce7-9145-63faee4d1cfb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:05:40,534 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c14f4b2-49a8-4ce7-9145-63faee4d1cfb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 15:05:40,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:05:40,765 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-13 15:05:40,776 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:06:13,250 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 15 proven. 24 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-13 15:06:13,250 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:07:05,926 WARN L286 SmtUtils]: Spent 5.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 15:07:20,183 WARN L286 SmtUtils]: Spent 5.75s 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 15:08:08,583 WARN L286 SmtUtils]: Spent 6.54s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:08:41,058 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse42 (bvneg c_~var_1_11~0)) (.cse32 (bvsgt c_~var_1_11~0 c_~var_1_10~0)) (.cse41 ((_ zero_extend 24) c_~var_1_15~0))) (let ((.cse30 (= (bvadd (bvneg .cse41) (_ bv5 32) .cse41) c_~var_1_1~0)) (.cse33 (= c_~var_1_10~0 c_~var_1_9~0)) (.cse31 (= c_~var_1_9~0 c_~var_1_11~0)) (.cse38 (not .cse32)) (.cse37 (= c_~var_1_12~0 (bvadd .cse42 c_~var_1_13~0 (bvneg c_~var_1_14~0)))) (.cse36 (bvule c_~var_1_1~0 (_ bv8 32)))) (let ((.cse6 (bvslt c_~var_1_1~0 .cse41)) (.cse9 (= (_ bv0 8) c_~var_1_2~0)) (.cse27 (or .cse37 .cse36)) (.cse28 (= c_~var_1_9~0 (bvadd c_~var_1_10~0 .cse42))) (.cse29 (= c_~var_1_3~0 (_ bv0 8))) (.cse34 (or .cse31 .cse38)) (.cse35 (or .cse33 .cse32)) (.cse40 (not .cse30)) (.cse20 (bvneg c_~var_1_10~0)) (.cse39 (not .cse36)) (.cse10 (= ((_ zero_extend 24) c_~var_1_16~0) .cse41))) (let ((.cse11 (not .cse10)) (.cse7 (and .cse33 .cse37 .cse39)) (.cse0 (forall ((currentRoundingMode RoundingMode)) (or (= ((_ fp.to_sbv 32) roundTowardZero (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode c_~var_1_10~0) ((_ to_fp 11 53) currentRoundingMode (/ 199.0 2.0)))) c_~var_1_12~0) (not (fp.gt ((_ to_fp 8 24) currentRoundingMode (/ 4.0 5.0)) ((_ to_fp 8 24) currentRoundingMode .cse20)))))) (.cse1 (and .cse34 .cse35 .cse37 .cse39 .cse40)) (.cse8 (and .cse28 .cse29 .cse37 .cse39 .cse40)) (.cse18 (and .cse27 .cse33)) (.cse15 (and (or (and .cse31 .cse32) .cse33) (or (and .cse34 .cse35 .cse36) .cse37) (or (not .cse33) .cse38))) (.cse2 (not .cse9)) (.cse14 (forall ((currentRoundingMode RoundingMode)) (or (not (fp.gt ((_ to_fp 8 24) currentRoundingMode (/ 4.0 5.0)) ((_ to_fp 8 24) currentRoundingMode .cse20))) (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode c_~var_1_10~0) ((_ to_fp 11 53) currentRoundingMode (/ 199.0 2.0)))) c_~var_1_12~0))))) (.cse5 (not .cse6)) (.cse19 (and .cse27 .cse28 (or .cse29 .cse30)))) (and (or (let ((.cse3 (forall ((currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode c_~var_1_10~0) ((_ to_fp 11 53) currentRoundingMode (/ 199.0 2.0)))) c_~var_1_12~0)))) (let ((.cse4 (or .cse8 .cse3 .cse9))) (and (or (and .cse0 (or .cse1 .cse2 .cse3) .cse4) .cse5) (or .cse6 (and .cse0 (or .cse7 .cse2 .cse3) .cse4))))) .cse10) (or .cse11 (let ((.cse12 (forall ((currentRoundingMode RoundingMode)) (or (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode c_~var_1_10~0) ((_ to_fp 11 53) currentRoundingMode (/ 199.0 2.0)))) c_~var_1_12~0)) (fp.gt ((_ to_fp 8 24) currentRoundingMode (/ 4.0 5.0)) ((_ to_fp 8 24) currentRoundingMode .cse20))))) (.cse16 (or .cse19 .cse9))) (and (or (let ((.cse13 (and (or .cse15 .cse2) .cse16))) (and (or .cse12 .cse13) (or .cse13 .cse14))) .cse5) (or .cse6 (let ((.cse17 (and .cse16 (or .cse18 .cse2)))) (and (or .cse12 .cse17) (or .cse17 .cse14))))))) (or .cse11 (let ((.cse21 (forall ((currentRoundingMode RoundingMode)) (or (= ((_ fp.to_sbv 32) roundTowardZero (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode c_~var_1_10~0) ((_ to_fp 11 53) currentRoundingMode (/ 199.0 2.0)))) c_~var_1_12~0) (fp.gt ((_ to_fp 8 24) currentRoundingMode (/ 4.0 5.0)) ((_ to_fp 8 24) currentRoundingMode .cse20))))) (.cse23 (or .cse8 .cse9))) (and (or (let ((.cse22 (and (or .cse7 .cse2) .cse23))) (and (or .cse21 .cse22) (or .cse0 .cse22))) .cse6) (or (let ((.cse24 (and (or .cse1 .cse2) .cse23))) (and (or .cse0 .cse24) (or .cse21 .cse24))) .cse5)))) (or (let ((.cse25 (forall ((currentRoundingMode RoundingMode)) (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode c_~var_1_10~0) ((_ to_fp 11 53) currentRoundingMode (/ 199.0 2.0)))) c_~var_1_12~0))))) (let ((.cse26 (or .cse25 .cse19 .cse9))) (and (or (and (or .cse25 .cse18 .cse2) .cse26 .cse14) .cse6) (or (and .cse26 (or .cse25 .cse15 .cse2) .cse14) .cse5)))) .cse10)))))) is different from true [2024-11-13 15:09:05,947 WARN L286 SmtUtils]: Spent 17.08s on a formula simplification. DAG size of input: 98 DAG size of output: 95 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 15:09:19,754 WARN L286 SmtUtils]: Spent 6.49s on a formula simplification that was a NOOP. DAG size: 75 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 15:09:42,300 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 15:09:42,300 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:09:42,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1321517147] [2024-11-13 15:09:42,300 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-13 15:09:42,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802937448] [2024-11-13 15:09:42,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1802937448] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 15:09:42,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 15:09:42,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 21 [2024-11-13 15:09:42,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625045584] [2024-11-13 15:09:42,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:09:42,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 15:09:42,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:09:42,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 15:09:42,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=302, Unknown=1, NotChecked=36, Total=420 [2024-11-13 15:09:42,303 INFO L87 Difference]: Start difference. First operand 82 states and 118 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 15:09:57,435 WARN L286 SmtUtils]: Spent 6.32s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 15:10:04,386 WARN L286 SmtUtils]: Spent 5.37s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 15:10:20,415 WARN L286 SmtUtils]: Spent 14.07s on a formula simplification that was a NOOP. DAG size: 91 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 15:10:49,317 WARN L286 SmtUtils]: Spent 27.08s on a formula simplification. DAG size of input: 134 DAG size of output: 134 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 15:10:55,314 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse61 (bvsgt c_~var_1_11~0 c_~var_1_10~0))) (let ((.cse59 ((_ zero_extend 24) c_~var_1_15~0)) (.cse9 (= (_ bv0 8) c_~var_1_2~0)) (.cse63 (not .cse61)) (.cse62 (= c_~var_1_9~0 c_~var_1_11~0)) (.cse19 (= c_~var_1_10~0 c_~var_1_9~0)) (.cse64 (bvneg c_~var_1_11~0))) (let ((.cse39 (bvneg c_~var_1_10~0)) (.cse27 (= c_~var_1_9~0 (bvadd c_~var_1_10~0 .cse64))) (.cse55 (or (and .cse62 .cse61) .cse19)) (.cse57 (or (not .cse19) .cse63)) (.cse2 (not .cse9)) (.cse6 (bvslt c_~var_1_1~0 .cse59)) (.cse56 (= c_~var_1_12~0 (bvadd .cse64 c_~var_1_13~0 (bvneg c_~var_1_14~0)))) (.cse45 (bvule c_~var_1_1~0 (_ bv8 32))) (.cse29 (= c_~var_1_3~0 (_ bv0 8))) (.cse60 (= (bvadd (bvneg .cse59) (_ bv5 32) .cse59) c_~var_1_1~0))) (let ((.cse28 (or .cse29 .cse60)) (.cse54 (or .cse56 .cse45)) (.cse15 (or .cse62 .cse63)) (.cse16 (or .cse19 .cse61)) (.cse58 (not .cse60)) (.cse17 (not .cse45)) (.cse10 (= ((_ zero_extend 24) c_~var_1_16~0) .cse59)) (.cse5 (not .cse6)) (.cse24 (or (and .cse55 .cse57) .cse2)) (.cse41 (or (and .cse27 .cse29) .cse9)) (.cse21 (or .cse19 .cse2)) (.cse13 (forall ((currentRoundingMode RoundingMode)) (not (fp.gt ((_ to_fp 8 24) currentRoundingMode (/ 4.0 5.0)) ((_ to_fp 8 24) currentRoundingMode .cse39)))))) (let ((.cse26 (or .cse10 (and (or .cse5 (and .cse41 .cse13 .cse24)) (or .cse6 (and .cse41 .cse21 .cse13))))) (.cse30 (not .cse10)) (.cse7 (and .cse19 .cse56 .cse17)) (.cse0 (forall ((currentRoundingMode RoundingMode)) (or (= ((_ fp.to_sbv 32) roundTowardZero (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode c_~var_1_10~0) ((_ to_fp 11 53) currentRoundingMode (/ 199.0 2.0)))) c_~var_1_12~0) (not (fp.gt ((_ to_fp 8 24) currentRoundingMode (/ 4.0 5.0)) ((_ to_fp 8 24) currentRoundingMode .cse39)))))) (.cse1 (and .cse15 .cse16 .cse56 .cse17 .cse58)) (.cse8 (and .cse27 .cse29 .cse56 .cse17 .cse58)) (.cse37 (and .cse54 .cse19)) (.cse34 (and .cse55 (or (and .cse15 .cse16 .cse45) .cse56) .cse57)) (.cse33 (forall ((currentRoundingMode RoundingMode)) (or (not (fp.gt ((_ to_fp 8 24) currentRoundingMode (/ 4.0 5.0)) ((_ to_fp 8 24) currentRoundingMode .cse39))) (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode c_~var_1_10~0) ((_ to_fp 11 53) currentRoundingMode (/ 199.0 2.0)))) c_~var_1_12~0))))) (.cse38 (and .cse54 .cse27 .cse28)) (.cse44 (or (and (or .cse13 .cse6) (or .cse13 .cse5)) .cse10)) (.cse11 (forall ((currentRoundingMode RoundingMode)) (fp.gt ((_ to_fp 8 24) currentRoundingMode (/ 4.0 5.0)) ((_ to_fp 8 24) currentRoundingMode .cse39))))) (and (or (let ((.cse3 (forall ((currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode c_~var_1_10~0) ((_ to_fp 11 53) currentRoundingMode (/ 199.0 2.0)))) c_~var_1_12~0)))) (let ((.cse4 (or .cse8 .cse3 .cse9))) (and (or (and .cse0 (or .cse1 .cse2 .cse3) .cse4) .cse5) (or .cse6 (and .cse0 (or .cse7 .cse2 .cse3) .cse4))))) .cse10) (or (let ((.cse14 (or (and .cse27 .cse29 .cse17) .cse9)) (.cse22 (or (and .cse27 .cse28) .cse9))) (and (or (let ((.cse12 (and .cse14 (or (and .cse15 .cse16 .cse17) .cse2)))) (and (or .cse11 .cse12) (or .cse13 .cse12))) .cse5) (or (let ((.cse18 (and (or .cse2 (and .cse19 .cse17)) .cse14))) (and (or .cse18 .cse11) (or .cse18 .cse13))) .cse6) (or .cse6 (let ((.cse20 (and .cse21 .cse22))) (and (or .cse20 .cse13) (or .cse20 .cse11)))) (or .cse5 (let ((.cse23 (and .cse22 .cse24))) (and (or .cse23 .cse11) (or .cse13 .cse23)))) (or (let ((.cse25 (and .cse13 .cse17))) (and (or .cse6 .cse25) (or .cse25 .cse5))) .cse10) .cse26)) (bvule |c_ULTIMATE.start_step_~stepLocal_2~0#1| (_ bv8 32))) (or .cse30 (let ((.cse31 (forall ((currentRoundingMode RoundingMode)) (or (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode c_~var_1_10~0) ((_ to_fp 11 53) currentRoundingMode (/ 199.0 2.0)))) c_~var_1_12~0)) (fp.gt ((_ to_fp 8 24) currentRoundingMode (/ 4.0 5.0)) ((_ to_fp 8 24) currentRoundingMode .cse39))))) (.cse35 (or .cse38 .cse9))) (and (or (let ((.cse32 (and (or .cse34 .cse2) .cse35))) (and (or .cse31 .cse32) (or .cse32 .cse33))) .cse5) (or .cse6 (let ((.cse36 (and .cse35 (or .cse37 .cse2)))) (and (or .cse31 .cse36) (or .cse36 .cse33))))))) (or (and (or .cse6 (let ((.cse40 (and .cse41 .cse21))) (and (or .cse40 .cse11) (or .cse40 .cse13)))) (or (let ((.cse42 (and .cse41 (or (and .cse15 .cse16) .cse2)))) (and (or .cse42 .cse11) (or .cse13 .cse42))) .cse5) (or (let ((.cse43 (and .cse41 .cse24))) (and (or .cse43 .cse11) (or .cse43 .cse13))) .cse5) .cse44 .cse26) .cse45) (or .cse30 (let ((.cse46 (forall ((currentRoundingMode RoundingMode)) (or (= ((_ fp.to_sbv 32) roundTowardZero (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode c_~var_1_10~0) ((_ to_fp 11 53) currentRoundingMode (/ 199.0 2.0)))) c_~var_1_12~0) (fp.gt ((_ to_fp 8 24) currentRoundingMode (/ 4.0 5.0)) ((_ to_fp 8 24) currentRoundingMode .cse39))))) (.cse48 (or .cse8 .cse9))) (and (or (let ((.cse47 (and (or .cse7 .cse2) .cse48))) (and (or .cse46 .cse47) (or .cse0 .cse47))) .cse6) (or (let ((.cse49 (and (or .cse1 .cse2) .cse48))) (and (or .cse0 .cse49) (or .cse46 .cse49))) .cse5)))) (or (let ((.cse50 (forall ((currentRoundingMode RoundingMode)) (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode c_~var_1_10~0) ((_ to_fp 11 53) currentRoundingMode (/ 199.0 2.0)))) c_~var_1_12~0))))) (let ((.cse51 (or .cse50 .cse38 .cse9))) (and (or (and (or .cse50 .cse37 .cse2) .cse51 .cse33) .cse6) (or (and .cse51 (or .cse50 .cse34 .cse2) .cse33) .cse5)))) .cse10) (or (let ((.cse52 (and (or .cse13 .cse29) (or .cse29 .cse11)))) (and (or .cse52 .cse6) (or (let ((.cse53 (and .cse13 .cse29))) (and (or .cse53 .cse6) (or .cse53 .cse5))) .cse10) .cse44 (or .cse52 .cse5))) (not (= (_ bv0 8) |c_ULTIMATE.start_step_~stepLocal_0~0#1|)) .cse45))))))) is different from true [2024-11-13 15:11:10,429 WARN L286 SmtUtils]: Spent 12.87s on a formula simplification that was a NOOP. DAG size: 47 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 15:11:14,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-13 15:11:17,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-13 15:11:22,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.01s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-13 15:11:33,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-13 15:11:33,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:11:33,234 INFO L93 Difference]: Finished difference Result 135 states and 182 transitions. [2024-11-13 15:11:33,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 15:11:33,253 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 92 [2024-11-13 15:11:33,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:11:33,255 INFO L225 Difference]: With dead ends: 135 [2024-11-13 15:11:33,255 INFO L226 Difference]: Without dead ends: 133 [2024-11-13 15:11:33,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 128.4s TimeCoverageRelationStatistics Valid=136, Invalid=470, Unknown=2, NotChecked=94, Total=702 [2024-11-13 15:11:33,257 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 71 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 109 IncrementalHoareTripleChecker+Unchecked, 34.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:11:33,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 379 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 220 Invalid, 0 Unknown, 109 Unchecked, 34.0s Time] [2024-11-13 15:11:33,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-13 15:11:33,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 116. [2024-11-13 15:11:33,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 75 states have (on average 1.16) internal successors, (87), 77 states have internal predecessors, (87), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-13 15:11:33,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 159 transitions. [2024-11-13 15:11:33,294 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 159 transitions. Word has length 92 [2024-11-13 15:11:33,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:11:33,295 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 159 transitions. [2024-11-13 15:11:33,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 15:11:33,296 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 159 transitions. [2024-11-13 15:11:33,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-13 15:11:33,297 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:11:33,297 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:11:33,306 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c14f4b2-49a8-4ce7-9145-63faee4d1cfb/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)] Forceful destruction successful, exit code 0 [2024-11-13 15:11:33,519 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c14f4b2-49a8-4ce7-9145-63faee4d1cfb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 15:11:33,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c14f4b2-49a8-4ce7-9145-63faee4d1cfb/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c14f4b2-49a8-4ce7-9145-63faee4d1cfb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:11:33,702 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:11:33,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:11:33,703 INFO L85 PathProgramCache]: Analyzing trace with hash -468601974, now seen corresponding path program 1 times [2024-11-13 15:11:33,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:11:33,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [310111639] [2024-11-13 15:11:33,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:11:33,704 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 15:11:33,704 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c14f4b2-49a8-4ce7-9145-63faee4d1cfb/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:11:33,706 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c14f4b2-49a8-4ce7-9145-63faee4d1cfb/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 15:11:33,707 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c14f4b2-49a8-4ce7-9145-63faee4d1cfb/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 (6)] Waiting until timeout for monitored process [2024-11-13 15:11:33,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:11:33,909 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 15:11:34,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:11:34,059 ERROR L246 FreeRefinementEngine]: Caught known exception: Invalid model [2024-11-13 15:11:34,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1434041833] [2024-11-13 15:11:34,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:11:34,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:11:34,059 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c14f4b2-49a8-4ce7-9145-63faee4d1cfb/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:11:34,062 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c14f4b2-49a8-4ce7-9145-63faee4d1cfb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:11:34,063 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c14f4b2-49a8-4ce7-9145-63faee4d1cfb/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 15:11:34,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:11:34,207 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-13 15:11:34,210 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:11:56,774 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 15 proven. 24 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-13 15:11:56,774 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:14:16,157 WARN L286 SmtUtils]: Spent 5.21s on a formula simplification. DAG size of input: 3 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:15:23,583 WARN L286 SmtUtils]: Spent 5.93s on a formula simplification. DAG size of input: 3 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:18:21,933 WARN L286 SmtUtils]: Spent 5.74s on a formula simplification. DAG size of input: 3 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:19:59,737 WARN L286 SmtUtils]: Spent 5.62s on a formula simplification. DAG size of input: 3 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)