./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-56.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b177be-6b37-4b7a-92f6-99a43127f904/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b177be-6b37-4b7a-92f6-99a43127f904/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b177be-6b37-4b7a-92f6-99a43127f904/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b177be-6b37-4b7a-92f6-99a43127f904/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-56.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b177be-6b37-4b7a-92f6-99a43127f904/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b177be-6b37-4b7a-92f6-99a43127f904/bin/utaipan-verify-nQ1chXbOIh --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 9db1cd65bc75e5074bada94c2cde698267c3661942827a0dbfb399cf3fcd8571 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 14:48:45,975 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 14:48:46,044 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b177be-6b37-4b7a-92f6-99a43127f904/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-12-02 14:48:46,050 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 14:48:46,051 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 14:48:46,078 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 14:48:46,079 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 14:48:46,079 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 14:48:46,080 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 14:48:46,080 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 14:48:46,081 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 14:48:46,082 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 14:48:46,082 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 14:48:46,083 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 14:48:46,083 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 14:48:46,084 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 14:48:46,084 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 14:48:46,085 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 14:48:46,085 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 14:48:46,086 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 14:48:46,086 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 14:48:46,087 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 14:48:46,088 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 14:48:46,088 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 14:48:46,089 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 14:48:46,089 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 14:48:46,090 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 14:48:46,090 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 14:48:46,090 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 14:48:46,091 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 14:48:46,091 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 14:48:46,092 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 14:48:46,092 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 14:48:46,093 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 14:48:46,093 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 14:48:46,093 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 14:48:46,093 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 14:48:46,093 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 14:48:46,094 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 14:48:46,094 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 14:48:46,094 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 14:48:46,095 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 14:48:46,095 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 14:48:46,095 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 14:48:46,095 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 14:48:46,095 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 14:48:46,095 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 14:48:46,096 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b177be-6b37-4b7a-92f6-99a43127f904/bin/utaipan-verify-nQ1chXbOIh/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b177be-6b37-4b7a-92f6-99a43127f904/bin/utaipan-verify-nQ1chXbOIh 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 -> 9db1cd65bc75e5074bada94c2cde698267c3661942827a0dbfb399cf3fcd8571 [2023-12-02 14:48:46,345 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 14:48:46,370 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 14:48:46,373 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 14:48:46,374 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 14:48:46,375 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 14:48:46,376 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b177be-6b37-4b7a-92f6-99a43127f904/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-56.i [2023-12-02 14:48:49,402 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 14:48:49,611 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 14:48:49,612 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b177be-6b37-4b7a-92f6-99a43127f904/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-56.i [2023-12-02 14:48:49,619 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b177be-6b37-4b7a-92f6-99a43127f904/bin/utaipan-verify-nQ1chXbOIh/data/856e10d73/3daeb8f16b2e4b16883826ccc15327bb/FLAG19340ffb5 [2023-12-02 14:48:49,633 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b177be-6b37-4b7a-92f6-99a43127f904/bin/utaipan-verify-nQ1chXbOIh/data/856e10d73/3daeb8f16b2e4b16883826ccc15327bb [2023-12-02 14:48:49,636 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 14:48:49,638 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 14:48:49,639 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 14:48:49,640 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 14:48:49,645 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 14:48:49,645 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:48:49" (1/1) ... [2023-12-02 14:48:49,647 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@558e6c42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:48:49, skipping insertion in model container [2023-12-02 14:48:49,647 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:48:49" (1/1) ... [2023-12-02 14:48:49,673 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 14:48:49,806 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b177be-6b37-4b7a-92f6-99a43127f904/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-56.i[915,928] [2023-12-02 14:48:49,851 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 14:48:49,865 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 14:48:49,877 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b177be-6b37-4b7a-92f6-99a43127f904/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-56.i[915,928] [2023-12-02 14:48:49,902 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 14:48:49,919 INFO L206 MainTranslator]: Completed translation [2023-12-02 14:48:49,920 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:48:49 WrapperNode [2023-12-02 14:48:49,920 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 14:48:49,921 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 14:48:49,921 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 14:48:49,921 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 14:48:49,927 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:48:49" (1/1) ... [2023-12-02 14:48:49,937 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:48:49" (1/1) ... [2023-12-02 14:48:49,980 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 96 [2023-12-02 14:48:49,981 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 14:48:49,982 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 14:48:49,982 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 14:48:49,982 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 14:48:49,992 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:48:49" (1/1) ... [2023-12-02 14:48:49,993 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:48:49" (1/1) ... [2023-12-02 14:48:49,996 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:48:49" (1/1) ... [2023-12-02 14:48:49,996 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:48:49" (1/1) ... [2023-12-02 14:48:50,004 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:48:49" (1/1) ... [2023-12-02 14:48:50,008 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:48:49" (1/1) ... [2023-12-02 14:48:50,011 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:48:49" (1/1) ... [2023-12-02 14:48:50,013 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:48:49" (1/1) ... [2023-12-02 14:48:50,017 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 14:48:50,018 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 14:48:50,018 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 14:48:50,019 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 14:48:50,020 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:48:49" (1/1) ... [2023-12-02 14:48:50,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 14:48:50,038 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b177be-6b37-4b7a-92f6-99a43127f904/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:48:50,054 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b177be-6b37-4b7a-92f6-99a43127f904/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 14:48:50,061 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b177be-6b37-4b7a-92f6-99a43127f904/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 14:48:50,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 14:48:50,092 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-02 14:48:50,092 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-02 14:48:50,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 14:48:50,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 14:48:50,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 14:48:50,162 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 14:48:50,164 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 14:48:50,418 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 14:48:50,553 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 14:48:50,554 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-02 14:48:50,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:48:50 BoogieIcfgContainer [2023-12-02 14:48:50,555 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 14:48:50,559 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 14:48:50,559 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 14:48:50,562 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 14:48:50,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:48:49" (1/3) ... [2023-12-02 14:48:50,563 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e5b75d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:48:50, skipping insertion in model container [2023-12-02 14:48:50,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:48:49" (2/3) ... [2023-12-02 14:48:50,564 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e5b75d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:48:50, skipping insertion in model container [2023-12-02 14:48:50,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:48:50" (3/3) ... [2023-12-02 14:48:50,565 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-56.i [2023-12-02 14:48:50,581 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 14:48:50,581 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 14:48:50,624 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 14:48:50,630 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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;@34d4dd0d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 14:48:50,631 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-02 14:48:50,634 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-02 14:48:50,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-02 14:48:50,641 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:48:50,642 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:48:50,642 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 14:48:50,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:48:50,646 INFO L85 PathProgramCache]: Analyzing trace with hash -2131802926, now seen corresponding path program 1 times [2023-12-02 14:48:50,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:48:50,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491879496] [2023-12-02 14:48:50,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:48:50,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:48:50,770 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-02 14:48:50,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1612143293] [2023-12-02 14:48:50,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:48:50,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:48:50,772 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b177be-6b37-4b7a-92f6-99a43127f904/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:48:50,776 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b177be-6b37-4b7a-92f6-99a43127f904/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:48:50,780 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b177be-6b37-4b7a-92f6-99a43127f904/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 14:48:51,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:48:51,238 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 30 conjunts are in the unsatisfiable core [2023-12-02 14:48:51,249 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:50:53,586 WARN L293 SmtUtils]: Spent 5.63s on a formula simplification. DAG size of input: 213 DAG size of output: 290 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-02 14:51:23,430 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 38 proven. 6 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-12-02 14:51:23,431 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:51:50,665 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2023-12-02 14:51:50,666 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:51:50,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491879496] [2023-12-02 14:51:50,666 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-02 14:51:50,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612143293] [2023-12-02 14:51:50,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1612143293] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-02 14:51:50,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 14:51:50,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2023-12-02 14:51:50,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023608202] [2023-12-02 14:51:50,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:51:50,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 14:51:50,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:51:50,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 14:51:50,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-02 14:51:50,695 INFO L87 Difference]: Start difference. First operand has 24 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-02 14:51:50,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:51:50,875 INFO L93 Difference]: Finished difference Result 67 states and 100 transitions. [2023-12-02 14:51:50,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 14:51:50,877 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 39 [2023-12-02 14:51:50,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:51:50,882 INFO L225 Difference]: With dead ends: 67 [2023-12-02 14:51:50,883 INFO L226 Difference]: Without dead ends: 44 [2023-12-02 14:51:50,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-12-02 14:51:50,887 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 11 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:51:50,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 107 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 14:51:50,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-12-02 14:51:50,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2023-12-02 14:51:50,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-02 14:51:50,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 60 transitions. [2023-12-02 14:51:50,921 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 60 transitions. Word has length 39 [2023-12-02 14:51:50,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:51:50,921 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 60 transitions. [2023-12-02 14:51:50,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-02 14:51:50,922 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 60 transitions. [2023-12-02 14:51:50,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-12-02 14:51:50,925 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:51:50,925 INFO L195 NwaCegarLoop]: trace histogram [20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2023-12-02 14:51:50,931 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b177be-6b37-4b7a-92f6-99a43127f904/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 14:51:51,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b177be-6b37-4b7a-92f6-99a43127f904/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-12-02 14:51:51,126 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 14:51:51,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:51:51,126 INFO L85 PathProgramCache]: Analyzing trace with hash 840262883, now seen corresponding path program 1 times [2023-12-02 14:51:51,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:51:51,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027443851] [2023-12-02 14:51:51,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:51:51,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:51:51,151 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-02 14:51:51,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1000061595] [2023-12-02 14:51:51,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:51:51,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:51:51,152 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b177be-6b37-4b7a-92f6-99a43127f904/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:51:51,153 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b177be-6b37-4b7a-92f6-99a43127f904/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:51:51,160 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b177be-6b37-4b7a-92f6-99a43127f904/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 14:51:51,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:51:51,309 INFO L262 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 62 conjunts are in the unsatisfiable core [2023-12-02 14:51:51,316 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:55:30,784 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 121 proven. 237 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-12-02 14:55:30,784 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:57:53,252 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (mod c_~var_1_10~0 4294967296) 1)) (.cse1 (mod c_~var_1_5~0 256))) (and (= (mod c_~last_1_var_1_11~0 65536) 0) (or (and (forall ((v_z_464 Int) (v_y_464 Int)) (let ((.cse0 (+ v_z_464 .cse1)) (.cse3 (+ (* 256 v_y_464) (* 255 v_z_464)))) (or (< (mod (mod .cse0 .cse1) 4294967296) .cse2) (< v_z_464 0) (< 255 .cse3) (< 255 .cse0) (< .cse3 .cse1)))) (forall ((v_z_464 Int) (v_y_464 Int)) (let ((.cse4 (+ (* 256 v_y_464) (* 255 v_z_464)))) (or (< 255 v_z_464) (< (mod (mod (+ v_z_464 .cse1) .cse1) 4294967296) .cse2) (< v_z_464 0) (< (mod (mod (+ (- 256) v_z_464 .cse1) .cse1) 4294967296) .cse2) (< 255 .cse4) (< .cse4 .cse1))))) (< .cse1 1)) (forall ((v_z_416 Int)) (or (< v_z_416 0) (< 255 v_z_416) (< (mod (mod v_z_416 .cse1) 4294967296) .cse2) (< (+ (* v_z_416 v_z_416) 25) .cse1))) (forall ((v_z_466 Int) (v_y_466 Int)) (let ((.cse5 (+ (* 256 v_y_466) (* 255 v_z_466)))) (or (< 255 v_z_466) (< (mod (mod (+ v_z_466 .cse1) .cse1) 4294967296) .cse2) (< 255 .cse5) (< (mod (mod (+ (- 256) v_z_466 .cse1) .cse1) 4294967296) .cse2) (< v_z_466 0) (< .cse5 0) (= .cse5 0)))) (forall ((v_z_493 Int) (v_z_476 Int) (v_y_476 Int)) (let ((.cse6 (+ (* 255 v_z_476) (* 256 v_y_476)))) (or (< (mod (mod (+ (- 256) v_z_476 .cse1) .cse1) 4294967296) .cse2) (< 255 v_z_476) (< v_z_493 0) (< 255 .cse6) (< (+ v_z_476 .cse1) 256) (< .cse6 (+ v_z_493 1)) (< (+ (* v_z_493 .cse1) (* v_z_476 v_z_493) 25) (+ (* 256 v_z_493) .cse1))))) (forall ((v_z_462 Int) (v_z_453 Int) (v_y_453 Int)) (let ((.cse8 (+ (* 256 v_y_453) (* 255 v_z_453))) (.cse7 (+ v_z_453 .cse1))) (or (< 255 .cse7) (< .cse8 v_z_462) (< 255 .cse8) (< (mod (mod .cse7 .cse1) 4294967296) .cse2) (< v_z_453 0) (< (mod (mod (+ (- 256) v_z_453 .cse1) .cse1) 4294967296) .cse2) (< v_z_462 .cse1)))) (forall ((v_z_476 Int) (v_y_476 Int) (v_z_490 Int)) (let ((.cse9 (+ (* 255 v_z_476) (* 256 v_y_476)))) (or (< (+ (* v_z_476 v_z_490) (* v_z_490 .cse1) 25) (+ (* 256 v_z_490) .cse1)) (< (mod (mod (+ v_z_476 .cse1) .cse1) 4294967296) .cse2) (< (mod (mod (+ (- 256) v_z_476 .cse1) .cse1) 4294967296) .cse2) (< 255 v_z_476) (< .cse9 (+ v_z_490 1)) (< 255 .cse9) (< v_z_490 0) (< v_z_476 0)))) (forall ((v_z_464 Int) (v_y_464 Int)) (let ((.cse10 (+ (* 256 v_y_464) (* 255 v_z_464)))) (or (< 255 v_z_464) (< (mod (mod (+ v_z_464 .cse1) .cse1) 4294967296) .cse2) (< v_z_464 0) (< .cse10 1) (< (mod (mod (+ (- 256) v_z_464 .cse1) .cse1) 4294967296) .cse2) (< 255 .cse10)))) (forall ((v_z_464 Int) (v_y_464 Int)) (let ((.cse11 (+ (* 256 v_y_464) (* 255 v_z_464)))) (or (< 255 v_z_464) (< .cse11 1) (< (mod (mod (+ (- 256) v_z_464 .cse1) .cse1) 4294967296) .cse2) (< 255 .cse11) (< (+ v_z_464 .cse1) 256)))) (forall ((v_z_464 Int) (v_y_464 Int)) (let ((.cse13 (+ (* 256 v_y_464) (* 255 v_z_464))) (.cse12 (+ v_z_464 .cse1))) (or (< (mod (mod .cse12 .cse1) 4294967296) .cse2) (< v_z_464 0) (< .cse13 1) (< 255 .cse13) (< 255 .cse12)))) (forall ((v_z_476 Int) (v_y_476 Int) (v_z_490 Int)) (let ((.cse14 (+ (* 255 v_z_476) (* 256 v_y_476)))) (or (< (+ (* v_z_476 v_z_490) (* v_z_490 .cse1) 25) (+ (* 256 v_z_490) .cse1)) (< (mod (mod (+ v_z_476 .cse1) .cse1) 4294967296) .cse2) (< (mod (mod (+ (- 256) v_z_476 .cse1) .cse1) 4294967296) .cse2) (< 255 v_z_476) (< 255 .cse14) (< v_z_490 0) (< .cse1 (+ v_z_490 1)) (< .cse14 .cse1) (< v_z_476 0)))) (forall ((v_z_462 Int) (v_z_453 Int) (v_y_453 Int)) (let ((.cse16 (+ (* 256 v_y_453) (* 255 v_z_453))) (.cse15 (+ v_z_453 .cse1))) (or (< 255 .cse15) (< .cse16 v_z_462) (< 255 .cse16) (< (+ (* v_z_462 .cse1) (* v_z_453 v_z_462) 25) .cse1) (< (mod (mod .cse15 .cse1) 4294967296) .cse2) (< v_z_453 0) (< (mod (mod (+ (- 256) v_z_453 .cse1) .cse1) 4294967296) .cse2) (< v_z_462 0)))) (forall ((v_z_466 Int) (v_y_466 Int)) (let ((.cse17 (+ v_z_466 .cse1)) (.cse18 (+ (* 256 v_y_466) (* 255 v_z_466)))) (or (< (mod (mod .cse17 .cse1) 4294967296) .cse2) (< 255 .cse18) (< 255 .cse17) (< v_z_466 0) (< .cse18 0) (= .cse18 0)))) (forall ((v_z_486 Int) (v_z_476 Int) (v_y_476 Int)) (let ((.cse19 (+ v_z_476 .cse1)) (.cse20 (+ (* 255 v_z_476) (* 256 v_y_476)))) (or (< (mod (mod .cse19 .cse1) 4294967296) .cse2) (< (+ (* v_z_476 v_z_486) 25 (* v_z_486 .cse1)) .cse1) (< 255 .cse20) (< 255 .cse19) (< .cse20 .cse1) (< .cse1 (+ v_z_486 1)) (< v_z_476 0) (< v_z_486 0)))) (forall ((v_z_462 Int) (v_z_453 Int) (v_y_453 Int)) (let ((.cse22 (+ (* 256 v_y_453) (* 255 v_z_453))) (.cse21 (+ v_z_453 .cse1))) (or (< 255 .cse21) (< .cse22 v_z_462) (< 255 .cse22) (< (+ (* v_z_462 .cse1) (* v_z_453 v_z_462) 25) .cse1) (< (mod (mod .cse21 .cse1) 4294967296) .cse2) (< v_z_453 0) (< v_z_462 0)))) (forall ((v_z_462 Int) (v_z_453 Int) (v_y_453 Int)) (let ((.cse24 (+ (* 256 v_y_453) (* 255 v_z_453))) (.cse23 (+ v_z_453 .cse1))) (or (< 255 .cse23) (< .cse24 v_z_462) (< 255 .cse24) (< (mod (mod .cse23 .cse1) 4294967296) .cse2) (< v_z_453 0) (< v_z_462 .cse1)))) (forall ((v_z_424 Int)) (or (< 255 v_z_424) (< v_z_424 .cse1) (< (mod (mod v_z_424 .cse1) 4294967296) .cse2))) (forall ((v_z_483 Int) (v_z_476 Int) (v_y_476 Int)) (let ((.cse25 (+ v_z_476 .cse1)) (.cse26 (+ (* 255 v_z_476) (* 256 v_y_476)))) (or (< (mod (mod .cse25 .cse1) 4294967296) .cse2) (< .cse1 (+ v_z_483 1)) (< 255 .cse26) (< 255 .cse25) (< v_z_483 0) (< .cse26 .cse1) (< v_z_476 0) (< (+ (* v_z_476 v_z_483) (* v_z_483 .cse1) 25) (+ .cse1 (* 256 v_z_483)))))) (forall ((v_z_483 Int) (v_z_476 Int) (v_y_476 Int)) (let ((.cse27 (+ v_z_476 .cse1)) (.cse28 (+ (* 255 v_z_476) (* 256 v_y_476)))) (or (< (mod (mod .cse27 .cse1) 4294967296) .cse2) (< 255 .cse28) (< 255 .cse27) (< v_z_483 0) (< v_z_476 0) (< .cse28 (+ v_z_483 1)) (< (+ (* v_z_476 v_z_483) (* v_z_483 .cse1) 25) (+ .cse1 (* 256 v_z_483)))))) (forall ((v_z_416 Int)) (or (< v_z_416 0) (< (mod (mod v_z_416 .cse1) 4294967296) .cse2) (< (+ (* v_z_416 v_z_416) 25) .cse1) (< .cse1 (+ v_z_416 1)))) (forall ((v_z_466 Int) (v_y_466 Int)) (let ((.cse29 (+ (* 256 v_y_466) (* 255 v_z_466)))) (or (< 255 v_z_466) (< (mod (mod (+ v_z_466 .cse1) .cse1) 4294967296) .cse2) (< 255 .cse29) (< (mod (mod (+ (- 256) v_z_466 .cse1) .cse1) 4294967296) .cse2) (< .cse29 .cse1) (< v_z_466 0) (= .cse29 0)))) (forall ((v_z_424 Int)) (or (< (+ 25 (* v_z_424 v_z_424)) .cse1) (< 255 v_z_424) (< v_z_424 0) (< (mod (mod v_z_424 .cse1) 4294967296) .cse2))) (forall ((v_z_466 Int) (v_y_466 Int)) (let ((.cse30 (+ (* 256 v_y_466) (* 255 v_z_466)))) (or (< 255 v_z_466) (< 255 .cse30) (< (+ v_z_466 .cse1) 256) (< (mod (mod (+ (- 256) v_z_466 .cse1) .cse1) 4294967296) .cse2) (< .cse30 0)))) (forall ((v_z_486 Int) (v_z_476 Int) (v_y_476 Int)) (let ((.cse31 (+ v_z_476 .cse1)) (.cse32 (+ (* 255 v_z_476) (* 256 v_y_476)))) (or (< (mod (mod .cse31 .cse1) 4294967296) .cse2) (< (+ (* v_z_476 v_z_486) 25 (* v_z_486 .cse1)) .cse1) (< 255 .cse32) (< 255 .cse31) (< .cse32 (+ v_z_486 1)) (< v_z_476 0) (< v_z_486 0)))) (forall ((v_z_462 Int) (v_z_453 Int) (v_y_453 Int)) (let ((.cse33 (+ (* 256 v_y_453) (* 255 v_z_453)))) (or (< .cse33 v_z_462) (< 255 .cse33) (< (mod (mod (+ (- 256) v_z_453 .cse1) .cse1) 4294967296) .cse2) (< 255 v_z_453) (< (+ v_z_453 .cse1) 256) (< (+ (* v_z_462 .cse1) (* v_z_453 v_z_462) 25) (+ .cse1 (* 256 v_z_462))) (< v_z_462 0)))) (forall ((v_z_504 Int) (v_z_492 Int)) (or (< 255 v_z_492) (< v_z_492 0) (< (+ (* v_z_492 v_z_504) 25) .cse1) (< 255 v_z_504) (< (mod (mod v_z_504 .cse1) 4294967296) .cse2) (< v_z_504 0))) (forall ((v_z_462 Int) (v_z_453 Int) (v_y_453 Int)) (let ((.cse34 (+ (* 256 v_y_453) (* 255 v_z_453)))) (or (< .cse34 v_z_462) (< 255 .cse34) (< (mod (mod (+ v_z_453 .cse1) .cse1) 4294967296) .cse2) (< v_z_453 0) (< (mod (mod (+ (- 256) v_z_453 .cse1) .cse1) 4294967296) .cse2) (< v_z_462 .cse1) (< 255 v_z_453) (< (+ (* v_z_462 .cse1) (* v_z_453 v_z_462) 25) (+ .cse1 (* 256 v_z_462)))))) (forall ((v_z_462 Int) (v_z_453 Int) (v_y_453 Int)) (let ((.cse35 (+ (* 256 v_y_453) (* 255 v_z_453)))) (or (< .cse35 v_z_462) (< 255 .cse35) (< (mod (mod (+ v_z_453 .cse1) .cse1) 4294967296) .cse2) (< v_z_453 0) (< (mod (mod (+ (- 256) v_z_453 .cse1) .cse1) 4294967296) .cse2) (< 255 v_z_453) (< (+ (* v_z_462 .cse1) (* v_z_453 v_z_462) 25) (+ .cse1 (* 256 v_z_462))) (< v_z_462 0)))) (forall ((v_z_462 Int) (v_z_453 Int) (v_y_453 Int)) (let ((.cse36 (+ (* 256 v_y_453) (* 255 v_z_453))) (.cse37 (+ v_z_453 .cse1))) (or (< .cse36 v_z_462) (< 255 .cse36) (< (mod (mod .cse37 .cse1) 4294967296) .cse2) (< (mod (mod (+ (- 256) v_z_453 .cse1) .cse1) 4294967296) .cse2) (< 255 v_z_453) (< .cse37 256) (< (+ (* v_z_462 .cse1) (* v_z_453 v_z_462) 25) (+ .cse1 (* 256 v_z_462))) (< v_z_462 0)))))) is different from false [2023-12-02 14:57:55,264 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (mod c_~var_1_10~0 4294967296) 1)) (.cse1 (mod c_~var_1_5~0 256))) (and (= (mod c_~last_1_var_1_11~0 65536) 0) (or (and (forall ((v_z_464 Int) (v_y_464 Int)) (let ((.cse0 (+ v_z_464 .cse1)) (.cse3 (+ (* 256 v_y_464) (* 255 v_z_464)))) (or (< (mod (mod .cse0 .cse1) 4294967296) .cse2) (< v_z_464 0) (< 255 .cse3) (< 255 .cse0) (< .cse3 .cse1)))) (forall ((v_z_464 Int) (v_y_464 Int)) (let ((.cse4 (+ (* 256 v_y_464) (* 255 v_z_464)))) (or (< 255 v_z_464) (< (mod (mod (+ v_z_464 .cse1) .cse1) 4294967296) .cse2) (< v_z_464 0) (< (mod (mod (+ (- 256) v_z_464 .cse1) .cse1) 4294967296) .cse2) (< 255 .cse4) (< .cse4 .cse1))))) (< .cse1 1)) (forall ((v_z_416 Int)) (or (< v_z_416 0) (< 255 v_z_416) (< (mod (mod v_z_416 .cse1) 4294967296) .cse2) (< (+ (* v_z_416 v_z_416) 25) .cse1))) (forall ((v_z_466 Int) (v_y_466 Int)) (let ((.cse5 (+ (* 256 v_y_466) (* 255 v_z_466)))) (or (< 255 v_z_466) (< (mod (mod (+ v_z_466 .cse1) .cse1) 4294967296) .cse2) (< 255 .cse5) (< (mod (mod (+ (- 256) v_z_466 .cse1) .cse1) 4294967296) .cse2) (< v_z_466 0) (< .cse5 0) (= .cse5 0)))) (forall ((v_z_493 Int) (v_z_476 Int) (v_y_476 Int)) (let ((.cse6 (+ (* 255 v_z_476) (* 256 v_y_476)))) (or (< (mod (mod (+ (- 256) v_z_476 .cse1) .cse1) 4294967296) .cse2) (< 255 v_z_476) (< v_z_493 0) (< 255 .cse6) (< (+ v_z_476 .cse1) 256) (< .cse6 (+ v_z_493 1)) (< (+ (* v_z_493 .cse1) (* v_z_476 v_z_493) 25) (+ (* 256 v_z_493) .cse1))))) (forall ((v_z_462 Int) (v_z_453 Int) (v_y_453 Int)) (let ((.cse8 (+ (* 256 v_y_453) (* 255 v_z_453))) (.cse7 (+ v_z_453 .cse1))) (or (< 255 .cse7) (< .cse8 v_z_462) (< 255 .cse8) (< (mod (mod .cse7 .cse1) 4294967296) .cse2) (< v_z_453 0) (< (mod (mod (+ (- 256) v_z_453 .cse1) .cse1) 4294967296) .cse2) (< v_z_462 .cse1)))) (forall ((v_z_476 Int) (v_y_476 Int) (v_z_490 Int)) (let ((.cse9 (+ (* 255 v_z_476) (* 256 v_y_476)))) (or (< (+ (* v_z_476 v_z_490) (* v_z_490 .cse1) 25) (+ (* 256 v_z_490) .cse1)) (< (mod (mod (+ v_z_476 .cse1) .cse1) 4294967296) .cse2) (< (mod (mod (+ (- 256) v_z_476 .cse1) .cse1) 4294967296) .cse2) (< 255 v_z_476) (< .cse9 (+ v_z_490 1)) (< 255 .cse9) (< v_z_490 0) (< v_z_476 0)))) (forall ((v_z_464 Int) (v_y_464 Int)) (let ((.cse10 (+ (* 256 v_y_464) (* 255 v_z_464)))) (or (< 255 v_z_464) (< (mod (mod (+ v_z_464 .cse1) .cse1) 4294967296) .cse2) (< v_z_464 0) (< .cse10 1) (< (mod (mod (+ (- 256) v_z_464 .cse1) .cse1) 4294967296) .cse2) (< 255 .cse10)))) (forall ((v_z_464 Int) (v_y_464 Int)) (let ((.cse11 (+ (* 256 v_y_464) (* 255 v_z_464)))) (or (< 255 v_z_464) (< .cse11 1) (< (mod (mod (+ (- 256) v_z_464 .cse1) .cse1) 4294967296) .cse2) (< 255 .cse11) (< (+ v_z_464 .cse1) 256)))) (forall ((v_z_464 Int) (v_y_464 Int)) (let ((.cse13 (+ (* 256 v_y_464) (* 255 v_z_464))) (.cse12 (+ v_z_464 .cse1))) (or (< (mod (mod .cse12 .cse1) 4294967296) .cse2) (< v_z_464 0) (< .cse13 1) (< 255 .cse13) (< 255 .cse12)))) (forall ((v_z_476 Int) (v_y_476 Int) (v_z_490 Int)) (let ((.cse14 (+ (* 255 v_z_476) (* 256 v_y_476)))) (or (< (+ (* v_z_476 v_z_490) (* v_z_490 .cse1) 25) (+ (* 256 v_z_490) .cse1)) (< (mod (mod (+ v_z_476 .cse1) .cse1) 4294967296) .cse2) (< (mod (mod (+ (- 256) v_z_476 .cse1) .cse1) 4294967296) .cse2) (< 255 v_z_476) (< 255 .cse14) (< v_z_490 0) (< .cse1 (+ v_z_490 1)) (< .cse14 .cse1) (< v_z_476 0)))) (forall ((v_z_462 Int) (v_z_453 Int) (v_y_453 Int)) (let ((.cse16 (+ (* 256 v_y_453) (* 255 v_z_453))) (.cse15 (+ v_z_453 .cse1))) (or (< 255 .cse15) (< .cse16 v_z_462) (< 255 .cse16) (< (+ (* v_z_462 .cse1) (* v_z_453 v_z_462) 25) .cse1) (< (mod (mod .cse15 .cse1) 4294967296) .cse2) (< v_z_453 0) (< (mod (mod (+ (- 256) v_z_453 .cse1) .cse1) 4294967296) .cse2) (< v_z_462 0)))) (forall ((v_z_466 Int) (v_y_466 Int)) (let ((.cse17 (+ v_z_466 .cse1)) (.cse18 (+ (* 256 v_y_466) (* 255 v_z_466)))) (or (< (mod (mod .cse17 .cse1) 4294967296) .cse2) (< 255 .cse18) (< 255 .cse17) (< v_z_466 0) (< .cse18 0) (= .cse18 0)))) (forall ((v_z_486 Int) (v_z_476 Int) (v_y_476 Int)) (let ((.cse19 (+ v_z_476 .cse1)) (.cse20 (+ (* 255 v_z_476) (* 256 v_y_476)))) (or (< (mod (mod .cse19 .cse1) 4294967296) .cse2) (< (+ (* v_z_476 v_z_486) 25 (* v_z_486 .cse1)) .cse1) (< 255 .cse20) (< 255 .cse19) (< .cse20 .cse1) (< .cse1 (+ v_z_486 1)) (< v_z_476 0) (< v_z_486 0)))) (forall ((v_z_462 Int) (v_z_453 Int) (v_y_453 Int)) (let ((.cse22 (+ (* 256 v_y_453) (* 255 v_z_453))) (.cse21 (+ v_z_453 .cse1))) (or (< 255 .cse21) (< .cse22 v_z_462) (< 255 .cse22) (< (+ (* v_z_462 .cse1) (* v_z_453 v_z_462) 25) .cse1) (< (mod (mod .cse21 .cse1) 4294967296) .cse2) (< v_z_453 0) (< v_z_462 0)))) (forall ((v_z_462 Int) (v_z_453 Int) (v_y_453 Int)) (let ((.cse24 (+ (* 256 v_y_453) (* 255 v_z_453))) (.cse23 (+ v_z_453 .cse1))) (or (< 255 .cse23) (< .cse24 v_z_462) (< 255 .cse24) (< (mod (mod .cse23 .cse1) 4294967296) .cse2) (< v_z_453 0) (< v_z_462 .cse1)))) (forall ((v_z_424 Int)) (or (< 255 v_z_424) (< v_z_424 .cse1) (< (mod (mod v_z_424 .cse1) 4294967296) .cse2))) (forall ((v_z_483 Int) (v_z_476 Int) (v_y_476 Int)) (let ((.cse25 (+ v_z_476 .cse1)) (.cse26 (+ (* 255 v_z_476) (* 256 v_y_476)))) (or (< (mod (mod .cse25 .cse1) 4294967296) .cse2) (< .cse1 (+ v_z_483 1)) (< 255 .cse26) (< 255 .cse25) (< v_z_483 0) (< .cse26 .cse1) (< v_z_476 0) (< (+ (* v_z_476 v_z_483) (* v_z_483 .cse1) 25) (+ .cse1 (* 256 v_z_483)))))) (forall ((v_z_483 Int) (v_z_476 Int) (v_y_476 Int)) (let ((.cse27 (+ v_z_476 .cse1)) (.cse28 (+ (* 255 v_z_476) (* 256 v_y_476)))) (or (< (mod (mod .cse27 .cse1) 4294967296) .cse2) (< 255 .cse28) (< 255 .cse27) (< v_z_483 0) (< v_z_476 0) (< .cse28 (+ v_z_483 1)) (< (+ (* v_z_476 v_z_483) (* v_z_483 .cse1) 25) (+ .cse1 (* 256 v_z_483)))))) (forall ((v_z_416 Int)) (or (< v_z_416 0) (< (mod (mod v_z_416 .cse1) 4294967296) .cse2) (< (+ (* v_z_416 v_z_416) 25) .cse1) (< .cse1 (+ v_z_416 1)))) (forall ((v_z_466 Int) (v_y_466 Int)) (let ((.cse29 (+ (* 256 v_y_466) (* 255 v_z_466)))) (or (< 255 v_z_466) (< (mod (mod (+ v_z_466 .cse1) .cse1) 4294967296) .cse2) (< 255 .cse29) (< (mod (mod (+ (- 256) v_z_466 .cse1) .cse1) 4294967296) .cse2) (< .cse29 .cse1) (< v_z_466 0) (= .cse29 0)))) (forall ((v_z_424 Int)) (or (< (+ 25 (* v_z_424 v_z_424)) .cse1) (< 255 v_z_424) (< v_z_424 0) (< (mod (mod v_z_424 .cse1) 4294967296) .cse2))) (forall ((v_z_466 Int) (v_y_466 Int)) (let ((.cse30 (+ (* 256 v_y_466) (* 255 v_z_466)))) (or (< 255 v_z_466) (< 255 .cse30) (< (+ v_z_466 .cse1) 256) (< (mod (mod (+ (- 256) v_z_466 .cse1) .cse1) 4294967296) .cse2) (< .cse30 0)))) (forall ((v_z_486 Int) (v_z_476 Int) (v_y_476 Int)) (let ((.cse31 (+ v_z_476 .cse1)) (.cse32 (+ (* 255 v_z_476) (* 256 v_y_476)))) (or (< (mod (mod .cse31 .cse1) 4294967296) .cse2) (< (+ (* v_z_476 v_z_486) 25 (* v_z_486 .cse1)) .cse1) (< 255 .cse32) (< 255 .cse31) (< .cse32 (+ v_z_486 1)) (< v_z_476 0) (< v_z_486 0)))) (forall ((v_z_462 Int) (v_z_453 Int) (v_y_453 Int)) (let ((.cse33 (+ (* 256 v_y_453) (* 255 v_z_453)))) (or (< .cse33 v_z_462) (< 255 .cse33) (< (mod (mod (+ (- 256) v_z_453 .cse1) .cse1) 4294967296) .cse2) (< 255 v_z_453) (< (+ v_z_453 .cse1) 256) (< (+ (* v_z_462 .cse1) (* v_z_453 v_z_462) 25) (+ .cse1 (* 256 v_z_462))) (< v_z_462 0)))) (forall ((v_z_504 Int) (v_z_492 Int)) (or (< 255 v_z_492) (< v_z_492 0) (< (+ (* v_z_492 v_z_504) 25) .cse1) (< 255 v_z_504) (< (mod (mod v_z_504 .cse1) 4294967296) .cse2) (< v_z_504 0))) (forall ((v_z_462 Int) (v_z_453 Int) (v_y_453 Int)) (let ((.cse34 (+ (* 256 v_y_453) (* 255 v_z_453)))) (or (< .cse34 v_z_462) (< 255 .cse34) (< (mod (mod (+ v_z_453 .cse1) .cse1) 4294967296) .cse2) (< v_z_453 0) (< (mod (mod (+ (- 256) v_z_453 .cse1) .cse1) 4294967296) .cse2) (< v_z_462 .cse1) (< 255 v_z_453) (< (+ (* v_z_462 .cse1) (* v_z_453 v_z_462) 25) (+ .cse1 (* 256 v_z_462)))))) (forall ((v_z_462 Int) (v_z_453 Int) (v_y_453 Int)) (let ((.cse35 (+ (* 256 v_y_453) (* 255 v_z_453)))) (or (< .cse35 v_z_462) (< 255 .cse35) (< (mod (mod (+ v_z_453 .cse1) .cse1) 4294967296) .cse2) (< v_z_453 0) (< (mod (mod (+ (- 256) v_z_453 .cse1) .cse1) 4294967296) .cse2) (< 255 v_z_453) (< (+ (* v_z_462 .cse1) (* v_z_453 v_z_462) 25) (+ .cse1 (* 256 v_z_462))) (< v_z_462 0)))) (forall ((v_z_462 Int) (v_z_453 Int) (v_y_453 Int)) (let ((.cse36 (+ (* 256 v_y_453) (* 255 v_z_453))) (.cse37 (+ v_z_453 .cse1))) (or (< .cse36 v_z_462) (< 255 .cse36) (< (mod (mod .cse37 .cse1) 4294967296) .cse2) (< (mod (mod (+ (- 256) v_z_453 .cse1) .cse1) 4294967296) .cse2) (< 255 v_z_453) (< .cse37 256) (< (+ (* v_z_462 .cse1) (* v_z_453 v_z_462) 25) (+ .cse1 (* 256 v_z_462))) (< v_z_462 0)))))) is different from true [2023-12-02 14:58:17,796 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~var_1_10~0 4294967296))) (or (< 2147483647 .cse0) (let ((.cse4 (+ .cse0 1)) (.cse3 (mod c_~var_1_5~0 256))) (and (= (mod c_~last_1_var_1_11~0 65536) 0) (forall ((v_z_453 Int) (v_y_453 Int)) (let ((.cse2 (+ (* 256 v_y_453) (* 255 v_z_453))) (.cse1 (+ v_z_453 .cse3))) (or (< 255 .cse1) (< .cse2 .cse3) (< 255 .cse2) (< (mod (mod .cse1 .cse3) 4294967296) .cse4) (< v_z_453 0) (< (mod (mod (+ (- 256) v_z_453 .cse3) .cse3) 4294967296) .cse4)))) (or (and (forall ((v_z_464 Int) (v_y_464 Int)) (let ((.cse5 (+ v_z_464 .cse3)) (.cse6 (+ (* 256 v_y_464) (* 255 v_z_464)))) (or (< (mod (mod .cse5 .cse3) 4294967296) .cse4) (< v_z_464 0) (< 255 .cse6) (< 255 .cse5) (< .cse6 .cse3)))) (forall ((v_z_464 Int) (v_y_464 Int)) (let ((.cse7 (+ (* 256 v_y_464) (* 255 v_z_464)))) (or (< 255 v_z_464) (< (mod (mod (+ v_z_464 .cse3) .cse3) 4294967296) .cse4) (< v_z_464 0) (< (mod (mod (+ (- 256) v_z_464 .cse3) .cse3) 4294967296) .cse4) (< 255 .cse7) (< .cse7 .cse3))))) (< .cse3 1)) (forall ((v_z_416 Int)) (or (< v_z_416 0) (< 255 v_z_416) (< (mod (mod v_z_416 .cse3) 4294967296) .cse4) (< (+ (* v_z_416 v_z_416) 25) .cse3))) (forall ((v_z_466 Int) (v_y_466 Int)) (let ((.cse8 (+ (* 256 v_y_466) (* 255 v_z_466)))) (or (< 255 v_z_466) (< (mod (mod (+ v_z_466 .cse3) .cse3) 4294967296) .cse4) (< 255 .cse8) (< (mod (mod (+ (- 256) v_z_466 .cse3) .cse3) 4294967296) .cse4) (< v_z_466 0) (< .cse8 0) (= .cse8 0)))) (forall ((v_z_493 Int) (v_z_476 Int) (v_y_476 Int)) (let ((.cse9 (+ (* 255 v_z_476) (* 256 v_y_476)))) (or (< (mod (mod (+ (- 256) v_z_476 .cse3) .cse3) 4294967296) .cse4) (< 255 v_z_476) (< v_z_493 0) (< 255 .cse9) (< (+ v_z_476 .cse3) 256) (< .cse9 (+ v_z_493 1)) (< (+ (* v_z_493 .cse3) (* v_z_476 v_z_493) 25) (+ (* 256 v_z_493) .cse3))))) (forall ((v_z_453 Int) (v_y_453 Int)) (let ((.cse11 (+ (* 256 v_y_453) (* 255 v_z_453))) (.cse10 (+ v_z_453 .cse3))) (or (< 255 .cse10) (< .cse11 .cse3) (< 255 .cse11) (< (mod (mod .cse10 .cse3) 4294967296) .cse4) (< v_z_453 0)))) (forall ((v_z_476 Int) (v_y_476 Int) (v_z_490 Int)) (let ((.cse12 (+ (* 255 v_z_476) (* 256 v_y_476)))) (or (< (+ (* v_z_476 v_z_490) (* v_z_490 .cse3) 25) (+ (* 256 v_z_490) .cse3)) (< (mod (mod (+ v_z_476 .cse3) .cse3) 4294967296) .cse4) (< (mod (mod (+ (- 256) v_z_476 .cse3) .cse3) 4294967296) .cse4) (< 255 v_z_476) (< .cse12 (+ v_z_490 1)) (< 255 .cse12) (< v_z_490 0) (< v_z_476 0)))) (forall ((v_z_464 Int) (v_y_464 Int)) (let ((.cse13 (+ (* 256 v_y_464) (* 255 v_z_464)))) (or (< 255 v_z_464) (< (mod (mod (+ v_z_464 .cse3) .cse3) 4294967296) .cse4) (< v_z_464 0) (< .cse13 1) (< (mod (mod (+ (- 256) v_z_464 .cse3) .cse3) 4294967296) .cse4) (< 255 .cse13)))) (forall ((v_z_464 Int) (v_y_464 Int)) (let ((.cse14 (+ (* 256 v_y_464) (* 255 v_z_464)))) (or (< 255 v_z_464) (< .cse14 1) (< (mod (mod (+ (- 256) v_z_464 .cse3) .cse3) 4294967296) .cse4) (< 255 .cse14) (< (+ v_z_464 .cse3) 256)))) (forall ((v_z_464 Int) (v_y_464 Int)) (let ((.cse16 (+ (* 256 v_y_464) (* 255 v_z_464))) (.cse15 (+ v_z_464 .cse3))) (or (< (mod (mod .cse15 .cse3) 4294967296) .cse4) (< v_z_464 0) (< .cse16 1) (< 255 .cse16) (< 255 .cse15)))) (forall ((v_z_476 Int) (v_y_476 Int) (v_z_490 Int)) (let ((.cse17 (+ (* 255 v_z_476) (* 256 v_y_476)))) (or (< (+ (* v_z_476 v_z_490) (* v_z_490 .cse3) 25) (+ (* 256 v_z_490) .cse3)) (< (mod (mod (+ v_z_476 .cse3) .cse3) 4294967296) .cse4) (< (mod (mod (+ (- 256) v_z_476 .cse3) .cse3) 4294967296) .cse4) (< 255 v_z_476) (< 255 .cse17) (< v_z_490 0) (< .cse3 (+ v_z_490 1)) (< .cse17 .cse3) (< v_z_476 0)))) (forall ((v_z_462 Int) (v_z_453 Int) (v_y_453 Int)) (let ((.cse19 (+ (* 256 v_y_453) (* 255 v_z_453))) (.cse18 (+ v_z_453 .cse3))) (or (< 255 .cse18) (< .cse19 v_z_462) (< 255 .cse19) (< (+ (* v_z_462 .cse3) (* v_z_453 v_z_462) 25) .cse3) (< (mod (mod .cse18 .cse3) 4294967296) .cse4) (< v_z_453 0) (< (mod (mod (+ (- 256) v_z_453 .cse3) .cse3) 4294967296) .cse4) (< v_z_462 0)))) (forall ((v_z_466 Int) (v_y_466 Int)) (let ((.cse20 (+ v_z_466 .cse3)) (.cse21 (+ (* 256 v_y_466) (* 255 v_z_466)))) (or (< (mod (mod .cse20 .cse3) 4294967296) .cse4) (< 255 .cse21) (< 255 .cse20) (< v_z_466 0) (< .cse21 0) (= .cse21 0)))) (forall ((v_z_486 Int) (v_z_476 Int) (v_y_476 Int)) (let ((.cse22 (+ v_z_476 .cse3)) (.cse23 (+ (* 255 v_z_476) (* 256 v_y_476)))) (or (< (mod (mod .cse22 .cse3) 4294967296) .cse4) (< (+ (* v_z_476 v_z_486) 25 (* v_z_486 .cse3)) .cse3) (< 255 .cse23) (< 255 .cse22) (< .cse23 .cse3) (< .cse3 (+ v_z_486 1)) (< v_z_476 0) (< v_z_486 0)))) (forall ((v_z_462 Int) (v_z_453 Int) (v_y_453 Int)) (let ((.cse25 (+ (* 256 v_y_453) (* 255 v_z_453))) (.cse24 (+ v_z_453 .cse3))) (or (< 255 .cse24) (< .cse25 v_z_462) (< 255 .cse25) (< (+ (* v_z_462 .cse3) (* v_z_453 v_z_462) 25) .cse3) (< (mod (mod .cse24 .cse3) 4294967296) .cse4) (< v_z_453 0) (< v_z_462 0)))) (forall ((v_z_424 Int)) (or (< 255 v_z_424) (< v_z_424 .cse3) (< (mod (mod v_z_424 .cse3) 4294967296) .cse4))) (forall ((v_z_483 Int) (v_z_476 Int) (v_y_476 Int)) (let ((.cse26 (+ v_z_476 .cse3)) (.cse27 (+ (* 255 v_z_476) (* 256 v_y_476)))) (or (< (mod (mod .cse26 .cse3) 4294967296) .cse4) (< .cse3 (+ v_z_483 1)) (< 255 .cse27) (< 255 .cse26) (< v_z_483 0) (< .cse27 .cse3) (< v_z_476 0) (< (+ (* v_z_476 v_z_483) (* v_z_483 .cse3) 25) (+ .cse3 (* 256 v_z_483)))))) (forall ((v_z_483 Int) (v_z_476 Int) (v_y_476 Int)) (let ((.cse28 (+ v_z_476 .cse3)) (.cse29 (+ (* 255 v_z_476) (* 256 v_y_476)))) (or (< (mod (mod .cse28 .cse3) 4294967296) .cse4) (< 255 .cse29) (< 255 .cse28) (< v_z_483 0) (< v_z_476 0) (< .cse29 (+ v_z_483 1)) (< (+ (* v_z_476 v_z_483) (* v_z_483 .cse3) 25) (+ .cse3 (* 256 v_z_483)))))) (forall ((v_z_416 Int)) (or (< v_z_416 0) (< (mod (mod v_z_416 .cse3) 4294967296) .cse4) (< (+ (* v_z_416 v_z_416) 25) .cse3) (< .cse3 (+ v_z_416 1)))) (forall ((v_z_466 Int) (v_y_466 Int)) (let ((.cse30 (+ (* 256 v_y_466) (* 255 v_z_466)))) (or (< 255 v_z_466) (< (mod (mod (+ v_z_466 .cse3) .cse3) 4294967296) .cse4) (< 255 .cse30) (< (mod (mod (+ (- 256) v_z_466 .cse3) .cse3) 4294967296) .cse4) (< .cse30 .cse3) (< v_z_466 0) (= .cse30 0)))) (forall ((v_z_424 Int)) (or (< (+ 25 (* v_z_424 v_z_424)) .cse3) (< 255 v_z_424) (< v_z_424 0) (< (mod (mod v_z_424 .cse3) 4294967296) .cse4))) (forall ((v_z_466 Int) (v_y_466 Int)) (let ((.cse31 (+ (* 256 v_y_466) (* 255 v_z_466)))) (or (< 255 v_z_466) (< 255 .cse31) (< (+ v_z_466 .cse3) 256) (< (mod (mod (+ (- 256) v_z_466 .cse3) .cse3) 4294967296) .cse4) (< .cse31 0)))) (forall ((v_z_486 Int) (v_z_476 Int) (v_y_476 Int)) (let ((.cse32 (+ v_z_476 .cse3)) (.cse33 (+ (* 255 v_z_476) (* 256 v_y_476)))) (or (< (mod (mod .cse32 .cse3) 4294967296) .cse4) (< (+ (* v_z_476 v_z_486) 25 (* v_z_486 .cse3)) .cse3) (< 255 .cse33) (< 255 .cse32) (< .cse33 (+ v_z_486 1)) (< v_z_476 0) (< v_z_486 0)))) (forall ((v_z_462 Int) (v_z_453 Int) (v_y_453 Int)) (let ((.cse34 (+ (* 256 v_y_453) (* 255 v_z_453)))) (or (< .cse34 v_z_462) (< 255 .cse34) (< (mod (mod (+ (- 256) v_z_453 .cse3) .cse3) 4294967296) .cse4) (< 255 v_z_453) (< (+ v_z_453 .cse3) 256) (< (+ (* v_z_462 .cse3) (* v_z_453 v_z_462) 25) (+ .cse3 (* 256 v_z_462))) (< v_z_462 0)))) (forall ((v_z_504 Int) (v_z_492 Int)) (or (< 255 v_z_492) (< v_z_492 0) (< (+ (* v_z_492 v_z_504) 25) .cse3) (< 255 v_z_504) (< (mod (mod v_z_504 .cse3) 4294967296) .cse4) (< v_z_504 0))) (forall ((v_z_462 Int) (v_z_453 Int) (v_y_453 Int)) (let ((.cse35 (+ (* 256 v_y_453) (* 255 v_z_453)))) (or (< .cse35 v_z_462) (< 255 .cse35) (< (mod (mod (+ v_z_453 .cse3) .cse3) 4294967296) .cse4) (< v_z_453 0) (< (mod (mod (+ (- 256) v_z_453 .cse3) .cse3) 4294967296) .cse4) (< v_z_462 .cse3) (< 255 v_z_453) (< (+ (* v_z_462 .cse3) (* v_z_453 v_z_462) 25) (+ .cse3 (* 256 v_z_462)))))) (forall ((v_z_462 Int) (v_z_453 Int) (v_y_453 Int)) (let ((.cse36 (+ (* 256 v_y_453) (* 255 v_z_453)))) (or (< .cse36 v_z_462) (< 255 .cse36) (< (mod (mod (+ v_z_453 .cse3) .cse3) 4294967296) .cse4) (< v_z_453 0) (< (mod (mod (+ (- 256) v_z_453 .cse3) .cse3) 4294967296) .cse4) (< 255 v_z_453) (< (+ (* v_z_462 .cse3) (* v_z_453 v_z_462) 25) (+ .cse3 (* 256 v_z_462))) (< v_z_462 0)))) (forall ((v_z_462 Int) (v_z_453 Int) (v_y_453 Int)) (let ((.cse37 (+ (* 256 v_y_453) (* 255 v_z_453))) (.cse38 (+ v_z_453 .cse3))) (or (< .cse37 v_z_462) (< 255 .cse37) (< (mod (mod .cse38 .cse3) 4294967296) .cse4) (< (mod (mod (+ (- 256) v_z_453 .cse3) .cse3) 4294967296) .cse4) (< 255 v_z_453) (< .cse38 256) (< (+ (* v_z_462 .cse3) (* v_z_453 v_z_462) 25) (+ .cse3 (* 256 v_z_462))) (< v_z_462 0)))))))) is different from true [2023-12-02 14:58:17,806 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:58:17,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027443851] [2023-12-02 14:58:17,807 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-02 14:58:17,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000061595] [2023-12-02 14:58:17,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1000061595] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:58:17,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [769129482] [2023-12-02 14:58:17,826 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2023-12-02 14:58:17,826 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 14:58:17,829 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 14:58:17,834 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 14:58:17,835 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 15:02:31,401 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 6 for LOIs [2023-12-02 15:02:31,403 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 15:02:34,125 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '702#(and (<= ~var_1_3~0 16) (<= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 2147483647) (<= 1 |#StackHeapBarrier|) (= 1000000 ~var_1_8~0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= 0 (+ |ULTIMATE.start_property_#res#1| 2147483648)) (<= 0 (+ |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 2147483648)) (<= 0 ~var_1_3~0) (<= ~isInitial~0 1) (<= |ULTIMATE.start_property_#res#1| 2147483647) (<= 0 (+ |ULTIMATE.start_main_#t~ret11#1| 2147483648)) (<= |ULTIMATE.start_main_#t~ret11#1| 2147483647) (<= 0 ~isInitial~0))' at error location [2023-12-02 15:02:34,126 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 15:02:34,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-12-02 15:02:34,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2023-12-02 15:02:34,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984047251] [2023-12-02 15:02:34,126 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-12-02 15:02:34,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-02 15:02:34,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:02:34,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-02 15:02:34,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1239, Unknown=3, NotChecked=146, Total=1560 [2023-12-02 15:02:34,129 INFO L87 Difference]: Start difference. First operand 42 states and 60 transitions. Second operand has 19 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 14 states have internal predecessors, (29), 8 states have call successors, (20), 8 states have call predecessors, (20), 12 states have return successors, (20), 9 states have call predecessors, (20), 8 states have call successors, (20) [2023-12-02 15:02:34,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:02:34,894 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2023-12-02 15:02:34,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 15:02:34,894 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 14 states have internal predecessors, (29), 8 states have call successors, (20), 8 states have call predecessors, (20), 12 states have return successors, (20), 9 states have call predecessors, (20), 8 states have call successors, (20) Word has length 77 [2023-12-02 15:02:34,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:02:34,895 INFO L225 Difference]: With dead ends: 60 [2023-12-02 15:02:34,895 INFO L226 Difference]: Without dead ends: 0 [2023-12-02 15:02:34,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 115 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 749 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=329, Invalid=2028, Unknown=3, NotChecked=190, Total=2550 [2023-12-02 15:02:34,898 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 17 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-02 15:02:34,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 55 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-02 15:02:34,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-02 15:02:34,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-02 15:02:34,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:02:34,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-02 15:02:34,901 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 77 [2023-12-02 15:02:34,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:02:34,901 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-02 15:02:34,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 14 states have internal predecessors, (29), 8 states have call successors, (20), 8 states have call predecessors, (20), 12 states have return successors, (20), 9 states have call predecessors, (20), 8 states have call successors, (20) [2023-12-02 15:02:34,901 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-02 15:02:34,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-02 15:02:34,904 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-02 15:02:34,911 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b177be-6b37-4b7a-92f6-99a43127f904/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-02 15:02:35,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b177be-6b37-4b7a-92f6-99a43127f904/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:02:35,106 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-02 15:02:35,296 INFO L899 garLoopResultBuilder]: For program point L60(line 60) no Hoare annotation was computed. [2023-12-02 15:02:35,296 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-02 15:02:35,296 INFO L895 garLoopResultBuilder]: At program point L85-2(lines 85 91) the Hoare annotation is: (let ((.cse1 (mod ~var_1_5~0 256)) (.cse0 (mod ~var_1_10~0 4294967296))) (and (<= 1073741823 .cse0) (= ~var_1_11~0 0) (<= 127 .cse1) (= ~last_1_var_1_11~0 0) (<= .cse1 254) (<= .cse0 2147483647))) [2023-12-02 15:02:35,296 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-02 15:02:35,297 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-02 15:02:35,297 INFO L899 garLoopResultBuilder]: For program point L69(line 69) no Hoare annotation was computed. [2023-12-02 15:02:35,297 INFO L895 garLoopResultBuilder]: At program point L65(line 65) the Hoare annotation is: (let ((.cse0 (mod ~var_1_5~0 256))) (and (= ~var_1_11~0 0) (<= 127 .cse0) (= ~last_1_var_1_11~0 0) (<= .cse0 254))) [2023-12-02 15:02:35,297 INFO L895 garLoopResultBuilder]: At program point L65-1(line 65) the Hoare annotation is: (let ((.cse0 (mod ~var_1_5~0 256))) (and (= ~var_1_11~0 0) (<= 127 .cse0) (= ~last_1_var_1_11~0 0) (<= .cse0 254))) [2023-12-02 15:02:35,297 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-02 15:02:35,297 INFO L899 garLoopResultBuilder]: For program point L66(line 66) no Hoare annotation was computed. [2023-12-02 15:02:35,297 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-02 15:02:35,298 INFO L895 garLoopResultBuilder]: At program point L62(line 62) the Hoare annotation is: (and (= ~var_1_11~0 0) (= ~last_1_var_1_11~0 0)) [2023-12-02 15:02:35,298 INFO L895 garLoopResultBuilder]: At program point L62-1(line 62) the Hoare annotation is: (and (= ~var_1_11~0 0) (<= 127 (mod ~var_1_5~0 256)) (= ~last_1_var_1_11~0 0)) [2023-12-02 15:02:35,298 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-02 15:02:35,298 INFO L895 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: (let ((.cse0 (mod ~var_1_5~0 256))) (and (= ~var_1_11~0 0) (<= 127 .cse0) (= ~last_1_var_1_11~0 0) (<= .cse0 254))) [2023-12-02 15:02:35,298 INFO L895 garLoopResultBuilder]: At program point L71-1(line 71) the Hoare annotation is: (let ((.cse0 (mod ~var_1_5~0 256))) (and (<= 1073741823 (mod ~var_1_10~0 4294967296)) (= ~var_1_11~0 0) (<= 127 .cse0) (= ~last_1_var_1_11~0 0) (<= .cse0 254))) [2023-12-02 15:02:35,298 INFO L899 garLoopResultBuilder]: For program point L63(line 63) no Hoare annotation was computed. [2023-12-02 15:02:35,298 INFO L895 garLoopResultBuilder]: At program point L59(line 59) the Hoare annotation is: (let ((.cse1 (mod ~var_1_5~0 256)) (.cse0 (mod ~var_1_10~0 4294967296))) (and (<= 1073741823 .cse0) (= ~var_1_11~0 0) (<= 127 .cse1) (= ~last_1_var_1_11~0 0) (<= .cse1 254) (<= .cse0 2147483647))) [2023-12-02 15:02:35,298 INFO L895 garLoopResultBuilder]: At program point L59-1(line 59) the Hoare annotation is: (let ((.cse1 (mod ~var_1_5~0 256)) (.cse0 (mod ~var_1_10~0 4294967296))) (and (<= 1073741823 .cse0) (= ~var_1_11~0 0) (<= 127 .cse1) (= ~last_1_var_1_11~0 0) (<= .cse1 254) (<= .cse0 2147483647))) [2023-12-02 15:02:35,298 INFO L899 garLoopResultBuilder]: For program point L72(lines 57 73) no Hoare annotation was computed. [2023-12-02 15:02:35,299 INFO L895 garLoopResultBuilder]: At program point L68(line 68) the Hoare annotation is: (let ((.cse0 (mod ~var_1_5~0 256))) (and (= ~var_1_11~0 0) (<= 127 .cse0) (= ~last_1_var_1_11~0 0) (<= .cse0 254))) [2023-12-02 15:02:35,299 INFO L895 garLoopResultBuilder]: At program point L68-1(line 68) the Hoare annotation is: (let ((.cse0 (mod ~var_1_5~0 256))) (and (= ~var_1_11~0 0) (<= 127 .cse0) (= ~last_1_var_1_11~0 0) (<= .cse0 254))) [2023-12-02 15:02:35,299 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-02 15:02:35,299 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-02 15:02:35,301 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-12-02 15:02:35,303 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-12-02 15:02:35,311 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 03:02:35 BoogieIcfgContainer [2023-12-02 15:02:35,312 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-02 15:02:35,312 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 15:02:35,312 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 15:02:35,312 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 15:02:35,313 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:48:50" (3/4) ... [2023-12-02 15:02:35,314 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-12-02 15:02:35,317 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-12-02 15:02:35,321 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2023-12-02 15:02:35,321 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2023-12-02 15:02:35,321 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-12-02 15:02:35,322 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-12-02 15:02:35,404 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b177be-6b37-4b7a-92f6-99a43127f904/bin/utaipan-verify-nQ1chXbOIh/witness.graphml [2023-12-02 15:02:35,404 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b177be-6b37-4b7a-92f6-99a43127f904/bin/utaipan-verify-nQ1chXbOIh/witness.yml [2023-12-02 15:02:35,404 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 15:02:35,405 INFO L158 Benchmark]: Toolchain (without parser) took 825767.32ms. Allocated memory was 165.7MB in the beginning and 979.4MB in the end (delta: 813.7MB). Free memory was 135.4MB in the beginning and 799.3MB in the end (delta: -663.9MB). Peak memory consumption was 151.2MB. Max. memory is 16.1GB. [2023-12-02 15:02:35,405 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 104.9MB. Free memory is still 58.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 15:02:35,405 INFO L158 Benchmark]: CACSL2BoogieTranslator took 280.63ms. Allocated memory is still 165.7MB. Free memory was 134.9MB in the beginning and 123.1MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-12-02 15:02:35,406 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.25ms. Allocated memory is still 165.7MB. Free memory was 123.1MB in the beginning and 119.5MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-12-02 15:02:35,406 INFO L158 Benchmark]: Boogie Preprocessor took 35.72ms. Allocated memory is still 165.7MB. Free memory was 119.5MB in the beginning and 117.9MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 15:02:35,406 INFO L158 Benchmark]: RCFGBuilder took 537.29ms. Allocated memory is still 165.7MB. Free memory was 117.9MB in the beginning and 88.0MB in the end (delta: 29.9MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2023-12-02 15:02:35,406 INFO L158 Benchmark]: TraceAbstraction took 824752.84ms. Allocated memory was 165.7MB in the beginning and 979.4MB in the end (delta: 813.7MB). Free memory was 87.5MB in the beginning and 804.6MB in the end (delta: -717.1MB). Peak memory consumption was 98.7MB. Max. memory is 16.1GB. [2023-12-02 15:02:35,407 INFO L158 Benchmark]: Witness Printer took 92.17ms. Allocated memory is still 979.4MB. Free memory was 804.6MB in the beginning and 799.3MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-12-02 15:02:35,409 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.24ms. Allocated memory is still 104.9MB. Free memory is still 58.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 280.63ms. Allocated memory is still 165.7MB. Free memory was 134.9MB in the beginning and 123.1MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.25ms. Allocated memory is still 165.7MB. Free memory was 123.1MB in the beginning and 119.5MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.72ms. Allocated memory is still 165.7MB. Free memory was 119.5MB in the beginning and 117.9MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 537.29ms. Allocated memory is still 165.7MB. Free memory was 117.9MB in the beginning and 88.0MB in the end (delta: 29.9MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 824752.84ms. Allocated memory was 165.7MB in the beginning and 979.4MB in the end (delta: 813.7MB). Free memory was 87.5MB in the beginning and 804.6MB in the end (delta: -717.1MB). Peak memory consumption was 98.7MB. Max. memory is 16.1GB. * Witness Printer took 92.17ms. Allocated memory is still 979.4MB. Free memory was 804.6MB in the beginning and 799.3MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 824.7s, OverallIterations: 2, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 28 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 28 mSDsluCounter, 162 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 120 mSDsCounter, 63 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 228 IncrementalHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 63 mSolverCounterUnsat, 42 mSDtfsCounter, 228 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 247 GetRequests, 184 SyntacticMatches, 4 SemanticMatches, 59 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 777 ImplicationChecksByTransitivity, 9.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=1, InterpolantAutomatonStates: 19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 41 PreInvPairs, 63 NumberOfFragments, 208 HoareAnnotationTreeSize, 41 FomulaSimplifications, 428 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 518 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 565.9s InterpolantComputationTime, 116 NumberOfCodeBlocks, 116 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 152 ConstructedInterpolants, 0 QuantifiedInterpolants, 1230 SizeOfPredicates, 50 NumberOfNonLiveVariables, 423 ConjunctsInSsa, 92 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 334/577 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 85]: Loop Invariant Derived loop invariant: ((((((1073741823 <= (var_1_10 % 4294967296)) && (var_1_11 == 0)) && (127 <= (var_1_5 % 256))) && (last_1_var_1_11 == 0)) && ((var_1_5 % 256) <= 254)) && ((var_1_10 % 4294967296) <= 2147483647)) RESULT: Ultimate proved your program to be correct! [2023-12-02 15:02:35,618 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b177be-6b37-4b7a-92f6-99a43127f904/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-12-02 15:02:35,630 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b177be-6b37-4b7a-92f6-99a43127f904/bin/utaipan-verify-nQ1chXbOIh/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 Writing output log to file Ultimate.log Result: TRUE