./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-30.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_306f17d2-d67e-494b-8dc5-81ef3242d8ef/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_306f17d2-d67e-494b-8dc5-81ef3242d8ef/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_306f17d2-d67e-494b-8dc5-81ef3242d8ef/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_306f17d2-d67e-494b-8dc5-81ef3242d8ef/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-30.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_306f17d2-d67e-494b-8dc5-81ef3242d8ef/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_306f17d2-d67e-494b-8dc5-81ef3242d8ef/bin/utaipan-verify-sOmjnqqW8E --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4fcc2ce47bc034780fb01758f27a0099ceca40e7fe000487fe647a6fb5f368a8 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 03:33:16,700 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 03:33:16,789 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_306f17d2-d67e-494b-8dc5-81ef3242d8ef/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-14 03:33:16,794 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 03:33:16,795 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 03:33:16,819 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 03:33:16,820 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 03:33:16,820 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 03:33:16,820 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 03:33:16,820 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 03:33:16,820 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 03:33:16,821 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 03:33:16,821 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 03:33:16,821 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 03:33:16,821 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 03:33:16,821 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 03:33:16,821 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 03:33:16,821 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 03:33:16,821 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 03:33:16,822 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 03:33:16,822 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 03:33:16,822 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 03:33:16,822 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 03:33:16,822 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 03:33:16,823 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 03:33:16,823 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 03:33:16,823 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 03:33:16,823 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 03:33:16,823 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 03:33:16,823 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 03:33:16,823 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 03:33:16,823 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 03:33:16,823 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 03:33:16,824 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 03:33:16,824 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 03:33:16,824 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 03:33:16,824 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 03:33:16,824 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 03:33:16,824 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:33:16,825 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 03:33:16,825 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 03:33:16,825 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 03:33:16,825 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 03:33:16,825 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 03:33:16,825 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 03:33:16,825 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 03:33:16,825 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 03:33:16,825 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_306f17d2-d67e-494b-8dc5-81ef3242d8ef/bin/utaipan-verify-sOmjnqqW8E 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 -> Taipan 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 -> 4fcc2ce47bc034780fb01758f27a0099ceca40e7fe000487fe647a6fb5f368a8 [2024-11-14 03:33:17,145 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 03:33:17,158 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 03:33:17,162 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 03:33:17,165 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 03:33:17,165 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 03:33:17,168 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_306f17d2-d67e-494b-8dc5-81ef3242d8ef/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-30.i Unable to find full path for "g++" [2024-11-14 03:33:19,356 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 03:33:19,680 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 03:33:19,680 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_306f17d2-d67e-494b-8dc5-81ef3242d8ef/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-30.i [2024-11-14 03:33:19,691 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_306f17d2-d67e-494b-8dc5-81ef3242d8ef/bin/utaipan-verify-sOmjnqqW8E/data/aa4f66e98/adba69866a93497a9e0e45b32ab99399/FLAG95d08dfce [2024-11-14 03:33:19,715 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_306f17d2-d67e-494b-8dc5-81ef3242d8ef/bin/utaipan-verify-sOmjnqqW8E/data/aa4f66e98/adba69866a93497a9e0e45b32ab99399 [2024-11-14 03:33:19,718 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 03:33:19,720 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 03:33:19,723 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 03:33:19,723 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 03:33:19,731 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 03:33:19,733 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:33:19" (1/1) ... [2024-11-14 03:33:19,736 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e02952b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:33:19, skipping insertion in model container [2024-11-14 03:33:19,737 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:33:19" (1/1) ... [2024-11-14 03:33:19,760 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 03:33:19,956 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_306f17d2-d67e-494b-8dc5-81ef3242d8ef/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-30.i[915,928] [2024-11-14 03:33:20,027 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:33:20,050 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 03:33:20,066 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_306f17d2-d67e-494b-8dc5-81ef3242d8ef/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-30.i[915,928] [2024-11-14 03:33:20,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:33:20,142 INFO L204 MainTranslator]: Completed translation [2024-11-14 03:33:20,143 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:33:20 WrapperNode [2024-11-14 03:33:20,143 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 03:33:20,144 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 03:33:20,145 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 03:33:20,145 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 03:33:20,154 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:33:20" (1/1) ... [2024-11-14 03:33:20,164 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:33:20" (1/1) ... [2024-11-14 03:33:20,195 INFO L138 Inliner]: procedures = 26, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 86 [2024-11-14 03:33:20,195 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 03:33:20,196 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 03:33:20,196 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 03:33:20,196 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 03:33:20,212 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:33:20" (1/1) ... [2024-11-14 03:33:20,212 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:33:20" (1/1) ... [2024-11-14 03:33:20,215 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:33:20" (1/1) ... [2024-11-14 03:33:20,218 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:33:20" (1/1) ... [2024-11-14 03:33:20,229 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:33:20" (1/1) ... [2024-11-14 03:33:20,234 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:33:20" (1/1) ... [2024-11-14 03:33:20,236 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:33:20" (1/1) ... [2024-11-14 03:33:20,237 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:33:20" (1/1) ... [2024-11-14 03:33:20,240 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 03:33:20,241 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 03:33:20,242 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 03:33:20,242 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 03:33:20,243 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:33:20" (1/1) ... [2024-11-14 03:33:20,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:33:20,269 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_306f17d2-d67e-494b-8dc5-81ef3242d8ef/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:33:20,286 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_306f17d2-d67e-494b-8dc5-81ef3242d8ef/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 03:33:20,296 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_306f17d2-d67e-494b-8dc5-81ef3242d8ef/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 03:33:20,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 03:33:20,329 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-14 03:33:20,329 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-14 03:33:20,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 03:33:20,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 03:33:20,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 03:33:20,439 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 03:33:20,442 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 03:33:20,768 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-14 03:33:20,768 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 03:33:20,919 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 03:33:20,919 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-14 03:33:20,919 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:33:20 BoogieIcfgContainer [2024-11-14 03:33:20,919 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 03:33:20,923 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 03:33:20,923 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 03:33:20,929 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 03:33:20,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 03:33:19" (1/3) ... [2024-11-14 03:33:20,930 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@487f54ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:33:20, skipping insertion in model container [2024-11-14 03:33:20,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:33:20" (2/3) ... [2024-11-14 03:33:20,930 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@487f54ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:33:20, skipping insertion in model container [2024-11-14 03:33:20,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:33:20" (3/3) ... [2024-11-14 03:33:20,931 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-30.i [2024-11-14 03:33:20,951 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 03:33:20,953 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-30.i that has 2 procedures, 25 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-14 03:33:21,025 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 03:33:21,049 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=FINITE_AUTOMATA, 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;@3c8d6fb8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 03:33:21,049 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-14 03:33:21,055 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-14 03:33:21,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-14 03:33:21,068 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:33:21,069 INFO L215 NwaCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 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-14 03:33:21,070 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:33:21,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:33:21,077 INFO L85 PathProgramCache]: Analyzing trace with hash 868471729, now seen corresponding path program 1 times [2024-11-14 03:33:21,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:33:21,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483185986] [2024-11-14 03:33:21,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:33:21,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:33:21,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-14 03:33:21,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [428191663] [2024-11-14 03:33:21,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:33:21,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:33:21,399 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_306f17d2-d67e-494b-8dc5-81ef3242d8ef/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:33:21,402 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_306f17d2-d67e-494b-8dc5-81ef3242d8ef/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:33:21,423 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_306f17d2-d67e-494b-8dc5-81ef3242d8ef/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 03:33:21,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 03:33:21,623 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-14 03:33:21,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 03:33:21,743 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-14 03:33:21,745 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-14 03:33:21,747 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-14 03:33:21,775 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_306f17d2-d67e-494b-8dc5-81ef3242d8ef/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-14 03:33:21,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_306f17d2-d67e-494b-8dc5-81ef3242d8ef/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:33:21,960 INFO L407 BasicCegarLoop]: Path program histogram: [1] [2024-11-14 03:33:22,015 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-14 03:33:22,022 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 03:33:22 BoogieIcfgContainer [2024-11-14 03:33:22,022 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-14 03:33:22,023 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-14 03:33:22,023 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-14 03:33:22,024 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-14 03:33:22,025 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:33:20" (3/4) ... [2024-11-14 03:33:22,028 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-14 03:33:22,030 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-14 03:33:22,034 INFO L158 Benchmark]: Toolchain (without parser) took 2311.37ms. Allocated memory is still 117.4MB. Free memory was 92.3MB in the beginning and 79.0MB in the end (delta: 13.3MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. [2024-11-14 03:33:22,035 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 83.9MB. Free memory is still 39.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 03:33:22,035 INFO L158 Benchmark]: CACSL2BoogieTranslator took 421.15ms. Allocated memory is still 117.4MB. Free memory was 91.7MB in the beginning and 79.9MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-14 03:33:22,036 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.73ms. Allocated memory is still 117.4MB. Free memory was 79.9MB in the beginning and 77.9MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-14 03:33:22,037 INFO L158 Benchmark]: Boogie Preprocessor took 44.78ms. Allocated memory is still 117.4MB. Free memory was 77.9MB in the beginning and 76.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 03:33:22,038 INFO L158 Benchmark]: RCFGBuilder took 678.11ms. Allocated memory is still 117.4MB. Free memory was 76.8MB in the beginning and 54.8MB in the end (delta: 22.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-14 03:33:22,039 INFO L158 Benchmark]: TraceAbstraction took 1099.77ms. Allocated memory is still 117.4MB. Free memory was 53.8MB in the beginning and 79.0MB in the end (delta: -25.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 03:33:22,039 INFO L158 Benchmark]: Witness Printer took 6.56ms. Allocated memory is still 117.4MB. Free memory was 79.0MB in the beginning and 79.0MB in the end (delta: 14.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 03:33:22,043 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.39ms. Allocated memory is still 83.9MB. Free memory is still 39.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 421.15ms. Allocated memory is still 117.4MB. Free memory was 91.7MB in the beginning and 79.9MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.73ms. Allocated memory is still 117.4MB. Free memory was 79.9MB in the beginning and 77.9MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.78ms. Allocated memory is still 117.4MB. Free memory was 77.9MB in the beginning and 76.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 678.11ms. Allocated memory is still 117.4MB. Free memory was 76.8MB in the beginning and 54.8MB in the end (delta: 22.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1099.77ms. Allocated memory is still 117.4MB. Free memory was 53.8MB in the beginning and 79.0MB in the end (delta: -25.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 6.56ms. Allocated memory is still 117.4MB. Free memory was 79.0MB in the beginning and 79.0MB in the end (delta: 14.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 82, overapproximation of someBinaryFLOATComparisonOperation at line 76. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 64; [L23] unsigned char var_1_2 = 0; [L24] signed short int var_1_5 = 8; [L25] signed short int var_1_6 = -32; [L26] unsigned char var_1_7 = 100; [L27] signed long int var_1_8 = 32; [L28] float var_1_10 = 255.3; [L29] float var_1_13 = 2.8; [L30] signed long int last_1_var_1_8 = 32; [L86] isInitial = 1 [L87] FCALL initially() [L88] COND TRUE 1 [L89] CALL updateLastVariables() [L79] last_1_var_1_8 = var_1_8 [L89] RET updateLastVariables() [L90] CALL updateVariables() [L61] var_1_2 = __VERIFIER_nondet_uchar() [L62] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_5=8, var_1_6=-32, var_1_7=100, var_1_8=32] [L20] COND FALSE !(!cond) [L62] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_5=8, var_1_6=-32, var_1_7=100, var_1_8=32] [L63] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=1, var_1_5=8, var_1_6=-32, var_1_7=100, var_1_8=32] [L20] COND FALSE !(!cond) [L63] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=1, var_1_5=8, var_1_6=-32, var_1_7=100, var_1_8=32] [L64] var_1_5 = __VERIFIER_nondet_short() [L65] CALL assume_abort_if_not(var_1_5 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=1, var_1_5=1, var_1_6=-32, var_1_7=100, var_1_8=32] [L20] COND FALSE !(!cond) [L65] RET assume_abort_if_not(var_1_5 >= -32768) VAL [isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=1, var_1_5=1, var_1_6=-32, var_1_7=100, var_1_8=32] [L66] CALL assume_abort_if_not(var_1_5 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=1, var_1_5=1, var_1_6=-32, var_1_7=100, var_1_8=32] [L20] COND FALSE !(!cond) [L66] RET assume_abort_if_not(var_1_5 <= 32767) VAL [isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=1, var_1_5=1, var_1_6=-32, var_1_7=100, var_1_8=32] [L67] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=1, var_1_5=1, var_1_6=-32, var_1_7=100, var_1_8=32] [L20] COND FALSE !(!cond) [L67] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=1, var_1_5=1, var_1_6=-32, var_1_7=100, var_1_8=32] [L68] var_1_6 = __VERIFIER_nondet_short() [L69] CALL assume_abort_if_not(var_1_6 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=1, var_1_5=1, var_1_6=-33, var_1_7=100, var_1_8=32] [L20] COND FALSE !(!cond) [L69] RET assume_abort_if_not(var_1_6 >= -32768) VAL [isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=1, var_1_5=1, var_1_6=-33, var_1_7=100, var_1_8=32] [L70] CALL assume_abort_if_not(var_1_6 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=1, var_1_5=1, var_1_6=-33, var_1_7=100, var_1_8=32] [L20] COND FALSE !(!cond) [L70] RET assume_abort_if_not(var_1_6 <= 32767) VAL [isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=1, var_1_5=1, var_1_6=-33, var_1_7=100, var_1_8=32] [L71] CALL assume_abort_if_not(var_1_6 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=1, var_1_5=1, var_1_6=-33, var_1_7=100, var_1_8=32] [L20] COND FALSE !(!cond) [L71] RET assume_abort_if_not(var_1_6 != 0) VAL [isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=1, var_1_5=1, var_1_6=-33, var_1_7=100, var_1_8=32] [L72] var_1_7 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=1, var_1_5=1, var_1_6=-33, var_1_8=32] [L20] COND FALSE !(!cond) [L73] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=1, var_1_5=1, var_1_6=-33, var_1_8=32] [L74] CALL assume_abort_if_not(var_1_7 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=1, var_1_5=1, var_1_6=-33, var_1_7=-191, var_1_8=32] [L20] COND FALSE !(!cond) [L74] RET assume_abort_if_not(var_1_7 <= 254) VAL [isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_13=14/5, var_1_1=64, var_1_2=1, var_1_5=1, var_1_6=-33, var_1_7=-191, var_1_8=32] [L75] var_1_13 = __VERIFIER_nondet_float() [L76] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_1=64, var_1_2=1, var_1_5=1, var_1_6=-33, var_1_7=-191, var_1_8=32] [L20] COND FALSE !(!cond) [L76] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_8=32, var_1_10=2553/10, var_1_1=64, var_1_2=1, var_1_5=1, var_1_6=-33, var_1_7=-191, var_1_8=32] [L90] RET updateVariables() [L91] CALL step() [L34] signed long int stepLocal_0 = (last_1_var_1_8 / var_1_5) % var_1_6; [L35] COND TRUE \read(var_1_2) [L36] COND FALSE !(last_1_var_1_8 > stepLocal_0) [L42] unsigned char stepLocal_1 = var_1_1; [L43] COND FALSE !(stepLocal_1 < var_1_5) [L46] var_1_8 = var_1_7 [L48] COND TRUE ((var_1_6 * var_1_8) * var_1_7) <= (var_1_8 - var_1_1) [L49] COND TRUE var_1_5 <= (var_1_8 + var_1_8) [L50] var_1_10 = var_1_13 [L91] RET step() [L92] CALL, EXPR property() [L82-L83] return ((var_1_2 ? ((last_1_var_1_8 > ((last_1_var_1_8 / var_1_5) % var_1_6)) ? (var_1_1 == ((unsigned char) var_1_7)) : 1) : (var_1_1 == ((unsigned char) var_1_7))) && ((var_1_1 < var_1_5) ? (var_1_8 == ((signed long int) (var_1_1 - ((((var_1_7) < (var_1_1)) ? (var_1_7) : (var_1_1)))))) : (var_1_8 == ((signed long int) var_1_7)))) && ((((var_1_6 * var_1_8) * var_1_7) <= (var_1_8 - var_1_1)) ? ((var_1_5 <= (var_1_8 + var_1_8)) ? (var_1_10 == ((float) var_1_13)) : 1) : ((var_1_1 >= var_1_1) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_13)))) ; [L92] RET, EXPR property() [L92] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_8=32, var_1_10=2, var_1_13=2, var_1_1=64, var_1_2=1, var_1_5=1, var_1_6=-33, var_1_7=-191, var_1_8=65] [L19] reach_error() VAL [isInitial=1, last_1_var_1_8=32, var_1_10=2, var_1_13=2, var_1_1=64, var_1_2=1, var_1_5=1, var_1_6=-33, var_1_7=-191, var_1_8=65] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 1, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 84 NumberOfCodeBlocks, 84 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 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-14 03:33:22,093 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_306f17d2-d67e-494b-8dc5-81ef3242d8ef/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_306f17d2-d67e-494b-8dc5-81ef3242d8ef/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_306f17d2-d67e-494b-8dc5-81ef3242d8ef/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_306f17d2-d67e-494b-8dc5-81ef3242d8ef/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_306f17d2-d67e-494b-8dc5-81ef3242d8ef/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-30.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_306f17d2-d67e-494b-8dc5-81ef3242d8ef/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_306f17d2-d67e-494b-8dc5-81ef3242d8ef/bin/utaipan-verify-sOmjnqqW8E --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4fcc2ce47bc034780fb01758f27a0099ceca40e7fe000487fe647a6fb5f368a8 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 03:33:25,471 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 03:33:25,589 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_306f17d2-d67e-494b-8dc5-81ef3242d8ef/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2024-11-14 03:33:25,595 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 03:33:25,599 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 03:33:25,691 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 03:33:25,695 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 03:33:25,695 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 03:33:25,696 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 03:33:25,696 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 03:33:25,696 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 03:33:25,696 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 03:33:25,697 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 03:33:25,697 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 03:33:25,697 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 03:33:25,697 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 03:33:25,697 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 03:33:25,698 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 03:33:25,698 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 03:33:25,698 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 03:33:25,698 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 03:33:25,698 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 03:33:25,698 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 03:33:25,713 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 03:33:25,713 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 03:33:25,713 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-14 03:33:25,713 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 03:33:25,713 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-14 03:33:25,713 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 03:33:25,713 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 03:33:25,713 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 03:33:25,714 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 03:33:25,714 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-14 03:33:25,714 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 03:33:25,714 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 03:33:25,714 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:33:25,714 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 03:33:25,714 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 03:33:25,714 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 03:33:25,715 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-14 03:33:25,715 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-14 03:33:25,715 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 03:33:25,715 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 03:33:25,715 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_306f17d2-d67e-494b-8dc5-81ef3242d8ef/bin/utaipan-verify-sOmjnqqW8E 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 -> Taipan 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 -> 4fcc2ce47bc034780fb01758f27a0099ceca40e7fe000487fe647a6fb5f368a8 [2024-11-14 03:33:26,097 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 03:33:26,112 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 03:33:26,115 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 03:33:26,117 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 03:33:26,121 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 03:33:26,122 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_306f17d2-d67e-494b-8dc5-81ef3242d8ef/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-30.i Unable to find full path for "g++" [2024-11-14 03:33:28,423 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 03:33:28,767 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 03:33:28,772 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_306f17d2-d67e-494b-8dc5-81ef3242d8ef/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-30.i [2024-11-14 03:33:28,806 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_306f17d2-d67e-494b-8dc5-81ef3242d8ef/bin/utaipan-verify-sOmjnqqW8E/data/a4978764b/e693c2c9f1d24d08b5b2d3228e6f211f/FLAG230904866 [2024-11-14 03:33:28,840 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_306f17d2-d67e-494b-8dc5-81ef3242d8ef/bin/utaipan-verify-sOmjnqqW8E/data/a4978764b/e693c2c9f1d24d08b5b2d3228e6f211f [2024-11-14 03:33:28,844 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 03:33:28,846 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 03:33:28,848 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 03:33:28,848 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 03:33:28,854 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 03:33:28,856 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:33:28" (1/1) ... [2024-11-14 03:33:28,857 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f680fcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:33:28, skipping insertion in model container [2024-11-14 03:33:28,860 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:33:28" (1/1) ... [2024-11-14 03:33:28,887 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 03:33:29,106 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_306f17d2-d67e-494b-8dc5-81ef3242d8ef/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-30.i[915,928] [2024-11-14 03:33:29,181 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:33:29,213 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 03:33:29,228 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_306f17d2-d67e-494b-8dc5-81ef3242d8ef/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-30.i[915,928] [2024-11-14 03:33:29,250 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:33:29,272 INFO L204 MainTranslator]: Completed translation [2024-11-14 03:33:29,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:33:29 WrapperNode [2024-11-14 03:33:29,274 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 03:33:29,275 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 03:33:29,275 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 03:33:29,275 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 03:33:29,286 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:33:29" (1/1) ... [2024-11-14 03:33:29,304 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:33:29" (1/1) ... [2024-11-14 03:33:29,342 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 84 [2024-11-14 03:33:29,342 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 03:33:29,343 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 03:33:29,343 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 03:33:29,343 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 03:33:29,353 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:33:29" (1/1) ... [2024-11-14 03:33:29,354 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:33:29" (1/1) ... [2024-11-14 03:33:29,357 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:33:29" (1/1) ... [2024-11-14 03:33:29,358 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:33:29" (1/1) ... [2024-11-14 03:33:29,367 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:33:29" (1/1) ... [2024-11-14 03:33:29,372 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:33:29" (1/1) ... [2024-11-14 03:33:29,374 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:33:29" (1/1) ... [2024-11-14 03:33:29,376 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:33:29" (1/1) ... [2024-11-14 03:33:29,384 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 03:33:29,385 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 03:33:29,385 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 03:33:29,385 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 03:33:29,386 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:33:29" (1/1) ... [2024-11-14 03:33:29,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:33:29,421 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_306f17d2-d67e-494b-8dc5-81ef3242d8ef/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:33:29,435 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_306f17d2-d67e-494b-8dc5-81ef3242d8ef/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 03:33:29,438 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_306f17d2-d67e-494b-8dc5-81ef3242d8ef/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 03:33:29,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 03:33:29,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-14 03:33:29,471 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-14 03:33:29,471 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-14 03:33:29,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 03:33:29,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 03:33:29,589 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 03:33:29,591 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 03:33:30,119 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-14 03:33:30,119 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 03:33:30,137 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 03:33:30,137 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-14 03:33:30,138 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:33:30 BoogieIcfgContainer [2024-11-14 03:33:30,138 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 03:33:30,142 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 03:33:30,142 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 03:33:30,148 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 03:33:30,149 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 03:33:28" (1/3) ... [2024-11-14 03:33:30,149 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20990b2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:33:30, skipping insertion in model container [2024-11-14 03:33:30,150 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:33:29" (2/3) ... [2024-11-14 03:33:30,150 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20990b2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:33:30, skipping insertion in model container [2024-11-14 03:33:30,150 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:33:30" (3/3) ... [2024-11-14 03:33:30,152 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-30.i [2024-11-14 03:33:30,173 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 03:33:30,175 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-30.i that has 2 procedures, 42 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-14 03:33:30,258 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 03:33:30,281 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=FINITE_AUTOMATA, 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;@11e32198, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 03:33:30,282 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-14 03:33:30,288 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-14 03:33:30,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-14 03:33:30,301 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:33:30,303 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 03:33:30,304 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:33:30,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:33:30,313 INFO L85 PathProgramCache]: Analyzing trace with hash -224234091, now seen corresponding path program 1 times [2024-11-14 03:33:30,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:33:30,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1011523267] [2024-11-14 03:33:30,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:33:30,332 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-14 03:33:30,333 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_306f17d2-d67e-494b-8dc5-81ef3242d8ef/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:33:30,341 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_306f17d2-d67e-494b-8dc5-81ef3242d8ef/bin/utaipan-verify-sOmjnqqW8E/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-14 03:33:30,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_306f17d2-d67e-494b-8dc5-81ef3242d8ef/bin/utaipan-verify-sOmjnqqW8E/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-14 03:33:30,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:33:30,738 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-14 03:33:30,751 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:33:30,815 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-11-14 03:33:30,815 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:33:30,816 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:33:30,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1011523267] [2024-11-14 03:33:30,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1011523267] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:33:30,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:33:30,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:33:30,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076021915] [2024-11-14 03:33:30,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:33:30,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-14 03:33:30,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:33:30,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-14 03:33:30,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 03:33:30,876 INFO L87 Difference]: Start difference. First operand has 42 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-14 03:33:30,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:33:30,916 INFO L93 Difference]: Finished difference Result 77 states and 127 transitions. [2024-11-14 03:33:30,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 03:33:30,919 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 74 [2024-11-14 03:33:30,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:33:30,928 INFO L225 Difference]: With dead ends: 77 [2024-11-14 03:33:30,928 INFO L226 Difference]: Without dead ends: 38 [2024-11-14 03:33:30,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 03:33:30,940 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 03:33:30,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 03:33:30,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-14 03:33:30,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-14 03:33:30,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-14 03:33:31,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 53 transitions. [2024-11-14 03:33:31,008 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 53 transitions. Word has length 74 [2024-11-14 03:33:31,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:33:31,010 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 53 transitions. [2024-11-14 03:33:31,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-14 03:33:31,011 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 53 transitions. [2024-11-14 03:33:31,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-14 03:33:31,016 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:33:31,016 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 03:33:31,027 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_306f17d2-d67e-494b-8dc5-81ef3242d8ef/bin/utaipan-verify-sOmjnqqW8E/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-14 03:33:31,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_306f17d2-d67e-494b-8dc5-81ef3242d8ef/bin/utaipan-verify-sOmjnqqW8E/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-14 03:33:31,217 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:33:31,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:33:31,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1128730733, now seen corresponding path program 1 times [2024-11-14 03:33:31,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:33:31,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1522668418] [2024-11-14 03:33:31,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:33:31,223 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-14 03:33:31,223 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_306f17d2-d67e-494b-8dc5-81ef3242d8ef/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:33:31,231 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_306f17d2-d67e-494b-8dc5-81ef3242d8ef/bin/utaipan-verify-sOmjnqqW8E/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-14 03:33:31,236 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_306f17d2-d67e-494b-8dc5-81ef3242d8ef/bin/utaipan-verify-sOmjnqqW8E/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-14 03:33:31,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:33:31,686 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-14 03:33:31,701 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:33:42,444 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-14 03:33:42,445 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:33:42,446 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:33:42,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1522668418] [2024-11-14 03:33:42,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1522668418] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:33:42,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:33:42,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-14 03:33:42,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691397588] [2024-11-14 03:33:42,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:33:42,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-14 03:33:42,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:33:42,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-14 03:33:42,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-11-14 03:33:42,453 INFO L87 Difference]: Start difference. First operand 38 states and 53 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-14 03:33:48,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:33:48,525 INFO L93 Difference]: Finished difference Result 109 states and 144 transitions. [2024-11-14 03:33:48,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-14 03:33:48,534 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 74 [2024-11-14 03:33:48,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:33:48,539 INFO L225 Difference]: With dead ends: 109 [2024-11-14 03:33:48,539 INFO L226 Difference]: Without dead ends: 74 [2024-11-14 03:33:48,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=134, Invalid=418, Unknown=0, NotChecked=0, Total=552 [2024-11-14 03:33:48,542 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 104 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:33:48,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 177 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-14 03:33:48,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-14 03:33:48,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 49. [2024-11-14 03:33:48,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-14 03:33:48,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 65 transitions. [2024-11-14 03:33:48,558 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 65 transitions. Word has length 74 [2024-11-14 03:33:48,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:33:48,558 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 65 transitions. [2024-11-14 03:33:48,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-14 03:33:48,559 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 65 transitions. [2024-11-14 03:33:48,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-14 03:33:48,561 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:33:48,562 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 03:33:48,569 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_306f17d2-d67e-494b-8dc5-81ef3242d8ef/bin/utaipan-verify-sOmjnqqW8E/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-14 03:33:48,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_306f17d2-d67e-494b-8dc5-81ef3242d8ef/bin/utaipan-verify-sOmjnqqW8E/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-14 03:33:48,766 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:33:48,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:33:48,767 INFO L85 PathProgramCache]: Analyzing trace with hash -892309357, now seen corresponding path program 1 times [2024-11-14 03:33:48,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:33:48,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [413536865] [2024-11-14 03:33:48,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:33:48,768 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-14 03:33:48,768 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_306f17d2-d67e-494b-8dc5-81ef3242d8ef/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:33:48,776 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_306f17d2-d67e-494b-8dc5-81ef3242d8ef/bin/utaipan-verify-sOmjnqqW8E/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-14 03:33:48,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_306f17d2-d67e-494b-8dc5-81ef3242d8ef/bin/utaipan-verify-sOmjnqqW8E/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-14 03:33:49,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:33:49,203 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-14 03:33:49,212 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:33:57,988 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 132 proven. 15 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-11-14 03:33:57,988 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:34:42,159 WARN L286 SmtUtils]: Spent 20.16s on a formula simplification that was a NOOP. DAG size: 107 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:35:27,214 WARN L286 SmtUtils]: Spent 24.04s on a formula simplification that was a NOOP. DAG size: 106 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:36:12,902 WARN L286 SmtUtils]: Spent 19.22s on a formula simplification that was a NOOP. DAG size: 88 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:36:55,974 WARN L286 SmtUtils]: Spent 23.70s on a formula simplification. DAG size of input: 85 DAG size of output: 82 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:37:28,132 WARN L286 SmtUtils]: Spent 7.99s on a formula simplification that was a NOOP. DAG size: 69 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:37:44,112 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-14 03:37:44,113 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:37:44,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [413536865] [2024-11-14 03:37:44,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [413536865] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-14 03:37:44,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 03:37:44,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [15] total 26 [2024-11-14 03:37:44,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745601251] [2024-11-14 03:37:44,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:37:44,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-14 03:37:44,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:37:44,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-14 03:37:44,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=528, Unknown=6, NotChecked=0, Total=650 [2024-11-14 03:37:44,116 INFO L87 Difference]: Start difference. First operand 49 states and 65 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-14 03:37:49,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:37:51,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:38:22,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:38:28,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:38:36,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:38:40,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:38:56,423 WARN L286 SmtUtils]: Spent 9.08s on a formula simplification. DAG size of input: 76 DAG size of output: 81 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:38:59,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:39:29,264 WARN L286 SmtUtils]: Spent 24.04s on a formula simplification. DAG size of input: 93 DAG size of output: 98 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:39:32,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:39:36,522 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse13 ((_ zero_extend 24) c_~var_1_1~0))) (let ((.cse14 (bvneg .cse13)) (.cse20 ((_ zero_extend 24) c_~var_1_7~0))) (let ((.cse18 (= (_ bv0 8) c_~var_1_2~0)) (.cse6 ((_ sign_extend 16) c_~var_1_5~0)) (.cse45 (bvadd .cse14 .cse20))) (let ((.cse21 (bvadd c_~var_1_8~0 .cse14)) (.cse37 (forall ((~var_1_6~0 (_ BitVec 16))) (bvsle (bvmul (bvmul ((_ sign_extend 16) ~var_1_6~0) .cse20) .cse20) .cse45))) (.cse7 (fp.eq c_~var_1_13~0 c_~var_1_13~0)) (.cse31 (bvadd (bvneg .cse20) .cse13)) (.cse47 (forall ((~var_1_6~0 (_ BitVec 16)) (~last_1_var_1_8~0 (_ BitVec 32))) (let ((.cse49 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse6) .cse49))) (bvsle (bvmul (bvmul .cse49 .cse20) .cse20) .cse45))))) (.cse17 (= .cse13 .cse20)) (.cse22 (not .cse18))) (let ((.cse4 (bvslt .cse13 .cse6)) (.cse39 (or (and (or .cse17 (forall ((~var_1_6~0 (_ BitVec 16)) (~last_1_var_1_8~0 (_ BitVec 32))) (let ((.cse48 ((_ sign_extend 16) ~var_1_6~0))) (or (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse6) .cse48)) (bvsle (bvmul (bvmul .cse48 .cse20) .cse20) .cse45))))) (or .cse47 .cse17)) .cse22)) (.cse40 (or .cse47 .cse17 .cse18)) (.cse2 (bvslt .cse20 .cse13)) (.cse36 (= .cse31 .cse20)) (.cse34 (or .cse47 .cse18)) (.cse35 (or (and (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse44 ((_ sign_extend 16) ~var_1_6~0))) (or (forall ((~last_1_var_1_8~0 (_ BitVec 32))) (not (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse6) .cse44)))) (bvsle (bvmul (bvmul .cse44 .cse20) .cse20) .cse45)))) (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse46 ((_ sign_extend 16) ~var_1_6~0))) (or (forall ((~last_1_var_1_8~0 (_ BitVec 32))) (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse6) .cse46))) (bvsle (bvmul (bvmul .cse46 .cse20) .cse20) .cse45))))) .cse22)) (.cse38 (or .cse37 .cse7)) (.cse29 (= c_~var_1_8~0 .cse20)) (.cse15 (forall ((~var_1_6~0 (_ BitVec 16))) (bvsle (bvmul (bvmul c_~var_1_8~0 ((_ sign_extend 16) ~var_1_6~0)) .cse20) .cse21)))) (let ((.cse8 (or .cse29 .cse15)) (.cse10 (or .cse15 .cse7)) (.cse16 (forall ((~var_1_6~0 (_ BitVec 16)) (~last_1_var_1_8~0 (_ BitVec 32))) (let ((.cse43 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse6) .cse43))) (bvsle (bvmul (bvmul c_~var_1_8~0 .cse43) .cse20) .cse21))))) (.cse0 (and (or (let ((.cse41 (bvsle .cse6 (bvmul (_ bv2 32) .cse20))) (.cse42 (and .cse34 .cse35))) (and (or (not .cse41) .cse42) .cse38 (or .cse41 .cse42))) .cse36) (or (not .cse36) (and .cse34 .cse35 .cse38)))) (.cse1 (not .cse2)) (.cse3 (and .cse39 .cse38 .cse40)) (.cse12 (not .cse4))) (and (or (and (or .cse0 .cse1) (or .cse2 .cse3)) .cse4) (or (forall ((~var_1_7~0 (_ BitVec 8)) (~var_1_6~0 (_ BitVec 16))) (let ((.cse5 ((_ zero_extend 24) ~var_1_7~0))) (or (bvsle (bvmul .cse5 (bvmul .cse5 ((_ sign_extend 16) ~var_1_6~0))) (bvadd (bvneg .cse5) .cse5)) (bvslt .cse5 .cse6)))) .cse7) (or .cse2 (let ((.cse9 (or (and (or .cse17 (forall ((~var_1_6~0 (_ BitVec 16)) (~last_1_var_1_8~0 (_ BitVec 32))) (let ((.cse19 ((_ sign_extend 16) ~var_1_6~0))) (or (bvsle (bvmul (bvmul c_~var_1_8~0 .cse19) .cse20) .cse21) (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse6) .cse19)))))) (or .cse16 .cse17)) .cse22)) (.cse11 (or .cse16 .cse17 .cse18))) (and (or (and .cse8 .cse9 .cse10 .cse11) .cse4) (or .cse12 (and .cse9 .cse10 (or (= c_~var_1_8~0 (bvadd .cse13 .cse14)) .cse15) .cse11))))) (or .cse1 (let ((.cse26 (or .cse16 .cse18)) (.cse27 (or (and (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse32 ((_ sign_extend 16) ~var_1_6~0))) (or (bvsle (bvmul (bvmul c_~var_1_8~0 .cse32) .cse20) .cse21) (forall ((~last_1_var_1_8~0 (_ BitVec 32))) (not (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse6) .cse32))))))) (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse33 ((_ sign_extend 16) ~var_1_6~0))) (or (forall ((~last_1_var_1_8~0 (_ BitVec 32))) (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse6) .cse33))) (bvsle (bvmul (bvmul c_~var_1_8~0 .cse33) .cse20) .cse21))))) .cse22))) (let ((.cse28 (and .cse26 .cse27)) (.cse30 (bvsle .cse6 (bvmul (_ bv2 32) c_~var_1_8~0)))) (let ((.cse25 (= c_~var_1_8~0 .cse31)) (.cse23 (or .cse28 .cse30)) (.cse24 (or (not .cse30) .cse28))) (and (or (and (or (and .cse8 .cse10 .cse23 .cse24) .cse25) (or (not .cse25) (and .cse8 .cse26 .cse27 .cse10))) .cse4) (or .cse12 (and (or .cse28 (not .cse29)) .cse10 (or .cse15 .cse25) (or .cse29 (and .cse23 .cse24))))))))) (or (and (or (and (or .cse0 .cse4) (or (and .cse34 .cse35 (or .cse36 .cse37) .cse38) .cse12)) .cse1) (or .cse2 (and (or .cse3 .cse4) (or .cse12 (and .cse39 .cse37 .cse38 .cse40))))) (bvslt ((_ zero_extend 24) |c_ULTIMATE.start_step_~stepLocal_1~0#1|) .cse6))))))))) is different from true [2024-11-14 03:39:38,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:39:42,628 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:39:44,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:39:46,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:39:48,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:39:50,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:39:52,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:39:54,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:39:59,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:40:02,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:40:04,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:40:06,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:40:07,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:40:08,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:40:10,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:40:12,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:40:15,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:40:18,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:40:19,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:40:21,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:40:23,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:40:26,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:40:28,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:41:04,265 WARN L286 SmtUtils]: Spent 27.21s on a formula simplification that was a NOOP. DAG size: 111 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:41:06,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:41:07,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:41:08,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:41:11,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:41:13,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:41:15,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:41:51,700 WARN L286 SmtUtils]: Spent 28.39s on a formula simplification that was a NOOP. DAG size: 111 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:41:53,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:41:56,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:41:58,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:42:00,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:42:02,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:42:04,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:42:06,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:42:07,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:42:09,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:42:11,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:42:13,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:42:15,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:42:17,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:42:19,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:42:22,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:42:24,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:42:26,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:42:28,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:42:30,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:42:31,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:42:34,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:42:35,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:42:35,628 INFO L93 Difference]: Finished difference Result 90 states and 112 transitions. [2024-11-14 03:42:35,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-14 03:42:35,630 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 74 [2024-11-14 03:42:35,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:42:35,632 INFO L225 Difference]: With dead ends: 90 [2024-11-14 03:42:35,632 INFO L226 Difference]: Without dead ends: 88 [2024-11-14 03:42:35,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 284.4s TimeCoverageRelationStatistics Valid=151, Invalid=710, Unknown=13, NotChecked=56, Total=930 [2024-11-14 03:42:35,634 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 106 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 14 mSolverCounterUnsat, 28 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 163.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 28 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 173.6s IncrementalHoareTripleChecker+Time [2024-11-14 03:42:35,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 218 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 308 Invalid, 28 Unknown, 21 Unchecked, 173.6s Time] [2024-11-14 03:42:35,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-14 03:42:35,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 66. [2024-11-14 03:42:35,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 50 states have internal predecessors, (61), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-14 03:42:35,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 87 transitions. [2024-11-14 03:42:35,659 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 87 transitions. Word has length 74 [2024-11-14 03:42:35,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:42:35,660 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 87 transitions. [2024-11-14 03:42:35,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-14 03:42:35,660 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 87 transitions. [2024-11-14 03:42:35,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-14 03:42:35,662 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:42:35,662 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 03:42:35,670 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_306f17d2-d67e-494b-8dc5-81ef3242d8ef/bin/utaipan-verify-sOmjnqqW8E/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-14 03:42:35,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_306f17d2-d67e-494b-8dc5-81ef3242d8ef/bin/utaipan-verify-sOmjnqqW8E/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-14 03:42:35,863 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:42:35,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:42:35,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1391229201, now seen corresponding path program 1 times [2024-11-14 03:42:35,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:42:35,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [82756415] [2024-11-14 03:42:35,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:42:35,864 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-14 03:42:35,865 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_306f17d2-d67e-494b-8dc5-81ef3242d8ef/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:42:35,867 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_306f17d2-d67e-494b-8dc5-81ef3242d8ef/bin/utaipan-verify-sOmjnqqW8E/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-14 03:42:35,868 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_306f17d2-d67e-494b-8dc5-81ef3242d8ef/bin/utaipan-verify-sOmjnqqW8E/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-14 03:42:36,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:42:36,117 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-14 03:42:36,120 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:42:37,667 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 114 proven. 18 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-14 03:42:37,668 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:42:38,976 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-14 03:42:38,976 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:42:38,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [82756415] [2024-11-14 03:42:38,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [82756415] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-14 03:42:38,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 03:42:38,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2024-11-14 03:42:38,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124487130] [2024-11-14 03:42:38,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:42:38,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 03:42:38,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:42:38,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 03:42:38,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-14 03:42:38,980 INFO L87 Difference]: Start difference. First operand 66 states and 87 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-14 03:42:41,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:42:41,327 INFO L93 Difference]: Finished difference Result 190 states and 237 transitions. [2024-11-14 03:42:41,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:42:41,329 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 74 [2024-11-14 03:42:41,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:42:41,333 INFO L225 Difference]: With dead ends: 190 [2024-11-14 03:42:41,333 INFO L226 Difference]: Without dead ends: 127 [2024-11-14 03:42:41,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-11-14 03:42:41,337 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 70 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-14 03:42:41,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 161 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-14 03:42:41,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-14 03:42:41,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 59. [2024-11-14 03:42:41,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 44 states have (on average 1.25) internal successors, (55), 44 states have internal predecessors, (55), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-14 03:42:41,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 77 transitions. [2024-11-14 03:42:41,361 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 77 transitions. Word has length 74 [2024-11-14 03:42:41,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:42:41,361 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 77 transitions. [2024-11-14 03:42:41,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-14 03:42:41,362 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 77 transitions. [2024-11-14 03:42:41,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-14 03:42:41,363 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:42:41,363 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 03:42:41,375 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_306f17d2-d67e-494b-8dc5-81ef3242d8ef/bin/utaipan-verify-sOmjnqqW8E/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)] Ended with exit code 0 [2024-11-14 03:42:41,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_306f17d2-d67e-494b-8dc5-81ef3242d8ef/bin/utaipan-verify-sOmjnqqW8E/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-14 03:42:41,570 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:42:41,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:42:41,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1393076243, now seen corresponding path program 1 times [2024-11-14 03:42:41,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:42:41,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1625247345] [2024-11-14 03:42:41,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:42:41,571 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-14 03:42:41,571 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_306f17d2-d67e-494b-8dc5-81ef3242d8ef/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:42:41,573 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_306f17d2-d67e-494b-8dc5-81ef3242d8ef/bin/utaipan-verify-sOmjnqqW8E/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-14 03:42:41,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_306f17d2-d67e-494b-8dc5-81ef3242d8ef/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-14 03:42:41,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:42:41,823 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-14 03:42:41,826 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:42:47,286 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 114 proven. 18 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-14 03:42:47,287 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:43:18,666 WARN L286 SmtUtils]: Spent 11.21s on a formula simplification. DAG size of input: 64 DAG size of output: 63 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:43:30,153 WARN L286 SmtUtils]: Spent 5.81s on a formula simplification that was a NOOP. DAG size: 61 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:43:58,442 WARN L286 SmtUtils]: Spent 13.14s on a formula simplification that was a NOOP. DAG size: 74 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:44:48,971 WARN L286 SmtUtils]: Spent 28.78s on a formula simplification. DAG size of input: 82 DAG size of output: 80 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:45:19,694 WARN L286 SmtUtils]: Spent 11.93s on a formula simplification that was a NOOP. DAG size: 71 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:45:20,368 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-14 03:45:20,368 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:45:20,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1625247345] [2024-11-14 03:45:20,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1625247345] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-14 03:45:20,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 03:45:20,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2024-11-14 03:45:20,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697049257] [2024-11-14 03:45:20,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:45:20,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-14 03:45:20,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:45:20,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-14 03:45:20,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=245, Unknown=4, NotChecked=0, Total=306 [2024-11-14 03:45:20,371 INFO L87 Difference]: Start difference. First operand 59 states and 77 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-14 03:45:22,644 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ zero_extend 24) c_~var_1_7~0)) (.cse46 ((_ zero_extend 24) c_~var_1_1~0))) (let ((.cse39 (bvneg .cse46)) (.cse47 (bvneg .cse3)) (.cse24 (= (_ bv0 8) c_~var_1_2~0))) (let ((.cse23 (not .cse24)) (.cse2 (bvadd .cse47 .cse46)) (.cse4 (bvadd .cse47 .cse46 .cse39)) (.cse40 (bvadd .cse46 .cse39)) (.cse43 (bvadd .cse46 (bvmul (_ bv2 32) .cse39))) (.cse0 ((_ sign_extend 16) c_~var_1_5~0))) (let ((.cse25 (bvslt .cse3 .cse46)) (.cse16 (= c_~var_1_8~0 .cse3)) (.cse6 (bvslt .cse46 .cse0)) (.cse26 (= .cse46 .cse3)) (.cse41 (forall ((~var_1_6~0 (_ BitVec 16)) (~last_1_var_1_8~0 (_ BitVec 32))) (let ((.cse51 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse0) .cse51))) (not (bvsle (bvmul .cse3 (bvmul .cse51 .cse40)) .cse43)))))) (.cse1 (or (forall ((~var_1_6~0 (_ BitVec 16)) (~last_1_var_1_8~0 (_ BitVec 32))) (let ((.cse50 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse0) .cse50))) (not (bvsle (bvmul (bvmul .cse2 .cse50) .cse3) .cse4))))) .cse24)) (.cse5 (or (and (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse48 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsle (bvmul (bvmul .cse2 .cse48) .cse3) .cse4)) (forall ((~last_1_var_1_8~0 (_ BitVec 32))) (not (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse0) .cse48))))))) (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse49 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsle (bvmul (bvmul .cse2 .cse49) .cse3) .cse4)) (forall ((~last_1_var_1_8~0 (_ BitVec 32))) (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse0) .cse49))))))) .cse23))) (let ((.cse10 (bvsle .cse0 (bvadd (bvmul (_ bv2 32) .cse46) (bvmul (_ bv2 32) .cse47)))) (.cse8 (let ((.cse44 (= .cse2 .cse3)) (.cse45 (and .cse1 .cse5))) (and (or .cse44 .cse45) (or (not .cse44) .cse45)))) (.cse11 (or (and (or .cse26 (forall ((~var_1_6~0 (_ BitVec 16)) (~last_1_var_1_8~0 (_ BitVec 32))) (let ((.cse42 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsle (bvmul .cse3 (bvmul .cse42 .cse40)) .cse43)) (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse0) .cse42)))))) (or .cse26 .cse41)) .cse23)) (.cse12 (or .cse26 .cse41 .cse24)) (.cse7 (not .cse6)) (.cse19 (not .cse16)) (.cse20 (= c_~var_1_8~0 .cse2)) (.cse9 (not .cse25)) (.cse27 (= c_~var_1_8~0 .cse40)) (.cse29 (bvadd c_~var_1_8~0 .cse39)) (.cse13 (bvsle .cse0 (bvmul (_ bv2 32) c_~var_1_8~0)))) (and (or (not (bvslt ((_ zero_extend 24) |c_ULTIMATE.start_step_~stepLocal_1~0#1|) .cse0)) (and (or (and (or (and .cse1 (forall ((~var_1_6~0 (_ BitVec 16))) (not (bvsle (bvmul (bvmul .cse2 ((_ sign_extend 16) ~var_1_6~0)) .cse3) .cse4))) .cse5) .cse6) (or .cse7 .cse8)) .cse9 .cse10) .cse11 .cse12)) (or .cse13 (let ((.cse28 ((_ sign_extend 16) c_~var_1_6~0))) (let ((.cse21 (forall ((~last_1_var_1_8~0 (_ BitVec 32))) (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse0) .cse28)))) (.cse14 (bvsle (bvmul (bvmul c_~var_1_8~0 .cse28) .cse3) .cse29)) (.cse22 (forall ((~last_1_var_1_8~0 (_ BitVec 32))) (not (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse0) .cse28)))))) (and (or (let ((.cse15 (or .cse22 .cse24)) (.cse17 (or (and .cse21 .cse22) .cse23))) (and .cse14 (or .cse6 (and .cse15 .cse16 .cse17)) (or .cse7 (let ((.cse18 (and .cse15 .cse17))) (and (or .cse16 .cse18) (or .cse19 .cse18) .cse20))))) .cse9) (or .cse25 (and (or .cse23 (and (or .cse26 .cse22) (or .cse26 .cse21))) .cse14 .cse27 (or .cse26 .cse22 .cse24))))))) (or .cse7 (and (or .cse9 .cse10 .cse8) .cse11 .cse12)) (or (let ((.cse30 (forall ((~var_1_6~0 (_ BitVec 16))) (not (bvsle (bvmul (bvmul c_~var_1_8~0 ((_ sign_extend 16) ~var_1_6~0)) .cse3) .cse29)))) (.cse34 (forall ((~var_1_6~0 (_ BitVec 16)) (~last_1_var_1_8~0 (_ BitVec 32))) (let ((.cse38 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse0) .cse38))) (not (bvsle (bvmul (bvmul c_~var_1_8~0 .cse38) .cse3) .cse29))))))) (and (or (let ((.cse31 (or (and (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse35 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsle (bvmul (bvmul c_~var_1_8~0 .cse35) .cse3) .cse29)) (forall ((~last_1_var_1_8~0 (_ BitVec 32))) (not (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse0) .cse35))))))) (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse36 ((_ sign_extend 16) ~var_1_6~0))) (or (forall ((~last_1_var_1_8~0 (_ BitVec 32))) (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse0) .cse36))) (not (bvsle (bvmul (bvmul c_~var_1_8~0 .cse36) .cse3) .cse29)))))) .cse23)) (.cse32 (or .cse34 .cse24))) (and (or (and (or .cse30 .cse16) .cse31 .cse32) .cse6) (or .cse7 (let ((.cse33 (and .cse31 .cse32))) (and (or .cse19 .cse33) (or .cse30 .cse20) (or .cse16 .cse33)))))) .cse9) (or .cse25 (and (or .cse30 .cse27) (or .cse34 .cse26 .cse24) (or (and (or .cse26 (forall ((~var_1_6~0 (_ BitVec 16)) (~last_1_var_1_8~0 (_ BitVec 32))) (let ((.cse37 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsle (bvmul (bvmul c_~var_1_8~0 .cse37) .cse3) .cse29)) (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse0) .cse37)))))) (or .cse34 .cse26)) .cse23))))) .cse13))))))) is different from true [2024-11-14 03:45:25,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:45:27,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:45:29,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:45:31,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:45:34,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:45:35,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:45:39,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:45:42,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:45:44,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:45:45,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:45:49,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:45:50,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:45:52,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:45:54,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:45:56,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:46:00,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:46:02,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:46:04,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:46:38,143 WARN L286 SmtUtils]: Spent 29.19s on a formula simplification that was a NOOP. DAG size: 84 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:46:42,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:46:43,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:46:48,432 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ zero_extend 24) c_~var_1_7~0)) (.cse35 ((_ zero_extend 24) c_~var_1_1~0))) (let ((.cse29 (bvneg .cse35)) (.cse36 (bvneg .cse3)) (.cse19 (= (_ bv0 8) c_~var_1_2~0))) (let ((.cse23 (not .cse19)) (.cse2 (bvadd .cse36 .cse35)) (.cse4 (bvadd .cse36 .cse35 .cse29)) (.cse25 (bvadd .cse35 .cse29)) (.cse32 (bvadd .cse35 (bvmul (_ bv2 32) .cse29))) (.cse0 ((_ sign_extend 16) c_~var_1_5~0))) (let ((.cse24 (bvslt .cse3 .cse35)) (.cse6 (bvslt .cse35 .cse0)) (.cse26 (= .cse35 .cse3)) (.cse30 (forall ((~var_1_6~0 (_ BitVec 16)) (~last_1_var_1_8~0 (_ BitVec 32))) (let ((.cse40 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse0) .cse40))) (not (bvsle (bvmul .cse3 (bvmul .cse40 .cse25)) .cse32)))))) (.cse1 (or (forall ((~var_1_6~0 (_ BitVec 16)) (~last_1_var_1_8~0 (_ BitVec 32))) (let ((.cse39 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse0) .cse39))) (not (bvsle (bvmul (bvmul .cse2 .cse39) .cse3) .cse4))))) .cse19)) (.cse5 (or (and (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse37 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsle (bvmul (bvmul .cse2 .cse37) .cse3) .cse4)) (forall ((~last_1_var_1_8~0 (_ BitVec 32))) (not (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse0) .cse37))))))) (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse38 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsle (bvmul (bvmul .cse2 .cse38) .cse3) .cse4)) (forall ((~last_1_var_1_8~0 (_ BitVec 32))) (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse0) .cse38))))))) .cse23))) (let ((.cse10 (bvsle .cse0 (bvadd (bvmul (_ bv2 32) .cse35) (bvmul (_ bv2 32) .cse36)))) (.cse8 (let ((.cse33 (= .cse2 .cse3)) (.cse34 (and .cse1 .cse5))) (and (or .cse33 .cse34) (or (not .cse33) .cse34)))) (.cse11 (or (and (or .cse26 (forall ((~var_1_6~0 (_ BitVec 16)) (~last_1_var_1_8~0 (_ BitVec 32))) (let ((.cse31 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsle (bvmul .cse3 (bvmul .cse31 .cse25)) .cse32)) (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse0) .cse31)))))) (or .cse26 .cse30)) .cse23)) (.cse12 (or .cse26 .cse30 .cse19)) (.cse7 (not .cse6)) (.cse9 (not .cse24))) (and (or (not (bvslt ((_ zero_extend 24) |c_ULTIMATE.start_step_~stepLocal_1~0#1|) .cse0)) (and (or (and (or (and .cse1 (forall ((~var_1_6~0 (_ BitVec 16))) (not (bvsle (bvmul (bvmul .cse2 ((_ sign_extend 16) ~var_1_6~0)) .cse3) .cse4))) .cse5) .cse6) (or .cse7 .cse8)) .cse9 .cse10) .cse11 .cse12)) (or .cse7 (and (or .cse9 .cse10 .cse8) .cse11 .cse12)) (or (let ((.cse21 (bvadd c_~var_1_8~0 .cse29))) (let ((.cse13 (forall ((~var_1_6~0 (_ BitVec 16))) (not (bvsle (bvmul (bvmul c_~var_1_8~0 ((_ sign_extend 16) ~var_1_6~0)) .cse3) .cse21)))) (.cse18 (forall ((~var_1_6~0 (_ BitVec 16)) (~last_1_var_1_8~0 (_ BitVec 32))) (let ((.cse28 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse0) .cse28))) (not (bvsle (bvmul (bvmul c_~var_1_8~0 .cse28) .cse3) .cse21))))))) (and (or (let ((.cse14 (= c_~var_1_8~0 .cse3)) (.cse15 (or (and (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse20 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsle (bvmul (bvmul c_~var_1_8~0 .cse20) .cse3) .cse21)) (forall ((~last_1_var_1_8~0 (_ BitVec 32))) (not (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse0) .cse20))))))) (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse22 ((_ sign_extend 16) ~var_1_6~0))) (or (forall ((~last_1_var_1_8~0 (_ BitVec 32))) (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse0) .cse22))) (not (bvsle (bvmul (bvmul c_~var_1_8~0 .cse22) .cse3) .cse21)))))) .cse23)) (.cse16 (or .cse18 .cse19))) (and (or (and (or .cse13 .cse14) .cse15 .cse16) .cse6) (or .cse7 (let ((.cse17 (and .cse15 .cse16))) (and (or (not .cse14) .cse17) (or .cse13 (= c_~var_1_8~0 .cse2)) (or .cse14 .cse17)))))) .cse9) (or .cse24 (and (or .cse13 (= c_~var_1_8~0 .cse25)) (or .cse18 .cse26 .cse19) (or (and (or .cse26 (forall ((~var_1_6~0 (_ BitVec 16)) (~last_1_var_1_8~0 (_ BitVec 32))) (let ((.cse27 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsle (bvmul (bvmul c_~var_1_8~0 .cse27) .cse3) .cse21)) (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse0) .cse27)))))) (or .cse18 .cse26)) .cse23)))))) (bvsle .cse0 (bvmul (_ bv2 32) c_~var_1_8~0))))))))) is different from true [2024-11-14 03:46:50,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:46:52,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:46:56,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:46:57,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:46:59,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:47:01,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:47:04,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:47:07,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:47:09,829 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse22 ((_ zero_extend 24) c_~var_1_1~0)) (.cse20 ((_ zero_extend 24) c_~var_1_7~0))) (let ((.cse18 ((_ sign_extend 16) c_~var_1_5~0)) (.cse23 (bvneg .cse20)) (.cse31 (bvneg .cse22))) (let ((.cse13 (= (_ bv0 8) c_~var_1_2~0)) (.cse33 (bvadd .cse22 .cse31)) (.cse15 (bvslt .cse20 .cse22)) (.cse27 (bvadd .cse23 .cse22)) (.cse4 (= c_~var_1_8~0 .cse20)) (.cse2 (bvslt .cse22 .cse18))) (let ((.cse6 (not .cse2)) (.cse8 (not .cse4)) (.cse9 (= c_~var_1_8~0 .cse27)) (.cse14 (not .cse15)) (.cse17 (= c_~var_1_8~0 .cse33)) (.cse16 (= .cse22 .cse20)) (.cse12 (not .cse13)) (.cse21 (bvadd c_~var_1_8~0 .cse31)) (.cse0 (bvsle .cse18 (bvmul (_ bv2 32) c_~var_1_8~0)))) (and (or .cse0 (let ((.cse19 ((_ sign_extend 16) c_~var_1_6~0))) (let ((.cse10 (forall ((~last_1_var_1_8~0 (_ BitVec 32))) (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse18) .cse19)))) (.cse1 (bvsle (bvmul (bvmul c_~var_1_8~0 .cse19) .cse20) .cse21)) (.cse11 (forall ((~last_1_var_1_8~0 (_ BitVec 32))) (not (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse18) .cse19)))))) (and (or (let ((.cse3 (or .cse11 .cse13)) (.cse5 (or (and .cse10 .cse11) .cse12))) (and .cse1 (or .cse2 (and .cse3 .cse4 .cse5)) (or .cse6 (let ((.cse7 (and .cse3 .cse5))) (and (or .cse4 .cse7) (or .cse8 .cse7) .cse9))))) .cse14) (or .cse15 (and (or .cse12 (and (or .cse16 .cse11) (or .cse16 .cse10))) .cse1 .cse17 (or .cse16 .cse11 .cse13))))))) (or .cse6 (let ((.cse34 (bvadd .cse22 (bvmul (_ bv2 32) .cse31)))) (let ((.cse35 (forall ((~var_1_6~0 (_ BitVec 16)) (~last_1_var_1_8~0 (_ BitVec 32))) (let ((.cse36 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse18) .cse36))) (not (bvsle (bvmul .cse20 (bvmul .cse36 .cse33)) .cse34))))))) (and (or .cse14 (bvsle .cse18 (bvadd (bvmul (_ bv2 32) .cse22) (bvmul (_ bv2 32) .cse23))) (let ((.cse24 (= .cse27 .cse20)) (.cse25 (let ((.cse28 (bvadd .cse23 .cse22 .cse31))) (and (or (forall ((~var_1_6~0 (_ BitVec 16)) (~last_1_var_1_8~0 (_ BitVec 32))) (let ((.cse26 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse18) .cse26))) (not (bvsle (bvmul (bvmul .cse27 .cse26) .cse20) .cse28))))) .cse13) (or (and (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse29 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsle (bvmul (bvmul .cse27 .cse29) .cse20) .cse28)) (forall ((~last_1_var_1_8~0 (_ BitVec 32))) (not (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse18) .cse29))))))) (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse30 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsle (bvmul (bvmul .cse27 .cse30) .cse20) .cse28)) (forall ((~last_1_var_1_8~0 (_ BitVec 32))) (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse18) .cse30))))))) .cse12))))) (and (or .cse24 .cse25) (or (not .cse24) .cse25)))) (or (and (or .cse16 (forall ((~var_1_6~0 (_ BitVec 16)) (~last_1_var_1_8~0 (_ BitVec 32))) (let ((.cse32 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsle (bvmul .cse20 (bvmul .cse32 .cse33)) .cse34)) (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse18) .cse32)))))) (or .cse16 .cse35)) .cse12) (or .cse16 .cse35 .cse13))))) (or (let ((.cse37 (forall ((~var_1_6~0 (_ BitVec 16))) (not (bvsle (bvmul (bvmul c_~var_1_8~0 ((_ sign_extend 16) ~var_1_6~0)) .cse20) .cse21)))) (.cse41 (forall ((~var_1_6~0 (_ BitVec 16)) (~last_1_var_1_8~0 (_ BitVec 32))) (let ((.cse45 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse18) .cse45))) (not (bvsle (bvmul (bvmul c_~var_1_8~0 .cse45) .cse20) .cse21))))))) (and (or (let ((.cse38 (or (and (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse42 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsle (bvmul (bvmul c_~var_1_8~0 .cse42) .cse20) .cse21)) (forall ((~last_1_var_1_8~0 (_ BitVec 32))) (not (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse18) .cse42))))))) (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse43 ((_ sign_extend 16) ~var_1_6~0))) (or (forall ((~last_1_var_1_8~0 (_ BitVec 32))) (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse18) .cse43))) (not (bvsle (bvmul (bvmul c_~var_1_8~0 .cse43) .cse20) .cse21)))))) .cse12)) (.cse39 (or .cse41 .cse13))) (and (or (and (or .cse37 .cse4) .cse38 .cse39) .cse2) (or .cse6 (let ((.cse40 (and .cse38 .cse39))) (and (or .cse8 .cse40) (or .cse37 .cse9) (or .cse4 .cse40)))))) .cse14) (or .cse15 (and (or .cse37 .cse17) (or .cse41 .cse16 .cse13) (or (and (or .cse16 (forall ((~var_1_6~0 (_ BitVec 16)) (~last_1_var_1_8~0 (_ BitVec 32))) (let ((.cse44 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsle (bvmul (bvmul c_~var_1_8~0 .cse44) .cse20) .cse21)) (bvsgt ~last_1_var_1_8~0 (bvsrem (bvsdiv ~last_1_var_1_8~0 .cse18) .cse44)))))) (or .cse41 .cse16)) .cse12))))) .cse0)))))) is different from true [2024-11-14 03:47:12,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:47:15,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:47:17,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:47:19,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:47:21,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:48:15,338 WARN L286 SmtUtils]: Spent 43.69s on a formula simplification. DAG size of input: 96 DAG size of output: 127 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:48:18,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:48:19,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:48:22,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:48:23,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:48:26,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1]