./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-80.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_8d677f49-7d49-4d92-a13d-0052ae25f4dc/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d677f49-7d49-4d92-a13d-0052ae25f4dc/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_8d677f49-7d49-4d92-a13d-0052ae25f4dc/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d677f49-7d49-4d92-a13d-0052ae25f4dc/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-80.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d677f49-7d49-4d92-a13d-0052ae25f4dc/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_8d677f49-7d49-4d92-a13d-0052ae25f4dc/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 9f215a3195f16669cd0369343da702eef7a8739b39d0494b1bddf6755cbdfe03 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 13:34:54,804 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 13:34:54,870 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d677f49-7d49-4d92-a13d-0052ae25f4dc/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 13:34:54,879 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 13:34:54,884 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 13:34:54,922 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 13:34:54,924 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 13:34:54,925 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 13:34:54,925 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 13:34:54,926 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 13:34:54,927 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 13:34:54,927 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 13:34:54,927 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 13:34:54,928 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 13:34:54,928 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 13:34:54,928 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 13:34:54,929 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 13:34:54,929 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 13:34:54,929 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 13:34:54,929 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 13:34:54,929 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 13:34:54,929 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 13:34:54,930 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 13:34:54,930 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 13:34:54,930 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 13:34:54,930 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 13:34:54,930 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 13:34:54,930 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 13:34:54,930 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 13:34:54,931 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 13:34:54,931 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 13:34:54,931 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 13:34:54,931 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:34:54,932 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 13:34:54,932 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 13:34:54,932 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 13:34:54,932 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 13:34:54,933 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 13:34:54,933 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 13:34:54,933 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 13:34:54,933 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 13:34:54,933 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 13:34:54,933 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_8d677f49-7d49-4d92-a13d-0052ae25f4dc/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 -> 9f215a3195f16669cd0369343da702eef7a8739b39d0494b1bddf6755cbdfe03 [2024-11-13 13:34:55,271 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 13:34:55,283 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 13:34:55,287 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 13:34:55,288 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 13:34:55,288 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 13:34:55,290 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d677f49-7d49-4d92-a13d-0052ae25f4dc/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-80.i Unable to find full path for "g++" [2024-11-13 13:34:57,303 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 13:34:57,699 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 13:34:57,702 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d677f49-7d49-4d92-a13d-0052ae25f4dc/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-80.i [2024-11-13 13:34:57,714 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d677f49-7d49-4d92-a13d-0052ae25f4dc/bin/uautomizer-verify-qhAvR1uOyd/data/394c6f717/52985b25cd5f4e3a814c47bd732a21d5/FLAG643d0356a [2024-11-13 13:34:57,743 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d677f49-7d49-4d92-a13d-0052ae25f4dc/bin/uautomizer-verify-qhAvR1uOyd/data/394c6f717/52985b25cd5f4e3a814c47bd732a21d5 [2024-11-13 13:34:57,746 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 13:34:57,749 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 13:34:57,750 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 13:34:57,750 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 13:34:57,761 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 13:34:57,762 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:34:57" (1/1) ... [2024-11-13 13:34:57,765 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15802483 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:34:57, skipping insertion in model container [2024-11-13 13:34:57,766 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:34:57" (1/1) ... [2024-11-13 13:34:57,792 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 13:34:58,012 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_8d677f49-7d49-4d92-a13d-0052ae25f4dc/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-80.i[915,928] [2024-11-13 13:34:58,105 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:34:58,117 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 13:34:58,131 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_8d677f49-7d49-4d92-a13d-0052ae25f4dc/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-80.i[915,928] [2024-11-13 13:34:58,188 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:34:58,218 INFO L204 MainTranslator]: Completed translation [2024-11-13 13:34:58,219 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:34:58 WrapperNode [2024-11-13 13:34:58,220 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 13:34:58,221 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 13:34:58,221 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 13:34:58,221 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 13:34:58,231 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:34:58" (1/1) ... [2024-11-13 13:34:58,243 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:34:58" (1/1) ... [2024-11-13 13:34:58,296 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 141 [2024-11-13 13:34:58,300 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 13:34:58,301 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 13:34:58,301 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 13:34:58,301 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 13:34:58,312 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:34:58" (1/1) ... [2024-11-13 13:34:58,312 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:34:58" (1/1) ... [2024-11-13 13:34:58,319 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:34:58" (1/1) ... [2024-11-13 13:34:58,347 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-13 13:34:58,347 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:34:58" (1/1) ... [2024-11-13 13:34:58,347 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:34:58" (1/1) ... [2024-11-13 13:34:58,355 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:34:58" (1/1) ... [2024-11-13 13:34:58,358 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:34:58" (1/1) ... [2024-11-13 13:34:58,361 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:34:58" (1/1) ... [2024-11-13 13:34:58,363 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:34:58" (1/1) ... [2024-11-13 13:34:58,366 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 13:34:58,367 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 13:34:58,367 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 13:34:58,368 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 13:34:58,369 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:34:58" (1/1) ... [2024-11-13 13:34:58,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:34:58,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d677f49-7d49-4d92-a13d-0052ae25f4dc/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:34:58,405 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d677f49-7d49-4d92-a13d-0052ae25f4dc/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 13:34:58,415 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d677f49-7d49-4d92-a13d-0052ae25f4dc/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 13:34:58,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 13:34:58,440 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 13:34:58,440 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 13:34:58,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 13:34:58,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 13:34:58,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 13:34:58,553 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 13:34:58,556 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 13:34:58,998 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-13 13:34:58,998 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 13:34:59,012 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 13:34:59,013 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 13:34:59,014 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:34:59 BoogieIcfgContainer [2024-11-13 13:34:59,014 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 13:34:59,017 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 13:34:59,018 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 13:34:59,023 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 13:34:59,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 01:34:57" (1/3) ... [2024-11-13 13:34:59,025 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c203fbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:34:59, skipping insertion in model container [2024-11-13 13:34:59,025 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:34:58" (2/3) ... [2024-11-13 13:34:59,025 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c203fbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:34:59, skipping insertion in model container [2024-11-13 13:34:59,026 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:34:59" (3/3) ... [2024-11-13 13:34:59,027 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-80.i [2024-11-13 13:34:59,046 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 13:34:59,049 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-1loop_file-80.i that has 2 procedures, 61 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 13:34:59,132 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 13:34:59,149 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;@6ac5c330, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 13:34:59,151 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 13:34:59,156 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 39 states have (on average 1.358974358974359) internal successors, (53), 40 states have internal predecessors, (53), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-13 13:34:59,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-13 13:34:59,172 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:34:59,174 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:34:59,175 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:34:59,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:34:59,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1893642822, now seen corresponding path program 1 times [2024-11-13 13:34:59,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:34:59,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611340453] [2024-11-13 13:34:59,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:34:59,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:34:59,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:59,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:34:59,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:00,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:35:00,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:00,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:35:00,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:00,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:35:00,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:00,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 13:35:00,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:00,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 13:35:00,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:00,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-13 13:35:00,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:00,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-13 13:35:00,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:00,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-13 13:35:00,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:00,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 13:35:00,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:00,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 13:35:00,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:00,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 13:35:00,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:00,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 13:35:00,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:00,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 13:35:00,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:00,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-13 13:35:00,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:00,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-13 13:35:00,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:00,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-13 13:35:00,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:00,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-13 13:35:00,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:00,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-13 13:35:00,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:00,147 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 13:35:00,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:35:00,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611340453] [2024-11-13 13:35:00,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611340453] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:35:00,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:35:00,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:35:00,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849723751] [2024-11-13 13:35:00,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:35:00,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:35:00,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:35:00,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:35:00,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:35:00,185 INFO L87 Difference]: Start difference. First operand has 61 states, 39 states have (on average 1.358974358974359) internal successors, (53), 40 states have internal predecessors, (53), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 13:35:00,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:35:00,327 INFO L93 Difference]: Finished difference Result 177 states and 305 transitions. [2024-11-13 13:35:00,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:35:00,330 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 125 [2024-11-13 13:35:00,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:35:00,341 INFO L225 Difference]: With dead ends: 177 [2024-11-13 13:35:00,341 INFO L226 Difference]: Without dead ends: 111 [2024-11-13 13:35:00,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:35:00,352 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 84 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:35:00,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 243 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:35:00,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-13 13:35:00,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 59. [2024-11-13 13:35:00,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 38 states have (on average 1.263157894736842) internal successors, (48), 38 states have internal predecessors, (48), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-13 13:35:00,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 86 transitions. [2024-11-13 13:35:00,413 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 86 transitions. Word has length 125 [2024-11-13 13:35:00,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:35:00,415 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 86 transitions. [2024-11-13 13:35:00,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 13:35:00,416 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 86 transitions. [2024-11-13 13:35:00,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-13 13:35:00,419 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:35:00,419 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:35:00,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 13:35:00,420 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:35:00,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:35:00,420 INFO L85 PathProgramCache]: Analyzing trace with hash 2008297464, now seen corresponding path program 1 times [2024-11-13 13:35:00,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:35:00,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382553052] [2024-11-13 13:35:00,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:35:00,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:35:00,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:00,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:35:01,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:01,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:35:01,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:01,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:35:01,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:01,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:35:01,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:01,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 13:35:01,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:01,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 13:35:01,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:01,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-13 13:35:01,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:01,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-13 13:35:01,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:01,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-13 13:35:01,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:01,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 13:35:01,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:01,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 13:35:01,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:01,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 13:35:01,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:01,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 13:35:01,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:01,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 13:35:01,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:01,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-13 13:35:01,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:01,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-13 13:35:01,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:01,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-13 13:35:01,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:01,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-13 13:35:01,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:01,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-13 13:35:01,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:01,236 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 13:35:01,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:35:01,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382553052] [2024-11-13 13:35:01,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382553052] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:35:01,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:35:01,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:35:01,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809825129] [2024-11-13 13:35:01,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:35:01,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:35:01,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:35:01,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:35:01,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:35:01,243 INFO L87 Difference]: Start difference. First operand 59 states and 86 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 13:35:01,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:35:01,358 INFO L93 Difference]: Finished difference Result 171 states and 252 transitions. [2024-11-13 13:35:01,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:35:01,359 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 125 [2024-11-13 13:35:01,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:35:01,362 INFO L225 Difference]: With dead ends: 171 [2024-11-13 13:35:01,363 INFO L226 Difference]: Without dead ends: 115 [2024-11-13 13:35:01,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:35:01,368 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 39 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:35:01,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 163 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:35:01,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-13 13:35:01,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2024-11-13 13:35:01,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 72 states have (on average 1.2222222222222223) internal successors, (88), 72 states have internal predecessors, (88), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-13 13:35:01,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 164 transitions. [2024-11-13 13:35:01,400 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 164 transitions. Word has length 125 [2024-11-13 13:35:01,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:35:01,401 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 164 transitions. [2024-11-13 13:35:01,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 13:35:01,401 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 164 transitions. [2024-11-13 13:35:01,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-13 13:35:01,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:35:01,404 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:35:01,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 13:35:01,404 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:35:01,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:35:01,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1635477384, now seen corresponding path program 1 times [2024-11-13 13:35:01,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:35:01,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318748945] [2024-11-13 13:35:01,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:35:01,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:35:01,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:01,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:35:01,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:01,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:35:01,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:01,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:35:01,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:01,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 13:35:01,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:01,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 13:35:01,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:01,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-13 13:35:01,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:01,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-13 13:35:01,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:01,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-13 13:35:01,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:01,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-13 13:35:01,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:01,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-13 13:35:01,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:01,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 13:35:01,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:01,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 13:35:01,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:01,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 13:35:01,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:01,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-13 13:35:01,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:01,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-13 13:35:01,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:01,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-13 13:35:01,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:01,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-13 13:35:01,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:01,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-13 13:35:01,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:01,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-13 13:35:01,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:01,693 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 13:35:01,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:35:01,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318748945] [2024-11-13 13:35:01,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318748945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:35:01,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:35:01,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:35:01,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041602455] [2024-11-13 13:35:01,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:35:01,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:35:01,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:35:01,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:35:01,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:35:01,696 INFO L87 Difference]: Start difference. First operand 113 states and 164 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 13:35:01,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:35:01,755 INFO L93 Difference]: Finished difference Result 167 states and 240 transitions. [2024-11-13 13:35:01,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:35:01,760 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 125 [2024-11-13 13:35:01,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:35:01,761 INFO L225 Difference]: With dead ends: 167 [2024-11-13 13:35:01,761 INFO L226 Difference]: Without dead ends: 57 [2024-11-13 13:35:01,762 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:35:01,764 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:35:01,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 150 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:35:01,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-13 13:35:01,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-13 13:35:01,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-13 13:35:01,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 78 transitions. [2024-11-13 13:35:01,795 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 78 transitions. Word has length 125 [2024-11-13 13:35:01,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:35:01,795 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 78 transitions. [2024-11-13 13:35:01,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 13:35:01,796 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 78 transitions. [2024-11-13 13:35:01,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-13 13:35:01,798 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:35:01,798 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:35:01,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 13:35:01,798 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:35:01,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:35:01,799 INFO L85 PathProgramCache]: Analyzing trace with hash 639194679, now seen corresponding path program 1 times [2024-11-13 13:35:01,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:35:01,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352283159] [2024-11-13 13:35:01,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:35:01,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:35:02,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:35:02,017 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 13:35:02,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:35:02,186 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 13:35:02,186 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 13:35:02,188 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 13:35:02,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 13:35:02,193 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-13 13:35:02,342 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 13:35:02,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 01:35:02 BoogieIcfgContainer [2024-11-13 13:35:02,346 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 13:35:02,347 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 13:35:02,347 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 13:35:02,347 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 13:35:02,348 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:34:59" (3/4) ... [2024-11-13 13:35:02,351 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 13:35:02,352 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 13:35:02,353 INFO L158 Benchmark]: Toolchain (without parser) took 4604.39ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 57.8MB in the end (delta: 34.4MB). Peak memory consumption was 32.9MB. Max. memory is 16.1GB. [2024-11-13 13:35:02,353 INFO L158 Benchmark]: CDTParser took 1.31ms. 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 13:35:02,354 INFO L158 Benchmark]: CACSL2BoogieTranslator took 470.52ms. Allocated memory is still 117.4MB. Free memory was 92.0MB in the beginning and 77.9MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 13:35:02,354 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.92ms. Allocated memory is still 117.4MB. Free memory was 77.9MB in the beginning and 74.3MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:35:02,355 INFO L158 Benchmark]: Boogie Preprocessor took 65.99ms. Allocated memory is still 117.4MB. Free memory was 74.3MB in the beginning and 68.0MB in the end (delta: 6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 13:35:02,358 INFO L158 Benchmark]: RCFGBuilder took 646.98ms. Allocated memory is still 117.4MB. Free memory was 68.0MB in the beginning and 48.5MB in the end (delta: 19.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 13:35:02,358 INFO L158 Benchmark]: TraceAbstraction took 3329.30ms. Allocated memory is still 117.4MB. Free memory was 48.0MB in the beginning and 57.8MB in the end (delta: -9.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:35:02,359 INFO L158 Benchmark]: Witness Printer took 5.39ms. Allocated memory is still 117.4MB. Free memory was 57.8MB in the beginning and 57.8MB in the end (delta: 21.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:35:02,361 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.31ms. Allocated memory is still 117.4MB. Free memory is still 74.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 470.52ms. Allocated memory is still 117.4MB. Free memory was 92.0MB in the beginning and 77.9MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.92ms. Allocated memory is still 117.4MB. Free memory was 77.9MB in the beginning and 74.3MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 65.99ms. Allocated memory is still 117.4MB. Free memory was 74.3MB in the beginning and 68.0MB in the end (delta: 6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 646.98ms. Allocated memory is still 117.4MB. Free memory was 68.0MB in the beginning and 48.5MB in the end (delta: 19.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3329.30ms. Allocated memory is still 117.4MB. Free memory was 48.0MB in the beginning and 57.8MB in the end (delta: -9.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.39ms. Allocated memory is still 117.4MB. Free memory was 57.8MB in the beginning and 57.8MB 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 someBinaryFLOATComparisonOperation at line 122, overapproximation of someBinaryFLOATComparisonOperation at line 68, overapproximation of someBinaryFLOATComparisonOperation at line 105, overapproximation of someBinaryFLOATComparisonOperation at line 107, overapproximation of someBinaryFLOATComparisonOperation at line 103, overapproximation of someBinaryDOUBLEComparisonOperation at line 59, overapproximation of someBinaryDOUBLEComparisonOperation at line 101, overapproximation of someBinaryDOUBLEComparisonOperation at line 122, overapproximation of someBinaryDOUBLEComparisonOperation at line 90, overapproximation of someBinaryDOUBLEComparisonOperation at line 86, overapproximation of someBinaryDOUBLEComparisonOperation at line 92, overapproximation of someBinaryDOUBLEComparisonOperation at line 63, overapproximation of someBinaryDOUBLEComparisonOperation at line 100, overapproximation of someBinaryDOUBLEComparisonOperation at line 88, overapproximation of someBinaryDOUBLEComparisonOperation at line 77. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 128; [L23] double var_1_2 = 24.25; [L24] double var_1_3 = 128.5; [L25] double var_1_4 = 4.5; [L26] double var_1_5 = 49.5; [L27] signed short int var_1_9 = -25; [L28] unsigned char var_1_10 = 200; [L29] unsigned char var_1_11 = 1; [L30] unsigned char var_1_12 = 1; [L31] double var_1_13 = 128.375; [L32] unsigned short int var_1_14 = 0; [L33] float var_1_15 = 0.0; [L34] float var_1_16 = 4.87; [L35] float var_1_17 = 8.875; [L36] signed short int var_1_18 = -128; [L37] unsigned char var_1_19 = 0; [L38] unsigned char var_1_20 = 1; [L39] unsigned char var_1_21 = 0; [L40] unsigned long int var_1_22 = 16; [L41] unsigned long int var_1_23 = 4200661734; [L42] unsigned char last_1_var_1_10 = 200; VAL [isInitial=0, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_2=97/4, var_1_3=257/2, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L126] isInitial = 1 [L127] FCALL initially() [L128] int k_loop; [L129] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_2=97/4, var_1_3=257/2, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L129] COND TRUE k_loop < 1 [L130] CALL updateLastVariables() [L119] last_1_var_1_10 = var_1_10 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_2=97/4, var_1_3=257/2, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L130] RET updateLastVariables() [L131] CALL updateVariables() [L85] var_1_2 = __VERIFIER_nondet_double() [L86] CALL assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_3=257/2, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_3=257/2, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L86] RET assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_3=257/2, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L87] var_1_3 = __VERIFIER_nondet_double() [L88] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L88] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L89] var_1_4 = __VERIFIER_nondet_double() [L90] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_5=99/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_5=99/2, var_1_9=-25] [L90] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_5=99/2, var_1_9=-25] [L91] var_1_5 = __VERIFIER_nondet_double() [L92] CALL assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L92] RET assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L93] var_1_11 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L94] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L95] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L95] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L96] var_1_12 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L97] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L98] CALL assume_abort_if_not(var_1_12 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L98] RET assume_abort_if_not(var_1_12 <= 254) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L99] var_1_13 = __VERIFIER_nondet_double() [L100] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L100] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L101] CALL assume_abort_if_not(var_1_13 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L101] RET assume_abort_if_not(var_1_13 != 0.0F) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L102] var_1_15 = __VERIFIER_nondet_float() [L103] CALL assume_abort_if_not((var_1_15 >= 4611686.018427387900e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L103] RET assume_abort_if_not((var_1_15 >= 4611686.018427387900e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L104] var_1_16 = __VERIFIER_nondet_float() [L105] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427387900e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L105] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427387900e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L106] var_1_17 = __VERIFIER_nondet_float() [L107] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854776000e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L107] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854776000e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L108] var_1_20 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L109] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L110] CALL assume_abort_if_not(var_1_20 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L110] RET assume_abort_if_not(var_1_20 <= 1) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L111] var_1_21 = __VERIFIER_nondet_uchar() [L112] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L112] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L113] CALL assume_abort_if_not(var_1_21 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L113] RET assume_abort_if_not(var_1_21 <= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L114] var_1_23 = __VERIFIER_nondet_ulong() [L115] CALL assume_abort_if_not(var_1_23 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_9=-25] [L115] RET assume_abort_if_not(var_1_23 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_9=-25] [L116] CALL assume_abort_if_not(var_1_23 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_9=-25] [L116] RET assume_abort_if_not(var_1_23 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_9=-25] [L131] RET updateVariables() [L132] CALL step() [L46] signed long int stepLocal_0 = last_1_var_1_10; VAL [isInitial=1, last_1_var_1_10=200, stepLocal_0=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_9=-25] [L47] COND TRUE stepLocal_0 >= last_1_var_1_10 [L48] var_1_9 = (-256 + last_1_var_1_10) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_9=-56] [L52] signed short int stepLocal_1 = var_1_9; VAL [isInitial=1, last_1_var_1_10=200, stepLocal_1=-56, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_9=-56] [L53] COND FALSE !(stepLocal_1 > 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_9=-56] [L56] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_9=-56] [L59] COND TRUE ! (var_1_5 > (255.9 / var_1_13)) [L60] var_1_10 = var_1_12 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=-202, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_9=-56] [L63] COND TRUE ((var_1_2 - var_1_3) * var_1_4) < var_1_5 [L64] var_1_1 = ((((-8) < ((var_1_10 + ((((var_1_10) < (var_1_10)) ? (var_1_10) : (var_1_10)))))) ? (-8) : ((var_1_10 + ((((var_1_10) < (var_1_10)) ? (var_1_10) : (var_1_10))))))) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=-202, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_9=-56] [L68] COND FALSE !((var_1_17 <= (- var_1_16)) && var_1_19) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=-202, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_9=-56] [L71] COND FALSE !(\read(var_1_19)) [L74] var_1_22 = (((((var_1_23 - var_1_9)) < (var_1_10)) ? ((var_1_23 - var_1_9)) : (var_1_10))) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=-202, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=54, var_1_23=-2, var_1_9=-56] [L76] COND TRUE ! var_1_19 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=-202, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=54, var_1_23=-2, var_1_9=-56] [L77] COND FALSE !(((var_1_15 - var_1_16) - var_1_17) <= var_1_13) [L80] var_1_14 = var_1_18 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=-202, var_1_11=1, var_1_12=-202, var_1_14=-128, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=54, var_1_23=-2, var_1_9=-56] [L132] RET step() [L133] CALL, EXPR property() [L122-L123] return (((((((((var_1_2 - var_1_3) * var_1_4) < var_1_5) ? (var_1_1 == ((signed short int) ((((-8) < ((var_1_10 + ((((var_1_10) < (var_1_10)) ? (var_1_10) : (var_1_10)))))) ? (-8) : ((var_1_10 + ((((var_1_10) < (var_1_10)) ? (var_1_10) : (var_1_10))))))))) : (var_1_1 == ((signed short int) var_1_10))) && ((last_1_var_1_10 >= last_1_var_1_10) ? (var_1_9 == ((signed short int) (-256 + last_1_var_1_10))) : (var_1_9 == ((signed short int) (last_1_var_1_10 + last_1_var_1_10))))) && (var_1_19 ? (var_1_10 == ((unsigned char) ((((0) < (var_1_12)) ? (0) : (var_1_12))))) : ((! (var_1_5 > (255.9 / var_1_13))) ? (var_1_10 == ((unsigned char) var_1_12)) : 1))) && ((! var_1_19) ? ((((var_1_15 - var_1_16) - var_1_17) <= var_1_13) ? (var_1_14 == ((unsigned short int) var_1_18)) : (var_1_14 == ((unsigned short int) var_1_18))) : 1)) && (((var_1_17 <= (- var_1_16)) && var_1_19) ? (var_1_18 == ((signed short int) var_1_10)) : 1)) && ((var_1_9 > 0) ? (var_1_19 == ((unsigned char) ((var_1_5 >= (- var_1_15)) && (var_1_11 && (var_1_20 && var_1_21))))) : 1)) && (var_1_19 ? (var_1_22 == ((unsigned long int) (var_1_9 + var_1_10))) : (var_1_22 == ((unsigned long int) (((((var_1_23 - var_1_9)) < (var_1_10)) ? ((var_1_23 - var_1_9)) : (var_1_10)))))) ; VAL [\result=0, isInitial=1, last_1_var_1_10=200, var_1_10=-202, var_1_11=1, var_1_12=-202, var_1_14=-128, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=54, var_1_23=-2, var_1_9=-56] [L133] RET, EXPR property() [L133] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=-202, var_1_11=1, var_1_12=-202, var_1_14=-128, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=54, var_1_23=-2, var_1_9=-56] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=200, var_1_10=-202, var_1_11=1, var_1_12=-202, var_1_14=-128, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=54, var_1_23=-2, var_1_9=-56] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 4, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 123 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 123 mSDsluCounter, 556 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 304 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 37 IncrementalHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 252 mSDtfsCounter, 37 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred in iteration=2, InterpolantAutomatonStates: 10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 54 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 502 NumberOfCodeBlocks, 502 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 372 ConstructedInterpolants, 0 QuantifiedInterpolants, 784 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 2052/2052 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-13 13:35:02,402 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d677f49-7d49-4d92-a13d-0052ae25f4dc/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_8d677f49-7d49-4d92-a13d-0052ae25f4dc/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d677f49-7d49-4d92-a13d-0052ae25f4dc/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_8d677f49-7d49-4d92-a13d-0052ae25f4dc/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d677f49-7d49-4d92-a13d-0052ae25f4dc/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-80.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d677f49-7d49-4d92-a13d-0052ae25f4dc/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_8d677f49-7d49-4d92-a13d-0052ae25f4dc/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 9f215a3195f16669cd0369343da702eef7a8739b39d0494b1bddf6755cbdfe03 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 13:35:05,191 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 13:35:05,325 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d677f49-7d49-4d92-a13d-0052ae25f4dc/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-13 13:35:05,331 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 13:35:05,332 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 13:35:05,403 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 13:35:05,404 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 13:35:05,404 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 13:35:05,405 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 13:35:05,405 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 13:35:05,405 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 13:35:05,405 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 13:35:05,406 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 13:35:05,406 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 13:35:05,406 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 13:35:05,406 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 13:35:05,406 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 13:35:05,406 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 13:35:05,406 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 13:35:05,406 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 13:35:05,406 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 13:35:05,407 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 13:35:05,407 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 13:35:05,417 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 13:35:05,417 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 13:35:05,417 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 13:35:05,417 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 13:35:05,418 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 13:35:05,418 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 13:35:05,418 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 13:35:05,418 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 13:35:05,418 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 13:35:05,418 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 13:35:05,418 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 13:35:05,418 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:35:05,418 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 13:35:05,418 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 13:35:05,418 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 13:35:05,419 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 13:35:05,419 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 13:35:05,419 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 13:35:05,419 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 13:35:05,419 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 13:35:05,419 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 13:35:05,419 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_8d677f49-7d49-4d92-a13d-0052ae25f4dc/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 -> 9f215a3195f16669cd0369343da702eef7a8739b39d0494b1bddf6755cbdfe03 [2024-11-13 13:35:05,741 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 13:35:05,752 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 13:35:05,755 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 13:35:05,759 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 13:35:05,760 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 13:35:05,761 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d677f49-7d49-4d92-a13d-0052ae25f4dc/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-80.i Unable to find full path for "g++" [2024-11-13 13:35:07,835 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 13:35:08,216 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 13:35:08,217 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d677f49-7d49-4d92-a13d-0052ae25f4dc/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-80.i [2024-11-13 13:35:08,229 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d677f49-7d49-4d92-a13d-0052ae25f4dc/bin/uautomizer-verify-qhAvR1uOyd/data/5390cb2ca/c3348cfb63a24e9795ffed6b565422e1/FLAGcdfe112fa [2024-11-13 13:35:08,256 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d677f49-7d49-4d92-a13d-0052ae25f4dc/bin/uautomizer-verify-qhAvR1uOyd/data/5390cb2ca/c3348cfb63a24e9795ffed6b565422e1 [2024-11-13 13:35:08,261 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 13:35:08,263 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 13:35:08,266 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 13:35:08,267 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 13:35:08,273 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 13:35:08,275 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:35:08" (1/1) ... [2024-11-13 13:35:08,276 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 01:35:08, skipping insertion in model container [2024-11-13 13:35:08,278 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:35:08" (1/1) ... [2024-11-13 13:35:08,307 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 13:35:08,509 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_8d677f49-7d49-4d92-a13d-0052ae25f4dc/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-80.i[915,928] [2024-11-13 13:35:08,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:35:08,650 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 13:35:08,668 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_8d677f49-7d49-4d92-a13d-0052ae25f4dc/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-80.i[915,928] [2024-11-13 13:35:08,718 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:35:08,739 INFO L204 MainTranslator]: Completed translation [2024-11-13 13:35:08,739 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:08 WrapperNode [2024-11-13 13:35:08,740 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 13:35:08,742 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 13:35:08,742 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 13:35:08,742 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 13:35:08,751 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:08" (1/1) ... [2024-11-13 13:35:08,772 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:08" (1/1) ... [2024-11-13 13:35:08,818 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 141 [2024-11-13 13:35:08,819 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 13:35:08,819 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 13:35:08,820 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 13:35:08,820 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 13:35:08,831 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:08" (1/1) ... [2024-11-13 13:35:08,832 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:08" (1/1) ... [2024-11-13 13:35:08,841 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:08" (1/1) ... [2024-11-13 13:35:08,863 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-13 13:35:08,863 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:08" (1/1) ... [2024-11-13 13:35:08,863 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:08" (1/1) ... [2024-11-13 13:35:08,890 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:08" (1/1) ... [2024-11-13 13:35:08,898 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:08" (1/1) ... [2024-11-13 13:35:08,904 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:08" (1/1) ... [2024-11-13 13:35:08,905 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:08" (1/1) ... [2024-11-13 13:35:08,914 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 13:35:08,915 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 13:35:08,919 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 13:35:08,919 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 13:35:08,920 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:08" (1/1) ... [2024-11-13 13:35:08,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:35:08,948 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d677f49-7d49-4d92-a13d-0052ae25f4dc/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:35:08,963 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d677f49-7d49-4d92-a13d-0052ae25f4dc/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 13:35:08,967 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d677f49-7d49-4d92-a13d-0052ae25f4dc/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 13:35:08,997 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 13:35:08,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 13:35:08,997 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 13:35:08,998 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 13:35:08,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 13:35:08,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 13:35:09,135 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 13:35:09,137 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 13:35:31,999 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-13 13:35:32,000 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 13:35:32,012 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 13:35:32,012 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 13:35:32,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:35:32 BoogieIcfgContainer [2024-11-13 13:35:32,013 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 13:35:32,016 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 13:35:32,017 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 13:35:32,022 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 13:35:32,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 01:35:08" (1/3) ... [2024-11-13 13:35:32,023 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e4067ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:35:32, skipping insertion in model container [2024-11-13 13:35:32,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:08" (2/3) ... [2024-11-13 13:35:32,024 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e4067ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:35:32, skipping insertion in model container [2024-11-13 13:35:32,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:35:32" (3/3) ... [2024-11-13 13:35:32,028 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-80.i [2024-11-13 13:35:32,046 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 13:35:32,048 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-1loop_file-80.i that has 2 procedures, 61 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 13:35:32,126 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 13:35:32,146 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;@1662a0d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 13:35:32,146 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 13:35:32,151 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 39 states have (on average 1.358974358974359) internal successors, (53), 40 states have internal predecessors, (53), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-13 13:35:32,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-13 13:35:32,166 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:35:32,167 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:35:32,168 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:35:32,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:35:32,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1893642822, now seen corresponding path program 1 times [2024-11-13 13:35:32,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:35:32,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1183795108] [2024-11-13 13:35:32,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:35:32,185 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:35:32,185 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d677f49-7d49-4d92-a13d-0052ae25f4dc/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:35:32,188 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d677f49-7d49-4d92-a13d-0052ae25f4dc/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 13:35:32,206 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d677f49-7d49-4d92-a13d-0052ae25f4dc/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-13 13:35:33,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:33,570 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 13:35:33,579 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:35:33,868 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 13:35:33,869 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:35:33,870 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:35:33,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1183795108] [2024-11-13 13:35:33,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1183795108] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:35:33,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:35:33,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:35:33,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661122309] [2024-11-13 13:35:33,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:35:33,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:35:33,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:35:33,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:35:33,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:35:33,913 INFO L87 Difference]: Start difference. First operand has 61 states, 39 states have (on average 1.358974358974359) internal successors, (53), 40 states have internal predecessors, (53), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 13:35:38,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 13:35:42,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 13:35:46,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 13:35:50,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 13:35:50,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:35:50,765 INFO L93 Difference]: Finished difference Result 177 states and 305 transitions. [2024-11-13 13:35:50,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:35:50,881 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 125 [2024-11-13 13:35:50,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:35:50,895 INFO L225 Difference]: With dead ends: 177 [2024-11-13 13:35:50,895 INFO L226 Difference]: Without dead ends: 111 [2024-11-13 13:35:50,900 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:35:50,904 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 84 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.7s IncrementalHoareTripleChecker+Time [2024-11-13 13:35:50,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 244 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 4 Unknown, 0 Unchecked, 16.7s Time] [2024-11-13 13:35:50,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-13 13:35:50,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 59. [2024-11-13 13:35:50,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 38 states have (on average 1.263157894736842) internal successors, (48), 38 states have internal predecessors, (48), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-13 13:35:50,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 86 transitions. [2024-11-13 13:35:50,969 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 86 transitions. Word has length 125 [2024-11-13 13:35:50,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:35:50,972 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 86 transitions. [2024-11-13 13:35:50,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 13:35:50,972 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 86 transitions. [2024-11-13 13:35:50,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-13 13:35:50,976 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:35:50,976 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:35:50,998 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d677f49-7d49-4d92-a13d-0052ae25f4dc/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-13 13:35:51,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d677f49-7d49-4d92-a13d-0052ae25f4dc/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:35:51,177 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:35:51,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:35:51,178 INFO L85 PathProgramCache]: Analyzing trace with hash 2008297464, now seen corresponding path program 1 times [2024-11-13 13:35:51,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:35:51,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1938703859] [2024-11-13 13:35:51,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:35:51,179 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:35:51,179 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d677f49-7d49-4d92-a13d-0052ae25f4dc/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:35:51,181 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d677f49-7d49-4d92-a13d-0052ae25f4dc/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 13:35:51,183 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d677f49-7d49-4d92-a13d-0052ae25f4dc/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-13 13:35:52,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:52,523 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 13:35:52,534 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:35:55,118 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 13:35:55,118 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:35:55,119 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:35:55,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1938703859] [2024-11-13 13:35:55,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1938703859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:35:55,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:35:55,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:35:55,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075238996] [2024-11-13 13:35:55,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:35:55,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:35:55,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:35:55,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:35:55,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:35:55,123 INFO L87 Difference]: Start difference. First operand 59 states and 86 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 13:35:59,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:36:03,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:36:03,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:36:03,706 INFO L93 Difference]: Finished difference Result 169 states and 248 transitions. [2024-11-13 13:36:03,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:36:03,802 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 125 [2024-11-13 13:36:03,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:36:03,807 INFO L225 Difference]: With dead ends: 169 [2024-11-13 13:36:03,808 INFO L226 Difference]: Without dead ends: 113 [2024-11-13 13:36:03,808 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:36:03,809 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 14 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2024-11-13 13:36:03,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 157 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 10 Invalid, 2 Unknown, 0 Unchecked, 8.6s Time] [2024-11-13 13:36:03,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-13 13:36:03,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2024-11-13 13:36:03,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 70 states have (on average 1.2) internal successors, (84), 70 states have internal predecessors, (84), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-13 13:36:03,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 160 transitions. [2024-11-13 13:36:03,832 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 160 transitions. Word has length 125 [2024-11-13 13:36:03,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:36:03,833 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 160 transitions. [2024-11-13 13:36:03,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 13:36:03,833 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 160 transitions. [2024-11-13 13:36:03,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-13 13:36:03,835 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:36:03,836 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:36:03,858 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d677f49-7d49-4d92-a13d-0052ae25f4dc/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-13 13:36:04,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d677f49-7d49-4d92-a13d-0052ae25f4dc/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:36:04,036 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:36:04,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:36:04,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1635477384, now seen corresponding path program 1 times [2024-11-13 13:36:04,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:36:04,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [450245771] [2024-11-13 13:36:04,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:36:04,038 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:36:04,038 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d677f49-7d49-4d92-a13d-0052ae25f4dc/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:36:04,041 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d677f49-7d49-4d92-a13d-0052ae25f4dc/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 13:36:04,043 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d677f49-7d49-4d92-a13d-0052ae25f4dc/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-13 13:36:05,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:36:05,250 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 13:36:05,254 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:36:07,870 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 13:36:07,874 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:36:07,874 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:36:07,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [450245771] [2024-11-13 13:36:07,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [450245771] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:36:07,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:36:07,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:36:07,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649128483] [2024-11-13 13:36:07,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:36:07,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:36:07,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:36:07,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:36:07,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:36:07,876 INFO L87 Difference]: Start difference. First operand 111 states and 160 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 13:36:12,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.48s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:36:16,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:36:20,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:36:24,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:36:29,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:36:33,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:36:37,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:36:41,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:36:45,614 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:36:49,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:36:53,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:36:57,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.29s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:37:00,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.27s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:37:04,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:37:08,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:37:12,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:37:12,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:37:12,764 INFO L93 Difference]: Finished difference Result 285 states and 407 transitions. [2024-11-13 13:37:12,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:37:12,858 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 125 [2024-11-13 13:37:12,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:37:12,861 INFO L225 Difference]: With dead ends: 285 [2024-11-13 13:37:12,861 INFO L226 Difference]: Without dead ends: 177 [2024-11-13 13:37:12,863 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:37:12,864 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 57 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 39 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 64.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 64.7s IncrementalHoareTripleChecker+Time [2024-11-13 13:37:12,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 282 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 59 Invalid, 13 Unknown, 0 Unchecked, 64.7s Time] [2024-11-13 13:37:12,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-13 13:37:12,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 163. [2024-11-13 13:37:12,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 102 states have (on average 1.1764705882352942) internal successors, (120), 102 states have internal predecessors, (120), 57 states have call successors, (57), 3 states have call predecessors, (57), 3 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2024-11-13 13:37:12,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 234 transitions. [2024-11-13 13:37:12,902 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 234 transitions. Word has length 125 [2024-11-13 13:37:12,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:37:12,903 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 234 transitions. [2024-11-13 13:37:12,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 13:37:12,904 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 234 transitions. [2024-11-13 13:37:12,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-13 13:37:12,906 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:37:12,906 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:37:12,923 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d677f49-7d49-4d92-a13d-0052ae25f4dc/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-13 13:37:13,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d677f49-7d49-4d92-a13d-0052ae25f4dc/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:37:13,107 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:37:13,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:37:13,107 INFO L85 PathProgramCache]: Analyzing trace with hash 639194679, now seen corresponding path program 1 times [2024-11-13 13:37:13,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:37:13,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1879395763] [2024-11-13 13:37:13,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:37:13,108 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:37:13,108 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d677f49-7d49-4d92-a13d-0052ae25f4dc/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:37:13,112 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d677f49-7d49-4d92-a13d-0052ae25f4dc/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 13:37:13,113 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d677f49-7d49-4d92-a13d-0052ae25f4dc/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-13 13:37:14,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:37:14,651 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-13 13:37:14,664 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:37:24,088 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:37:45,527 WARN L286 SmtUtils]: Spent 6.99s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:37:49,580 WARN L851 $PredicateComparison]: unable to prove that (and (= c_~var_1_9~0 ((_ extract 15 0) (bvadd ((_ zero_extend 24) c_~last_1_var_1_10~0) (_ bv4294967040 32)))) (fp.lt (fp.mul c_currentRoundingMode (fp.sub c_currentRoundingMode c_~var_1_2~0 c_~var_1_3~0) c_~var_1_4~0) c_~var_1_5~0) (= c_~var_1_12~0 c_~var_1_10~0) (bvsle ((_ zero_extend 24) c_~var_1_21~0) (_ bv0 32)) (= (_ bv0 16) (bvadd c_~var_1_1~0 (_ bv8 16)))) is different from false [2024-11-13 13:37:55,262 WARN L286 SmtUtils]: Spent 5.31s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:38:03,471 WARN L286 SmtUtils]: Spent 6.46s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:38:15,429 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:38:23,625 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:38:35,613 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:38:43,739 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:38:51,864 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:39:07,127 WARN L286 SmtUtils]: Spent 7.15s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:39:18,957 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse0 (bvadd (bvneg ((_ sign_extend 16) c_~var_1_9~0)) c_~var_1_23~0)) (.cse2 ((_ zero_extend 24) c_~var_1_10~0))) (let ((.cse1 (bvult .cse0 .cse2))) (or (and (= c_~var_1_22~0 .cse0) .cse1) (and (= c_~var_1_22~0 .cse2) (not .cse1))))) (= c_~var_1_9~0 ((_ extract 15 0) (bvadd ((_ zero_extend 24) c_~last_1_var_1_10~0) (_ bv4294967040 32)))) (fp.lt (fp.mul c_currentRoundingMode (fp.sub c_currentRoundingMode c_~var_1_2~0 c_~var_1_3~0) c_~var_1_4~0) c_~var_1_5~0) (= c_~var_1_12~0 c_~var_1_10~0) (bvsle ((_ zero_extend 24) c_~var_1_21~0) (_ bv0 32)) (= (_ bv0 16) (bvadd c_~var_1_1~0 (_ bv8 16))) (= (_ bv0 8) c_~var_1_19~0)) is different from false [2024-11-13 13:39:22,992 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse0 (bvadd (bvneg ((_ sign_extend 16) c_~var_1_9~0)) c_~var_1_23~0)) (.cse2 ((_ zero_extend 24) c_~var_1_10~0))) (let ((.cse1 (bvult .cse0 .cse2))) (or (and (= c_~var_1_22~0 .cse0) .cse1) (and (= c_~var_1_22~0 .cse2) (not .cse1))))) (= c_~var_1_9~0 ((_ extract 15 0) (bvadd ((_ zero_extend 24) c_~last_1_var_1_10~0) (_ bv4294967040 32)))) (fp.lt (fp.mul c_currentRoundingMode (fp.sub c_currentRoundingMode c_~var_1_2~0 c_~var_1_3~0) c_~var_1_4~0) c_~var_1_5~0) (= c_~var_1_12~0 c_~var_1_10~0) (bvsle ((_ zero_extend 24) c_~var_1_21~0) (_ bv0 32)) (= (_ bv0 16) (bvadd c_~var_1_1~0 (_ bv8 16))) (= (_ bv0 8) c_~var_1_19~0)) is different from true [2024-11-13 13:39:31,180 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:39:39,298 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:39:47,421 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:39:55,544 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:40:03,665 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:40:10,974 WARN L286 SmtUtils]: Spent 7.31s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:40:18,111 WARN L286 SmtUtils]: Spent 7.14s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:40:26,244 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:40:39,294 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:40:47,472 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:40:55,610 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:41:03,734 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:41:11,846 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:41:17,553 WARN L286 SmtUtils]: Spent 5.71s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:41:23,999 WARN L286 SmtUtils]: Spent 6.45s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:41:35,594 WARN L286 SmtUtils]: Spent 6.62s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:41:42,510 WARN L286 SmtUtils]: Spent 6.91s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:41:50,657 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:41:58,732 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:42:02,775 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse0 (bvadd (bvneg ((_ sign_extend 16) c_~var_1_9~0)) c_~var_1_23~0)) (.cse2 ((_ zero_extend 24) c_~var_1_10~0))) (let ((.cse1 (bvult .cse0 .cse2))) (or (and (= c_~var_1_22~0 .cse0) .cse1) (and (= c_~var_1_22~0 .cse2) (not .cse1))))) (= c_~var_1_9~0 ((_ extract 15 0) (bvadd ((_ zero_extend 24) c_~last_1_var_1_10~0) (_ bv4294967040 32)))) (fp.lt (fp.mul c_currentRoundingMode (fp.sub c_currentRoundingMode c_~var_1_2~0 c_~var_1_3~0) c_~var_1_4~0) c_~var_1_5~0) (= c_~var_1_12~0 c_~var_1_10~0) (bvsle ((_ zero_extend 24) c_~var_1_21~0) (_ bv0 32)) (= c_~var_1_18~0 c_~var_1_14~0) (= (_ bv0 16) (bvadd c_~var_1_1~0 (_ bv8 16))) (= (_ bv0 8) c_~var_1_19~0)) is different from false