./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-43.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_a14fc096-3fc2-4c54-b7bd-e0770d775c0e/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a14fc096-3fc2-4c54-b7bd-e0770d775c0e/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a14fc096-3fc2-4c54-b7bd-e0770d775c0e/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a14fc096-3fc2-4c54-b7bd-e0770d775c0e/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-43.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a14fc096-3fc2-4c54-b7bd-e0770d775c0e/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a14fc096-3fc2-4c54-b7bd-e0770d775c0e/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash adaf57c8caca25e02285c35c5809f03c64bacca23d89893e8459b2d8fe50621e --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-28 23:39:29,210 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-28 23:39:29,275 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a14fc096-3fc2-4c54-b7bd-e0770d775c0e/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-28 23:39:29,279 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-28 23:39:29,280 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-28 23:39:29,304 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-28 23:39:29,305 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-28 23:39:29,306 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-28 23:39:29,306 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-28 23:39:29,307 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-28 23:39:29,307 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-28 23:39:29,308 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-28 23:39:29,309 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-28 23:39:29,309 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-28 23:39:29,310 INFO L153 SettingsManager]: * Use SBE=true [2023-11-28 23:39:29,310 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-28 23:39:29,311 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-28 23:39:29,311 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-28 23:39:29,312 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-28 23:39:29,312 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-28 23:39:29,313 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-28 23:39:29,314 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-28 23:39:29,314 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-28 23:39:29,315 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-28 23:39:29,315 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-28 23:39:29,316 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-28 23:39:29,316 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-28 23:39:29,317 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-28 23:39:29,317 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-28 23:39:29,317 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-28 23:39:29,318 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-28 23:39:29,318 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 23:39:29,318 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-28 23:39:29,319 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-28 23:39:29,319 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-28 23:39:29,319 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-28 23:39:29,319 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-28 23:39:29,319 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-28 23:39:29,320 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-28 23:39:29,320 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-28 23:39:29,320 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-28 23:39:29,320 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-28 23:39:29,321 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_a14fc096-3fc2-4c54-b7bd-e0770d775c0e/bin/uautomizer-verify-BQ2R08f2Ya/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_a14fc096-3fc2-4c54-b7bd-e0770d775c0e/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> adaf57c8caca25e02285c35c5809f03c64bacca23d89893e8459b2d8fe50621e [2023-11-28 23:39:29,520 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-28 23:39:29,541 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-28 23:39:29,543 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-28 23:39:29,544 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-28 23:39:29,545 INFO L274 PluginConnector]: CDTParser initialized [2023-11-28 23:39:29,546 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a14fc096-3fc2-4c54-b7bd-e0770d775c0e/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-43.i [2023-11-28 23:39:32,338 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-28 23:39:32,503 INFO L384 CDTParser]: Found 1 translation units. [2023-11-28 23:39:32,503 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a14fc096-3fc2-4c54-b7bd-e0770d775c0e/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-43.i [2023-11-28 23:39:32,512 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a14fc096-3fc2-4c54-b7bd-e0770d775c0e/bin/uautomizer-verify-BQ2R08f2Ya/data/630e87759/31eeb1ea5c8247628b8c4427f995b312/FLAG96766fd74 [2023-11-28 23:39:32,523 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a14fc096-3fc2-4c54-b7bd-e0770d775c0e/bin/uautomizer-verify-BQ2R08f2Ya/data/630e87759/31eeb1ea5c8247628b8c4427f995b312 [2023-11-28 23:39:32,525 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-28 23:39:32,527 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-28 23:39:32,528 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-28 23:39:32,528 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-28 23:39:32,533 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-28 23:39:32,534 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:39:32" (1/1) ... [2023-11-28 23:39:32,535 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b7cd3b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:39:32, skipping insertion in model container [2023-11-28 23:39:32,535 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:39:32" (1/1) ... [2023-11-28 23:39:32,567 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 23:39:32,692 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_a14fc096-3fc2-4c54-b7bd-e0770d775c0e/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-43.i[917,930] [2023-11-28 23:39:32,750 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 23:39:32,761 INFO L202 MainTranslator]: Completed pre-run [2023-11-28 23:39:32,775 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_a14fc096-3fc2-4c54-b7bd-e0770d775c0e/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-43.i[917,930] [2023-11-28 23:39:32,806 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 23:39:32,824 INFO L206 MainTranslator]: Completed translation [2023-11-28 23:39:32,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:39:32 WrapperNode [2023-11-28 23:39:32,825 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-28 23:39:32,826 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-28 23:39:32,826 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-28 23:39:32,827 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-28 23:39:32,835 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:39:32" (1/1) ... [2023-11-28 23:39:32,848 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:39:32" (1/1) ... [2023-11-28 23:39:32,888 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 205 [2023-11-28 23:39:32,889 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-28 23:39:32,889 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-28 23:39:32,890 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-28 23:39:32,890 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-28 23:39:32,903 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:39:32" (1/1) ... [2023-11-28 23:39:32,904 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:39:32" (1/1) ... [2023-11-28 23:39:32,907 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:39:32" (1/1) ... [2023-11-28 23:39:32,926 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-28 23:39:32,926 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:39:32" (1/1) ... [2023-11-28 23:39:32,927 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:39:32" (1/1) ... [2023-11-28 23:39:32,938 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:39:32" (1/1) ... [2023-11-28 23:39:32,942 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:39:32" (1/1) ... [2023-11-28 23:39:32,945 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:39:32" (1/1) ... [2023-11-28 23:39:32,947 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:39:32" (1/1) ... [2023-11-28 23:39:32,951 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-28 23:39:32,952 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-28 23:39:32,952 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-28 23:39:32,953 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-28 23:39:32,953 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:39:32" (1/1) ... [2023-11-28 23:39:32,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 23:39:32,970 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a14fc096-3fc2-4c54-b7bd-e0770d775c0e/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:39:32,984 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a14fc096-3fc2-4c54-b7bd-e0770d775c0e/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-28 23:39:32,992 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a14fc096-3fc2-4c54-b7bd-e0770d775c0e/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-28 23:39:33,025 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-28 23:39:33,025 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-28 23:39:33,026 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-28 23:39:33,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-28 23:39:33,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-28 23:39:33,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-28 23:39:33,140 INFO L241 CfgBuilder]: Building ICFG [2023-11-28 23:39:33,143 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-28 23:39:33,479 INFO L282 CfgBuilder]: Performing block encoding [2023-11-28 23:39:33,529 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-28 23:39:33,529 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-28 23:39:33,530 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:39:33 BoogieIcfgContainer [2023-11-28 23:39:33,530 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-28 23:39:33,533 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-28 23:39:33,533 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-28 23:39:33,536 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-28 23:39:33,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 11:39:32" (1/3) ... [2023-11-28 23:39:33,537 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c5b28f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:39:33, skipping insertion in model container [2023-11-28 23:39:33,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:39:32" (2/3) ... [2023-11-28 23:39:33,538 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c5b28f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:39:33, skipping insertion in model container [2023-11-28 23:39:33,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:39:33" (3/3) ... [2023-11-28 23:39:33,539 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-43.i [2023-11-28 23:39:33,555 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-28 23:39:33,555 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-28 23:39:33,603 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-28 23:39:33,610 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=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@22dca863, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-28 23:39:33,610 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-28 23:39:33,614 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 46 states have (on average 1.4130434782608696) internal successors, (65), 47 states have internal predecessors, (65), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2023-11-28 23:39:33,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2023-11-28 23:39:33,633 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:39:33,634 INFO L195 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-28 23:39:33,634 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 23:39:33,639 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:39:33,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1780759892, now seen corresponding path program 1 times [2023-11-28 23:39:33,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:39:33,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338159496] [2023-11-28 23:39:33,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:39:33,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:39:33,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:39:33,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 23:39:33,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:39:33,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 23:39:33,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:39:33,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 23:39:33,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:39:33,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-28 23:39:33,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:39:33,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-28 23:39:33,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:39:33,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-28 23:39:33,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:39:33,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-28 23:39:33,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:39:33,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-28 23:39:33,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:39:33,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-28 23:39:33,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:39:33,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-28 23:39:33,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:39:33,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-28 23:39:33,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:39:33,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-28 23:39:33,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:39:33,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-28 23:39:33,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:39:33,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-28 23:39:33,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:39:33,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-28 23:39:33,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:39:33,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-28 23:39:33,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:39:33,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-28 23:39:33,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:39:33,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-28 23:39:34,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:39:34,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-11-28 23:39:34,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:39:34,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-28 23:39:34,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:39:34,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-11-28 23:39:34,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:39:34,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-28 23:39:34,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:39:34,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-28 23:39:34,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:39:34,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-28 23:39:34,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:39:34,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-11-28 23:39:34,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:39:34,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-28 23:39:34,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:39:34,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-11-28 23:39:34,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:39:34,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-28 23:39:34,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:39:34,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-11-28 23:39:34,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:39:34,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2023-11-28 23:39:34,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:39:34,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2023-11-28 23:39:34,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:39:34,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2023-11-28 23:39:34,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:39:34,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2023-11-28 23:39:34,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:39:34,079 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2023-11-28 23:39:34,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:39:34,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338159496] [2023-11-28 23:39:34,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338159496] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:39:34,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:39:34,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:39:34,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447770967] [2023-11-28 23:39:34,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:39:34,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-28 23:39:34,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:39:34,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-28 23:39:34,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-28 23:39:34,120 INFO L87 Difference]: Start difference. First operand has 82 states, 46 states have (on average 1.4130434782608696) internal successors, (65), 47 states have internal predecessors, (65), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2023-11-28 23:39:34,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:39:34,169 INFO L93 Difference]: Finished difference Result 161 states and 293 transitions. [2023-11-28 23:39:34,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-28 23:39:34,172 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) Word has length 200 [2023-11-28 23:39:34,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:39:34,179 INFO L225 Difference]: With dead ends: 161 [2023-11-28 23:39:34,179 INFO L226 Difference]: Without dead ends: 80 [2023-11-28 23:39:34,182 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-28 23:39:34,185 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-28 23:39:34,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-28 23:39:34,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-11-28 23:39:34,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2023-11-28 23:39:34,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 45 states have internal predecessors, (60), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2023-11-28 23:39:34,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 126 transitions. [2023-11-28 23:39:34,229 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 126 transitions. Word has length 200 [2023-11-28 23:39:34,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:39:34,230 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 126 transitions. [2023-11-28 23:39:34,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2023-11-28 23:39:34,230 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 126 transitions. [2023-11-28 23:39:34,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2023-11-28 23:39:34,236 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:39:34,243 INFO L195 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-28 23:39:34,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-28 23:39:34,244 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 23:39:34,246 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:39:34,246 INFO L85 PathProgramCache]: Analyzing trace with hash -223693138, now seen corresponding path program 1 times [2023-11-28 23:39:34,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:39:34,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888682633] [2023-11-28 23:39:34,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:39:34,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:39:34,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:39:34,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 23:39:34,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:39:34,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-28 23:39:34,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:39:34,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-28 23:39:34,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:39:34,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-28 23:39:34,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:39:34,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-28 23:39:34,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:39:34,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-28 23:39:34,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:39:34,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-28 23:39:34,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:39:34,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-28 23:39:34,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:39:34,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-28 23:39:34,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:39:34,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-28 23:39:34,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:39:34,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-28 23:39:34,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:39:34,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-28 23:39:34,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:39:34,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-28 23:39:34,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:39:34,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-28 23:39:34,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:39:34,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-28 23:39:34,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:39:34,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-28 23:39:34,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:39:34,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-28 23:39:34,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:39:34,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-28 23:39:34,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:39:34,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-11-28 23:39:34,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:39:34,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-28 23:39:34,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:39:34,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-11-28 23:39:34,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:39:34,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-28 23:39:34,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:39:34,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-28 23:39:34,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:39:34,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-28 23:39:34,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:39:34,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-11-28 23:39:34,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:39:34,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-28 23:39:34,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:39:34,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-11-28 23:39:34,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:39:34,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-28 23:39:34,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:39:34,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-11-28 23:39:34,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:39:34,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2023-11-28 23:39:34,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:39:34,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2023-11-28 23:39:34,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:39:34,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2023-11-28 23:39:34,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:39:34,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2023-11-28 23:39:34,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:39:34,645 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2023-11-28 23:39:34,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:39:34,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888682633] [2023-11-28 23:39:34,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888682633] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:39:34,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:39:34,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 23:39:34,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613785982] [2023-11-28 23:39:34,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:39:34,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:39:34,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:39:34,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:39:34,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:39:34,651 INFO L87 Difference]: Start difference. First operand 80 states and 126 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2023-11-28 23:39:34,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:39:34,692 INFO L93 Difference]: Finished difference Result 160 states and 253 transitions. [2023-11-28 23:39:34,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:39:34,693 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 200 [2023-11-28 23:39:34,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:39:34,696 INFO L225 Difference]: With dead ends: 160 [2023-11-28 23:39:34,697 INFO L226 Difference]: Without dead ends: 81 [2023-11-28 23:39:34,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:39:34,700 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-28 23:39:34,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 238 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-28 23:39:34,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-11-28 23:39:34,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2023-11-28 23:39:34,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 46 states have (on average 1.326086956521739) internal successors, (61), 46 states have internal predecessors, (61), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2023-11-28 23:39:34,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 127 transitions. [2023-11-28 23:39:34,718 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 127 transitions. Word has length 200 [2023-11-28 23:39:34,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:39:34,720 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 127 transitions. [2023-11-28 23:39:34,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2023-11-28 23:39:34,721 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 127 transitions. [2023-11-28 23:39:34,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2023-11-28 23:39:34,725 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:39:34,726 INFO L195 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-28 23:39:34,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-28 23:39:34,726 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 23:39:34,727 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:39:34,727 INFO L85 PathProgramCache]: Analyzing trace with hash 34472300, now seen corresponding path program 1 times [2023-11-28 23:39:34,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:39:34,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061646472] [2023-11-28 23:39:34,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:39:34,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:39:34,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:39:34,891 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 23:39:34,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:39:35,064 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 23:39:35,065 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-28 23:39:35,066 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-28 23:39:35,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-28 23:39:35,071 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-28 23:39:35,075 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-28 23:39:35,160 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-28 23:39:35,162 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short25 could not be translated [2023-11-28 23:39:35,188 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 11:39:35 BoogieIcfgContainer [2023-11-28 23:39:35,188 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-28 23:39:35,189 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-28 23:39:35,189 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-28 23:39:35,189 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-28 23:39:35,189 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:39:33" (3/4) ... [2023-11-28 23:39:35,191 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-28 23:39:35,193 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-28 23:39:35,194 INFO L158 Benchmark]: Toolchain (without parser) took 2666.57ms. Allocated memory was 153.1MB in the beginning and 211.8MB in the end (delta: 58.7MB). Free memory was 107.5MB in the beginning and 72.5MB in the end (delta: 35.0MB). Peak memory consumption was 94.1MB. Max. memory is 16.1GB. [2023-11-28 23:39:35,194 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 109.1MB. Free memory is still 59.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-28 23:39:35,194 INFO L158 Benchmark]: CACSL2BoogieTranslator took 297.60ms. Allocated memory is still 153.1MB. Free memory was 107.5MB in the beginning and 93.4MB in the end (delta: 14.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-28 23:39:35,195 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.59ms. Allocated memory is still 153.1MB. Free memory was 93.4MB in the beginning and 90.3MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-28 23:39:35,195 INFO L158 Benchmark]: Boogie Preprocessor took 61.88ms. Allocated memory is still 153.1MB. Free memory was 90.3MB in the beginning and 86.5MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-28 23:39:35,196 INFO L158 Benchmark]: RCFGBuilder took 578.20ms. Allocated memory is still 153.1MB. Free memory was 86.5MB in the beginning and 107.0MB in the end (delta: -20.5MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. [2023-11-28 23:39:35,196 INFO L158 Benchmark]: TraceAbstraction took 1655.04ms. Allocated memory was 153.1MB in the beginning and 211.8MB in the end (delta: 58.7MB). Free memory was 106.0MB in the beginning and 72.5MB in the end (delta: 33.6MB). Peak memory consumption was 92.1MB. Max. memory is 16.1GB. [2023-11-28 23:39:35,197 INFO L158 Benchmark]: Witness Printer took 4.13ms. Allocated memory is still 211.8MB. Free memory is still 72.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-28 23:39:35,199 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.14ms. Allocated memory is still 109.1MB. Free memory is still 59.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 297.60ms. Allocated memory is still 153.1MB. Free memory was 107.5MB in the beginning and 93.4MB in the end (delta: 14.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.59ms. Allocated memory is still 153.1MB. Free memory was 93.4MB in the beginning and 90.3MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.88ms. Allocated memory is still 153.1MB. Free memory was 90.3MB in the beginning and 86.5MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 578.20ms. Allocated memory is still 153.1MB. Free memory was 86.5MB in the beginning and 107.0MB in the end (delta: -20.5MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1655.04ms. Allocated memory was 153.1MB in the beginning and 211.8MB in the end (delta: 58.7MB). Free memory was 106.0MB in the beginning and 72.5MB in the end (delta: 33.6MB). Peak memory consumption was 92.1MB. Max. memory is 16.1GB. * Witness Printer took 4.13ms. Allocated memory is still 211.8MB. Free memory is still 72.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short25 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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 145, overapproximation of someBinaryDOUBLEComparisonOperation at line 145. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 1000.6; [L23] float var_1_2 = 255.675; [L24] float var_1_3 = 10.4; [L25] float var_1_4 = 31.4; [L26] double var_1_5 = 7.75; [L27] double var_1_6 = 63.1; [L28] signed char var_1_7 = 32; [L29] signed long int var_1_8 = -1; [L30] signed long int var_1_9 = 50; [L31] signed char var_1_10 = 64; [L32] signed short int var_1_11 = 5; [L33] unsigned short int var_1_12 = 4; [L34] unsigned char var_1_13 = 1; [L35] unsigned short int var_1_14 = 49632; [L36] unsigned short int var_1_15 = 0; [L37] signed char var_1_16 = 50; [L38] float var_1_17 = 128.5; [L39] signed char var_1_18 = 2; [L40] signed char var_1_19 = 25; [L41] signed char var_1_20 = 10; [L42] signed char var_1_21 = 1; [L43] signed char var_1_22 = 8; [L44] unsigned long int var_1_23 = 25; [L45] unsigned short int var_1_24 = 32; [L46] unsigned long int var_1_25 = 16; [L47] signed long int var_1_26 = 50; [L149] isInitial = 1 [L150] FCALL initially() [L151] COND TRUE 1 [L152] FCALL updateLastVariables() [L153] CALL updateVariables() [L89] var_1_2 = __VERIFIER_nondet_float() [L90] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_3=52/5, var_1_4=157/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_3=52/5, var_1_4=157/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32, var_1_8=-1, var_1_9=50] [L90] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_3=52/5, var_1_4=157/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32, var_1_8=-1, var_1_9=50] [L91] var_1_3 = __VERIFIER_nondet_float() [L92] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_4=157/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_4=157/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32, var_1_8=-1, var_1_9=50] [L92] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_4=157/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32, var_1_8=-1, var_1_9=50] [L93] var_1_4 = __VERIFIER_nondet_float() [L94] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_5=31/4, var_1_6=631/10, var_1_7=32, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_5=31/4, var_1_6=631/10, var_1_7=32, var_1_8=-1, var_1_9=50] [L94] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_5=31/4, var_1_6=631/10, var_1_7=32, var_1_8=-1, var_1_9=50] [L95] CALL assume_abort_if_not(var_1_4 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_5=31/4, var_1_6=631/10, var_1_7=32, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_5=31/4, var_1_6=631/10, var_1_7=32, var_1_8=-1, var_1_9=50] [L95] RET assume_abort_if_not(var_1_4 != 0.0F) VAL [isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_5=31/4, var_1_6=631/10, var_1_7=32, var_1_8=-1, var_1_9=50] [L96] var_1_5 = __VERIFIER_nondet_double() [L97] CALL assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_6=631/10, var_1_7=32, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_6=631/10, var_1_7=32, var_1_8=-1, var_1_9=50] [L97] RET assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_6=631/10, var_1_7=32, var_1_8=-1, var_1_9=50] [L98] var_1_6 = __VERIFIER_nondet_double() [L99] CALL assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=-1, var_1_9=50] [L99] RET assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=-1, var_1_9=50] [L100] var_1_8 = __VERIFIER_nondet_long() [L101] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=50] [L101] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=50] [L102] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=50] [L102] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=50] [L103] var_1_9 = __VERIFIER_nondet_long() [L104] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L104] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L105] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L105] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L106] var_1_10 = __VERIFIER_nondet_char() [L107] CALL assume_abort_if_not(var_1_10 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L107] RET assume_abort_if_not(var_1_10 >= -127) VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L108] CALL assume_abort_if_not(var_1_10 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L108] RET assume_abort_if_not(var_1_10 <= 126) VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L109] var_1_13 = __VERIFIER_nondet_uchar() [L110] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L110] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L111] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L111] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L112] var_1_14 = __VERIFIER_nondet_ushort() [L113] CALL assume_abort_if_not(var_1_14 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L113] RET assume_abort_if_not(var_1_14 >= 32767) VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L114] CALL assume_abort_if_not(var_1_14 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L114] RET assume_abort_if_not(var_1_14 <= 65534) VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L115] var_1_15 = __VERIFIER_nondet_ushort() [L116] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L116] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L117] CALL assume_abort_if_not(var_1_15 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=32767, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=32767, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L117] RET assume_abort_if_not(var_1_15 <= 32767) VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=32767, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L118] var_1_17 = __VERIFIER_nondet_float() [L119] CALL assume_abort_if_not((var_1_17 >= -922337.2036854776000e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854776000e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=32767, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=32767, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L119] RET assume_abort_if_not((var_1_17 >= -922337.2036854776000e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854776000e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=32767, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L120] var_1_18 = __VERIFIER_nondet_char() [L121] CALL assume_abort_if_not(var_1_18 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L121] RET assume_abort_if_not(var_1_18 >= -63) VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L122] CALL assume_abort_if_not(var_1_18 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L122] RET assume_abort_if_not(var_1_18 <= 63) VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L123] var_1_19 = __VERIFIER_nondet_char() [L124] CALL assume_abort_if_not(var_1_19 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L124] RET assume_abort_if_not(var_1_19 >= -63) VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L125] CALL assume_abort_if_not(var_1_19 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L125] RET assume_abort_if_not(var_1_19 <= 63) VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L126] var_1_20 = __VERIFIER_nondet_char() [L127] CALL assume_abort_if_not(var_1_20 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=5003/5, var_1_20=-63, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=5003/5, var_1_20=-63, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L127] RET assume_abort_if_not(var_1_20 >= -63) VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=5003/5, var_1_20=-63, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L128] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=5003/5, var_1_20=-63, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=5003/5, var_1_20=-63, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L128] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=5003/5, var_1_20=-63, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L129] var_1_21 = __VERIFIER_nondet_char() [L130] CALL assume_abort_if_not(var_1_21 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=5003/5, var_1_20=-63, var_1_21=-1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=5003/5, var_1_20=-63, var_1_21=-1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L130] RET assume_abort_if_not(var_1_21 >= -1) VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=5003/5, var_1_20=-63, var_1_21=-1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L131] CALL assume_abort_if_not(var_1_21 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=5003/5, var_1_20=-63, var_1_21=-1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=5003/5, var_1_20=-63, var_1_21=-1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L131] RET assume_abort_if_not(var_1_21 <= 126) VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=5003/5, var_1_20=-63, var_1_21=-1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L132] var_1_22 = __VERIFIER_nondet_char() [L133] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=5003/5, var_1_20=-63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=5003/5, var_1_20=-63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L133] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=5003/5, var_1_20=-63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L134] CALL assume_abort_if_not(var_1_22 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=5003/5, var_1_20=-63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=5003/5, var_1_20=-63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L134] RET assume_abort_if_not(var_1_22 <= 126) VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=5003/5, var_1_20=-63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L135] var_1_24 = __VERIFIER_nondet_ushort() [L136] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=5003/5, var_1_20=-63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=5003/5, var_1_20=-63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L136] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=5003/5, var_1_20=-63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L137] CALL assume_abort_if_not(var_1_24 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=5003/5, var_1_20=-63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=5003/5, var_1_20=-63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L137] RET assume_abort_if_not(var_1_24 <= 32767) VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=5003/5, var_1_20=-63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L138] var_1_25 = __VERIFIER_nondet_ulong() [L139] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=5003/5, var_1_20=-63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=5003/5, var_1_20=-63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L139] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=5003/5, var_1_20=-63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L140] CALL assume_abort_if_not(var_1_25 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=5003/5, var_1_20=-63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=65534, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=5003/5, var_1_20=-63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=65534, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L140] RET assume_abort_if_not(var_1_25 <= 4294967294) VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=5003/5, var_1_20=-63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=65534, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L153] RET updateVariables() [L154] CALL step() [L51] COND TRUE (- 1000.5f) != (var_1_2 * (var_1_3 / var_1_4)) [L52] var_1_1 = ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))) VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=65539, var_1_20=-63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=65534, var_1_26=50, var_1_5=65539, var_1_6=65539, var_1_7=32, var_1_8=0, var_1_9=0] [L56] EXPR var_1_8 & var_1_9 VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=65539, var_1_20=-63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=65534, var_1_26=50, var_1_5=65539, var_1_6=65539, var_1_7=32, var_1_8=0, var_1_9=0] [L56] COND FALSE !(-4 > (var_1_8 & var_1_9)) [L59] COND FALSE !(var_1_1 > var_1_4) [L62] var_1_11 = ((((var_1_7) < (((16 - 32) + (64 + var_1_10)))) ? (var_1_7) : (((16 - 32) + (64 + var_1_10))))) VAL [isInitial=1, var_1_10=-16, var_1_11=32, var_1_12=4, var_1_13=1, var_1_14=65534, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=65539, var_1_20=-63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=65534, var_1_26=50, var_1_5=65539, var_1_6=65539, var_1_7=32, var_1_8=0, var_1_9=0] [L64] COND TRUE \read(var_1_13) [L65] var_1_12 = (var_1_14 - var_1_15) VAL [isInitial=1, var_1_10=-16, var_1_11=32, var_1_12=32767, var_1_13=1, var_1_14=65534, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=65539, var_1_20=-63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=65534, var_1_26=50, var_1_5=65539, var_1_6=65539, var_1_7=32, var_1_8=0, var_1_9=0] [L67] signed char stepLocal_0 = var_1_19; VAL [isInitial=1, stepLocal_0=63, var_1_10=-16, var_1_11=32, var_1_12=32767, var_1_13=1, var_1_14=65534, var_1_15=32767, var_1_16=50, var_1_18=-63, var_1_19=63, var_1_1=65539, var_1_20=-63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=65534, var_1_26=50, var_1_5=65539, var_1_6=65539, var_1_7=32, var_1_8=0, var_1_9=0] [L68] COND TRUE var_1_2 <= (((((var_1_3) < (var_1_17)) ? (var_1_3) : (var_1_17))) + var_1_1) [L69] var_1_16 = ((((var_1_10) < ((((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))) + var_1_20))) ? (var_1_10) : ((((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))) + var_1_20)))) VAL [isInitial=1, stepLocal_0=63, var_1_10=-16, var_1_11=32, var_1_12=32767, var_1_13=1, var_1_14=65534, var_1_15=32767, var_1_16=-126, var_1_18=-63, var_1_19=63, var_1_1=65539, var_1_20=-63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=65534, var_1_26=50, var_1_5=65539, var_1_6=65539, var_1_7=32, var_1_8=0, var_1_9=0] [L77] COND TRUE (- (var_1_14 - var_1_24)) < var_1_10 [L78] var_1_23 = (var_1_24 + (var_1_22 + 4u)) VAL [isInitial=1, stepLocal_0=63, var_1_10=-16, var_1_11=32, var_1_12=32767, var_1_13=1, var_1_14=65534, var_1_15=32767, var_1_16=-126, var_1_18=-63, var_1_19=63, var_1_1=65539, var_1_20=-63, var_1_21=-1, var_1_22=0, var_1_23=32771, var_1_24=32767, var_1_25=65534, var_1_26=50, var_1_5=65539, var_1_6=65539, var_1_7=32, var_1_8=0, var_1_9=0] [L82] COND FALSE !(var_1_6 != 49.125) VAL [isInitial=1, stepLocal_0=63, var_1_10=-16, var_1_11=32, var_1_12=32767, var_1_13=1, var_1_14=65534, var_1_15=32767, var_1_16=-126, var_1_18=-63, var_1_19=63, var_1_1=65539, var_1_20=-63, var_1_21=-1, var_1_22=0, var_1_23=32771, var_1_24=32767, var_1_25=65534, var_1_26=50, var_1_5=65539, var_1_6=65539, var_1_7=32, var_1_8=0, var_1_9=0] [L154] RET step() [L155] CALL, EXPR property() [L145] EXPR (((- 1000.5f) != (var_1_2 * (var_1_3 / var_1_4))) ? (var_1_1 == ((double) ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) : (var_1_1 == ((double) var_1_5))) && ((-4 > (var_1_8 & var_1_9)) ? (var_1_7 == ((signed char) var_1_10)) : 1) VAL [isInitial=1, var_1_10=-16, var_1_11=32, var_1_12=32767, var_1_13=1, var_1_14=65534, var_1_15=32767, var_1_16=-126, var_1_18=-63, var_1_19=63, var_1_1=65539, var_1_20=-63, var_1_21=-1, var_1_22=0, var_1_23=32771, var_1_24=32767, var_1_25=65534, var_1_26=50, var_1_5=65539, var_1_6=65539, var_1_7=32, var_1_8=0, var_1_9=0] [L145-L146] return ((((((((- 1000.5f) != (var_1_2 * (var_1_3 / var_1_4))) ? (var_1_1 == ((double) ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) : (var_1_1 == ((double) var_1_5))) && ((-4 > (var_1_8 & var_1_9)) ? (var_1_7 == ((signed char) var_1_10)) : 1)) && ((var_1_1 > var_1_4) ? (var_1_11 == ((signed short int) var_1_10)) : (var_1_11 == ((signed short int) ((((var_1_7) < (((16 - 32) + (64 + var_1_10)))) ? (var_1_7) : (((16 - 32) + (64 + var_1_10))))))))) && (var_1_13 ? (var_1_12 == ((unsigned short int) (var_1_14 - var_1_15))) : 1)) && ((var_1_2 <= (((((var_1_3) < (var_1_17)) ? (var_1_3) : (var_1_17))) + var_1_1)) ? (var_1_16 == ((signed char) ((((var_1_10) < ((((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))) + var_1_20))) ? (var_1_10) : ((((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))) + var_1_20)))))) : ((var_1_19 < var_1_20) ? (var_1_16 == ((signed char) (var_1_21 - var_1_22))) : (var_1_16 == ((signed char) var_1_10))))) && (((- (var_1_14 - var_1_24)) < var_1_10) ? (var_1_23 == ((unsigned long int) (var_1_24 + (var_1_22 + 4u)))) : (var_1_23 == ((unsigned long int) ((((var_1_14) < (var_1_25)) ? (var_1_14) : (var_1_25))))))) && ((var_1_6 != 49.125) ? ((((((64u) < 0 ) ? -(64u) : (64u))) < var_1_9) ? (var_1_26 == ((signed long int) var_1_15)) : 1) : 1) ; [L155] RET, EXPR property() [L155] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=-16, var_1_11=32, var_1_12=32767, var_1_13=1, var_1_14=65534, var_1_15=32767, var_1_16=-126, var_1_18=-63, var_1_19=63, var_1_1=65539, var_1_20=-63, var_1_21=-1, var_1_22=0, var_1_23=32771, var_1_24=32767, var_1_25=65534, var_1_26=50, var_1_5=65539, var_1_6=65539, var_1_7=32, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=-16, var_1_11=32, var_1_12=32767, var_1_13=1, var_1_14=65534, var_1_15=32767, var_1_16=-126, var_1_18=-63, var_1_19=63, var_1_1=65539, var_1_20=-63, var_1_21=-1, var_1_22=0, var_1_23=32771, var_1_24=32767, var_1_25=65534, var_1_26=50, var_1_5=65539, var_1_6=65539, var_1_7=32, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 82 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 3, TraceHistogramMax: 33, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 361 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 116 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16 IncrementalHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 245 mSDtfsCounter, 16 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 170 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=0, InterpolantAutomatonStates: 5, 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 600 NumberOfCodeBlocks, 600 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 398 ConstructedInterpolants, 0 QuantifiedInterpolants, 400 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 4224/4224 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 [2023-11-28 23:39:35,228 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a14fc096-3fc2-4c54-b7bd-e0770d775c0e/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a14fc096-3fc2-4c54-b7bd-e0770d775c0e/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a14fc096-3fc2-4c54-b7bd-e0770d775c0e/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a14fc096-3fc2-4c54-b7bd-e0770d775c0e/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a14fc096-3fc2-4c54-b7bd-e0770d775c0e/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-43.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a14fc096-3fc2-4c54-b7bd-e0770d775c0e/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a14fc096-3fc2-4c54-b7bd-e0770d775c0e/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash adaf57c8caca25e02285c35c5809f03c64bacca23d89893e8459b2d8fe50621e --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-28 23:39:37,200 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-28 23:39:37,268 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a14fc096-3fc2-4c54-b7bd-e0770d775c0e/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-28 23:39:37,275 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-28 23:39:37,275 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-28 23:39:37,303 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-28 23:39:37,303 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-28 23:39:37,304 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-28 23:39:37,305 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-28 23:39:37,305 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-28 23:39:37,306 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-28 23:39:37,306 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-28 23:39:37,307 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-28 23:39:37,308 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-28 23:39:37,308 INFO L153 SettingsManager]: * Use SBE=true [2023-11-28 23:39:37,309 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-28 23:39:37,309 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-28 23:39:37,310 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-28 23:39:37,310 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-28 23:39:37,311 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-28 23:39:37,311 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-28 23:39:37,312 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-28 23:39:37,313 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-28 23:39:37,313 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-28 23:39:37,313 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-28 23:39:37,314 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-28 23:39:37,314 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-28 23:39:37,315 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-28 23:39:37,315 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-28 23:39:37,315 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-28 23:39:37,316 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-28 23:39:37,316 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-28 23:39:37,317 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-28 23:39:37,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 23:39:37,317 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-28 23:39:37,317 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-28 23:39:37,318 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-28 23:39:37,318 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-28 23:39:37,318 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-28 23:39:37,318 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-28 23:39:37,318 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-28 23:39:37,319 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-28 23:39:37,319 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-28 23:39:37,319 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-28 23:39:37,319 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-28 23:39:37,319 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_a14fc096-3fc2-4c54-b7bd-e0770d775c0e/bin/uautomizer-verify-BQ2R08f2Ya/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_a14fc096-3fc2-4c54-b7bd-e0770d775c0e/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> adaf57c8caca25e02285c35c5809f03c64bacca23d89893e8459b2d8fe50621e [2023-11-28 23:39:37,641 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-28 23:39:37,662 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-28 23:39:37,665 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-28 23:39:37,666 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-28 23:39:37,667 INFO L274 PluginConnector]: CDTParser initialized [2023-11-28 23:39:37,668 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a14fc096-3fc2-4c54-b7bd-e0770d775c0e/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-43.i [2023-11-28 23:39:40,551 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-28 23:39:40,757 INFO L384 CDTParser]: Found 1 translation units. [2023-11-28 23:39:40,757 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a14fc096-3fc2-4c54-b7bd-e0770d775c0e/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-43.i [2023-11-28 23:39:40,768 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a14fc096-3fc2-4c54-b7bd-e0770d775c0e/bin/uautomizer-verify-BQ2R08f2Ya/data/cb8fd41a2/61dd23c245d147c789c96553874cc352/FLAGc10aae917 [2023-11-28 23:39:40,784 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a14fc096-3fc2-4c54-b7bd-e0770d775c0e/bin/uautomizer-verify-BQ2R08f2Ya/data/cb8fd41a2/61dd23c245d147c789c96553874cc352 [2023-11-28 23:39:40,787 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-28 23:39:40,788 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-28 23:39:40,790 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-28 23:39:40,790 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-28 23:39:40,796 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-28 23:39:40,797 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:39:40" (1/1) ... [2023-11-28 23:39:40,798 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10d1a781 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:39:40, skipping insertion in model container [2023-11-28 23:39:40,798 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:39:40" (1/1) ... [2023-11-28 23:39:40,834 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 23:39:40,992 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_a14fc096-3fc2-4c54-b7bd-e0770d775c0e/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-43.i[917,930] [2023-11-28 23:39:41,057 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 23:39:41,075 INFO L202 MainTranslator]: Completed pre-run [2023-11-28 23:39:41,090 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_a14fc096-3fc2-4c54-b7bd-e0770d775c0e/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-43.i[917,930] [2023-11-28 23:39:41,126 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 23:39:41,146 INFO L206 MainTranslator]: Completed translation [2023-11-28 23:39:41,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:39:41 WrapperNode [2023-11-28 23:39:41,147 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-28 23:39:41,148 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-28 23:39:41,148 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-28 23:39:41,148 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-28 23:39:41,156 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:39:41" (1/1) ... [2023-11-28 23:39:41,171 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:39:41" (1/1) ... [2023-11-28 23:39:41,204 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 172 [2023-11-28 23:39:41,204 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-28 23:39:41,205 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-28 23:39:41,205 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-28 23:39:41,205 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-28 23:39:41,218 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:39:41" (1/1) ... [2023-11-28 23:39:41,218 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:39:41" (1/1) ... [2023-11-28 23:39:41,224 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:39:41" (1/1) ... [2023-11-28 23:39:41,239 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-28 23:39:41,240 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:39:41" (1/1) ... [2023-11-28 23:39:41,240 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:39:41" (1/1) ... [2023-11-28 23:39:41,256 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:39:41" (1/1) ... [2023-11-28 23:39:41,260 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:39:41" (1/1) ... [2023-11-28 23:39:41,264 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:39:41" (1/1) ... [2023-11-28 23:39:41,266 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:39:41" (1/1) ... [2023-11-28 23:39:41,271 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-28 23:39:41,273 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-28 23:39:41,273 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-28 23:39:41,273 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-28 23:39:41,274 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:39:41" (1/1) ... [2023-11-28 23:39:41,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 23:39:41,292 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a14fc096-3fc2-4c54-b7bd-e0770d775c0e/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:39:41,304 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a14fc096-3fc2-4c54-b7bd-e0770d775c0e/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-28 23:39:41,311 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a14fc096-3fc2-4c54-b7bd-e0770d775c0e/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-28 23:39:41,345 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-28 23:39:41,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-28 23:39:41,345 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-28 23:39:41,345 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-28 23:39:41,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-28 23:39:41,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-28 23:39:41,434 INFO L241 CfgBuilder]: Building ICFG [2023-11-28 23:39:41,437 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-28 23:39:56,570 INFO L282 CfgBuilder]: Performing block encoding [2023-11-28 23:39:56,619 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-28 23:39:56,620 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-28 23:39:56,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:39:56 BoogieIcfgContainer [2023-11-28 23:39:56,621 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-28 23:39:56,623 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-28 23:39:56,624 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-28 23:39:56,627 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-28 23:39:56,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 11:39:40" (1/3) ... [2023-11-28 23:39:56,628 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24f5341a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:39:56, skipping insertion in model container [2023-11-28 23:39:56,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:39:41" (2/3) ... [2023-11-28 23:39:56,629 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24f5341a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:39:56, skipping insertion in model container [2023-11-28 23:39:56,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:39:56" (3/3) ... [2023-11-28 23:39:56,630 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-43.i [2023-11-28 23:39:56,650 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-28 23:39:56,650 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-28 23:39:56,695 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-28 23:39:56,701 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=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@54489b94, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-28 23:39:56,701 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-28 23:39:56,705 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 39 states have (on average 1.358974358974359) internal successors, (53), 40 states have internal predecessors, (53), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2023-11-28 23:39:56,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2023-11-28 23:39:56,723 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:39:56,724 INFO L195 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-28 23:39:56,725 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 23:39:56,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:39:56,731 INFO L85 PathProgramCache]: Analyzing trace with hash -372544965, now seen corresponding path program 1 times [2023-11-28 23:39:56,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:39:56,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1079392632] [2023-11-28 23:39:56,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:39:56,747 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 [2023-11-28 23:39:56,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a14fc096-3fc2-4c54-b7bd-e0770d775c0e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:39:56,748 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a14fc096-3fc2-4c54-b7bd-e0770d775c0e/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-28 23:39:56,754 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a14fc096-3fc2-4c54-b7bd-e0770d775c0e/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-28 23:39:57,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:39:57,341 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-28 23:39:57,355 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:39:57,410 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 892 proven. 0 refuted. 0 times theorem prover too weak. 1220 trivial. 0 not checked. [2023-11-28 23:39:57,410 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:39:57,411 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:39:57,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1079392632] [2023-11-28 23:39:57,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1079392632] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:39:57,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:39:57,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:39:57,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677993356] [2023-11-28 23:39:57,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:39:57,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-28 23:39:57,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:39:57,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-28 23:39:57,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-28 23:39:57,452 INFO L87 Difference]: Start difference. First operand has 75 states, 39 states have (on average 1.358974358974359) internal successors, (53), 40 states have internal predecessors, (53), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2023-11-28 23:40:01,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 23:40:01,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:40:01,712 INFO L93 Difference]: Finished difference Result 147 states and 269 transitions. [2023-11-28 23:40:01,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-28 23:40:01,778 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 197 [2023-11-28 23:40:01,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:40:01,784 INFO L225 Difference]: With dead ends: 147 [2023-11-28 23:40:01,785 INFO L226 Difference]: Without dead ends: 73 [2023-11-28 23:40:01,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-28 23:40:01,791 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2023-11-28 23:40:01,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 111 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2023-11-28 23:40:01,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-11-28 23:40:01,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2023-11-28 23:40:01,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 38 states have (on average 1.263157894736842) internal successors, (48), 38 states have internal predecessors, (48), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2023-11-28 23:40:01,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 114 transitions. [2023-11-28 23:40:01,833 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 114 transitions. Word has length 197 [2023-11-28 23:40:01,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:40:01,834 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 114 transitions. [2023-11-28 23:40:01,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2023-11-28 23:40:01,834 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 114 transitions. [2023-11-28 23:40:01,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2023-11-28 23:40:01,838 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:40:01,838 INFO L195 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-28 23:40:01,849 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a14fc096-3fc2-4c54-b7bd-e0770d775c0e/bin/uautomizer-verify-BQ2R08f2Ya/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)] Forceful destruction successful, exit code 0 [2023-11-28 23:40:02,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a14fc096-3fc2-4c54-b7bd-e0770d775c0e/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-28 23:40:02,039 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 23:40:02,039 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:40:02,040 INFO L85 PathProgramCache]: Analyzing trace with hash 2123810169, now seen corresponding path program 1 times [2023-11-28 23:40:02,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:40:02,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1918523485] [2023-11-28 23:40:02,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:40:02,041 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 [2023-11-28 23:40:02,041 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a14fc096-3fc2-4c54-b7bd-e0770d775c0e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:40:02,043 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a14fc096-3fc2-4c54-b7bd-e0770d775c0e/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-28 23:40:02,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a14fc096-3fc2-4c54-b7bd-e0770d775c0e/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-28 23:40:02,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:40:02,618 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-28 23:40:02,634 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:40:31,572 WARN L293 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:40:45,480 WARN L293 SmtUtils]: Spent 5.89s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:40:51,923 WARN L854 $PredicateComparison]: unable to prove that (and (let ((.cse0 (fp.gt c_~var_1_5~0 c_~var_1_6~0))) (or (and (= c_~var_1_1~0 c_~var_1_6~0) (not .cse0)) (and .cse0 (= c_~var_1_5~0 c_~var_1_1~0)))) (not (fp.eq (fp.neg ((_ to_fp 8 24) c_currentRoundingMode (/ 2001.0 2.0))) (fp.mul c_currentRoundingMode c_~var_1_2~0 (fp.div c_currentRoundingMode c_~var_1_3~0 c_~var_1_4~0)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode .cse1)) (fp.geq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode .cse2))) (and (fp.geq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse1))) (fp.leq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse2)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2023-11-28 23:40:55,977 WARN L876 $PredicateComparison]: unable to prove that (and (let ((.cse0 (fp.gt c_~var_1_5~0 c_~var_1_6~0))) (or (and (= c_~var_1_1~0 c_~var_1_6~0) (not .cse0)) (and .cse0 (= c_~var_1_5~0 c_~var_1_1~0)))) (not (fp.eq (fp.neg ((_ to_fp 8 24) c_currentRoundingMode (/ 2001.0 2.0))) (fp.mul c_currentRoundingMode c_~var_1_2~0 (fp.div c_currentRoundingMode c_~var_1_3~0 c_~var_1_4~0)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode .cse1)) (fp.geq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode .cse2))) (and (fp.geq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse1))) (fp.leq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse2)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2023-11-28 23:41:15,908 WARN L293 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:41:43,748 WARN L876 $PredicateComparison]: unable to prove that (and (let ((.cse0 (fp.gt c_~var_1_5~0 c_~var_1_6~0))) (or (and (= c_~var_1_1~0 c_~var_1_6~0) (not .cse0)) (and .cse0 (= c_~var_1_5~0 c_~var_1_1~0)))) (= c_~var_1_7~0 c_~var_1_10~0) (not (fp.eq (fp.neg ((_ to_fp 8 24) c_currentRoundingMode (/ 2001.0 2.0))) (fp.mul c_currentRoundingMode c_~var_1_2~0 (fp.div c_currentRoundingMode c_~var_1_3~0 c_~var_1_4~0)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode .cse1)) (fp.geq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode .cse2))) (and (fp.geq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse1))) (fp.leq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse2)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2023-11-28 23:41:59,566 WARN L293 SmtUtils]: Spent 5.10s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:42:06,521 WARN L293 SmtUtils]: Spent 6.95s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:42:14,724 WARN L293 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:42:22,644 WARN L293 SmtUtils]: Spent 7.92s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:42:40,416 WARN L293 SmtUtils]: Spent 6.13s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:42:52,252 WARN L293 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:43:00,163 WARN L876 $PredicateComparison]: unable to prove that (and (let ((.cse0 (fp.gt c_~var_1_5~0 c_~var_1_6~0))) (or (and (= c_~var_1_1~0 c_~var_1_6~0) (not .cse0)) (and .cse0 (= c_~var_1_5~0 c_~var_1_1~0)))) (fp.gt c_~var_1_1~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_4~0)) (= c_~var_1_7~0 c_~var_1_10~0) (not (fp.eq (fp.neg ((_ to_fp 8 24) c_currentRoundingMode (/ 2001.0 2.0))) (fp.mul c_currentRoundingMode c_~var_1_2~0 (fp.div c_currentRoundingMode c_~var_1_3~0 c_~var_1_4~0)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode .cse1)) (fp.geq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode .cse2))) (and (fp.geq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse1))) (fp.leq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse2)))))) (= ((_ sign_extend 8) c_~var_1_10~0) c_~var_1_11~0) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2023-11-28 23:43:06,548 WARN L293 SmtUtils]: Spent 6.36s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:43:17,374 WARN L293 SmtUtils]: Spent 6.91s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:43:24,250 WARN L293 SmtUtils]: Spent 6.87s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:43:32,190 WARN L293 SmtUtils]: Spent 7.94s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:43:39,288 WARN L293 SmtUtils]: Spent 7.10s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:43:49,847 WARN L293 SmtUtils]: Spent 6.23s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:43:55,475 WARN L293 SmtUtils]: Spent 5.63s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:44:03,506 WARN L293 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:44:14,579 WARN L293 SmtUtils]: Spent 6.19s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:44:20,987 WARN L293 SmtUtils]: Spent 6.41s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:44:26,452 WARN L876 $PredicateComparison]: unable to prove that (and (= ((_ extract 15 0) (bvadd (bvneg ((_ zero_extend 16) c_~var_1_15~0)) ((_ zero_extend 16) c_~var_1_14~0))) c_~var_1_12~0) (let ((.cse0 (fp.gt c_~var_1_5~0 c_~var_1_6~0))) (or (and (= c_~var_1_1~0 c_~var_1_6~0) (not .cse0)) (and .cse0 (= c_~var_1_5~0 c_~var_1_1~0)))) (fp.gt c_~var_1_1~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_4~0)) (= c_~var_1_7~0 c_~var_1_10~0) (not (fp.eq (fp.neg ((_ to_fp 8 24) c_currentRoundingMode (/ 2001.0 2.0))) (fp.mul c_currentRoundingMode c_~var_1_2~0 (fp.div c_currentRoundingMode c_~var_1_3~0 c_~var_1_4~0)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode .cse1)) (fp.geq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode .cse2))) (and (fp.geq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse1))) (fp.leq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse2)))))) (= ((_ sign_extend 8) c_~var_1_10~0) c_~var_1_11~0) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2023-11-28 23:44:36,962 WARN L293 SmtUtils]: Spent 7.02s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:44:47,404 WARN L293 SmtUtils]: Spent 6.26s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:44:53,359 WARN L293 SmtUtils]: Spent 5.95s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:45:11,175 WARN L293 SmtUtils]: Spent 5.55s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:45:17,252 WARN L293 SmtUtils]: Spent 6.08s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:45:24,439 WARN L293 SmtUtils]: Spent 7.19s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:45:35,000 WARN L293 SmtUtils]: Spent 7.42s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:45:43,403 WARN L293 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:45:51,704 WARN L293 SmtUtils]: Spent 8.30s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:46:00,016 WARN L293 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:46:08,336 WARN L293 SmtUtils]: Spent 8.32s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:46:16,552 WARN L293 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:46:24,862 WARN L293 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:46:33,174 WARN L293 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:46:40,392 WARN L293 SmtUtils]: Spent 7.22s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:46:48,702 WARN L293 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:46:57,026 WARN L293 SmtUtils]: Spent 8.32s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:47:05,246 WARN L293 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:47:13,550 WARN L293 SmtUtils]: Spent 8.30s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:47:21,867 WARN L293 SmtUtils]: Spent 8.32s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:47:30,227 WARN L293 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:47:38,536 WARN L293 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:47:46,857 WARN L293 SmtUtils]: Spent 8.32s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:47:55,164 WARN L293 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:48:03,481 WARN L293 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:48:11,806 WARN L293 SmtUtils]: Spent 8.32s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:48:20,129 WARN L293 SmtUtils]: Spent 8.32s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:48:28,495 WARN L293 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:48:36,870 WARN L293 SmtUtils]: Spent 8.37s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:48:45,215 WARN L293 SmtUtils]: Spent 8.34s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:48:53,638 WARN L293 SmtUtils]: Spent 8.42s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:49:02,021 WARN L293 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:49:10,408 WARN L293 SmtUtils]: Spent 8.39s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:49:18,785 WARN L293 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:49:27,204 WARN L293 SmtUtils]: Spent 8.42s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:49:31,292 WARN L854 $PredicateComparison]: unable to prove that (and (= ((_ extract 15 0) (bvadd (bvneg ((_ zero_extend 16) c_~var_1_15~0)) ((_ zero_extend 16) c_~var_1_14~0))) c_~var_1_12~0) (let ((.cse0 (fp.gt c_~var_1_5~0 c_~var_1_6~0))) (or (and (= c_~var_1_1~0 c_~var_1_6~0) (not .cse0)) (and .cse0 (= c_~var_1_5~0 c_~var_1_1~0)))) (let ((.cse2 (fp.lt c_~var_1_3~0 c_~var_1_17~0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_2~0))) (or (and (fp.leq .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_17~0) c_~var_1_1~0)) (not .cse2)) (and .cse2 (fp.leq .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_3~0) c_~var_1_1~0))))) (fp.gt c_~var_1_1~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_4~0)) (= c_~var_1_7~0 c_~var_1_10~0) (not (fp.eq (fp.neg ((_ to_fp 8 24) c_currentRoundingMode (/ 2001.0 2.0))) (fp.mul c_currentRoundingMode c_~var_1_2~0 (fp.div c_currentRoundingMode c_~var_1_3~0 c_~var_1_4~0)))) (let ((.cse12 ((_ sign_extend 24) c_~var_1_18~0)) (.cse8 ((_ sign_extend 24) c_~var_1_19~0)) (.cse7 ((_ sign_extend 24) c_~var_1_10~0))) (let ((.cse6 (= c_~var_1_16~0 ((_ extract 7 0) .cse7))) (.cse9 ((_ sign_extend 24) c_~var_1_20~0)) (.cse3 (bvslt .cse12 .cse8))) (or (and (not .cse3) (let ((.cse4 (bvadd .cse8 .cse9))) (let ((.cse5 (bvslt .cse7 .cse4))) (or (and (= c_~var_1_16~0 ((_ extract 7 0) .cse4)) (not .cse5)) (and .cse6 .cse5))))) (and (let ((.cse11 (bvadd .cse12 .cse9))) (let ((.cse10 (bvslt .cse7 .cse11))) (or (and (not .cse10) (= ((_ extract 7 0) .cse11) c_~var_1_16~0)) (and .cse6 .cse10)))) .cse3)))) (let ((.cse13 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (.cse14 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode .cse13)) (fp.geq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode .cse14))) (and (fp.geq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse13))) (fp.leq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse14)))))) (= ((_ sign_extend 8) c_~var_1_10~0) c_~var_1_11~0) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2023-11-28 23:49:35,385 WARN L876 $PredicateComparison]: unable to prove that (and (= ((_ extract 15 0) (bvadd (bvneg ((_ zero_extend 16) c_~var_1_15~0)) ((_ zero_extend 16) c_~var_1_14~0))) c_~var_1_12~0) (let ((.cse0 (fp.gt c_~var_1_5~0 c_~var_1_6~0))) (or (and (= c_~var_1_1~0 c_~var_1_6~0) (not .cse0)) (and .cse0 (= c_~var_1_5~0 c_~var_1_1~0)))) (let ((.cse2 (fp.lt c_~var_1_3~0 c_~var_1_17~0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_2~0))) (or (and (fp.leq .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_17~0) c_~var_1_1~0)) (not .cse2)) (and .cse2 (fp.leq .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_3~0) c_~var_1_1~0))))) (fp.gt c_~var_1_1~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_4~0)) (= c_~var_1_7~0 c_~var_1_10~0) (not (fp.eq (fp.neg ((_ to_fp 8 24) c_currentRoundingMode (/ 2001.0 2.0))) (fp.mul c_currentRoundingMode c_~var_1_2~0 (fp.div c_currentRoundingMode c_~var_1_3~0 c_~var_1_4~0)))) (let ((.cse12 ((_ sign_extend 24) c_~var_1_18~0)) (.cse8 ((_ sign_extend 24) c_~var_1_19~0)) (.cse7 ((_ sign_extend 24) c_~var_1_10~0))) (let ((.cse6 (= c_~var_1_16~0 ((_ extract 7 0) .cse7))) (.cse9 ((_ sign_extend 24) c_~var_1_20~0)) (.cse3 (bvslt .cse12 .cse8))) (or (and (not .cse3) (let ((.cse4 (bvadd .cse8 .cse9))) (let ((.cse5 (bvslt .cse7 .cse4))) (or (and (= c_~var_1_16~0 ((_ extract 7 0) .cse4)) (not .cse5)) (and .cse6 .cse5))))) (and (let ((.cse11 (bvadd .cse12 .cse9))) (let ((.cse10 (bvslt .cse7 .cse11))) (or (and (not .cse10) (= ((_ extract 7 0) .cse11) c_~var_1_16~0)) (and .cse6 .cse10)))) .cse3)))) (let ((.cse13 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (.cse14 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode .cse13)) (fp.geq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode .cse14))) (and (fp.geq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse13))) (fp.leq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse14)))))) (= ((_ sign_extend 8) c_~var_1_10~0) c_~var_1_11~0) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2023-11-28 23:49:43,787 WARN L293 SmtUtils]: Spent 8.34s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:49:52,130 WARN L293 SmtUtils]: Spent 8.34s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:50:00,485 WARN L293 SmtUtils]: Spent 8.35s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:50:08,839 WARN L293 SmtUtils]: Spent 8.35s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:50:17,086 WARN L293 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:50:25,433 WARN L293 SmtUtils]: Spent 8.35s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:50:33,765 WARN L293 SmtUtils]: Spent 8.33s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:50:42,023 WARN L293 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:50:50,356 WARN L293 SmtUtils]: Spent 8.33s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:50:58,697 WARN L293 SmtUtils]: Spent 8.34s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:51:06,954 WARN L293 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:51:15,327 WARN L293 SmtUtils]: Spent 8.37s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:51:23,685 WARN L293 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:51:32,037 WARN L293 SmtUtils]: Spent 8.35s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:51:40,402 WARN L293 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:51:48,773 WARN L293 SmtUtils]: Spent 8.37s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:51:57,119 WARN L293 SmtUtils]: Spent 8.35s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:52:05,484 WARN L293 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:52:13,845 WARN L293 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:52:22,185 WARN L293 SmtUtils]: Spent 8.34s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:52:30,533 WARN L293 SmtUtils]: Spent 8.35s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:52:38,872 WARN L293 SmtUtils]: Spent 8.34s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:52:47,221 WARN L293 SmtUtils]: Spent 8.35s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:52:55,581 WARN L293 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:53:03,926 WARN L293 SmtUtils]: Spent 8.34s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:53:12,429 WARN L293 SmtUtils]: Spent 8.50s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:53:20,761 WARN L293 SmtUtils]: Spent 8.33s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:53:29,086 WARN L293 SmtUtils]: Spent 8.32s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:53:37,433 WARN L293 SmtUtils]: Spent 8.35s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:53:45,817 WARN L293 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:53:49,902 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ zero_extend 16) c_~var_1_14~0)) (.cse2 ((_ zero_extend 16) c_~var_1_24~0)) (.cse3 ((_ sign_extend 24) c_~var_1_10~0))) (and (= ((_ extract 15 0) (bvadd (bvneg ((_ zero_extend 16) c_~var_1_15~0)) .cse0)) c_~var_1_12~0) (let ((.cse1 (fp.gt c_~var_1_5~0 c_~var_1_6~0))) (or (and (= c_~var_1_1~0 c_~var_1_6~0) (not .cse1)) (and .cse1 (= c_~var_1_5~0 c_~var_1_1~0)))) (bvslt (bvneg (bvadd (bvneg .cse2) .cse0)) .cse3) (= c_~var_1_23~0 (bvadd .cse2 (_ bv4 32) ((_ sign_extend 24) c_~var_1_22~0))) (let ((.cse5 (fp.lt c_~var_1_3~0 c_~var_1_17~0)) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_2~0))) (or (and (fp.leq .cse4 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_17~0) c_~var_1_1~0)) (not .cse5)) (and .cse5 (fp.leq .cse4 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_3~0) c_~var_1_1~0))))) (fp.gt c_~var_1_1~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_4~0)) (= c_~var_1_7~0 c_~var_1_10~0) (not (fp.eq (fp.neg ((_ to_fp 8 24) c_currentRoundingMode (/ 2001.0 2.0))) (fp.mul c_currentRoundingMode c_~var_1_2~0 (fp.div c_currentRoundingMode c_~var_1_3~0 c_~var_1_4~0)))) (let ((.cse14 ((_ sign_extend 24) c_~var_1_18~0)) (.cse10 ((_ sign_extend 24) c_~var_1_19~0))) (let ((.cse9 (= c_~var_1_16~0 ((_ extract 7 0) .cse3))) (.cse11 ((_ sign_extend 24) c_~var_1_20~0)) (.cse6 (bvslt .cse14 .cse10))) (or (and (not .cse6) (let ((.cse7 (bvadd .cse10 .cse11))) (let ((.cse8 (bvslt .cse3 .cse7))) (or (and (= c_~var_1_16~0 ((_ extract 7 0) .cse7)) (not .cse8)) (and .cse9 .cse8))))) (and (let ((.cse13 (bvadd .cse14 .cse11))) (let ((.cse12 (bvslt .cse3 .cse13))) (or (and (not .cse12) (= ((_ extract 7 0) .cse13) c_~var_1_16~0)) (and .cse9 .cse12)))) .cse6)))) (let ((.cse15 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (.cse16 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode .cse15)) (fp.geq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode .cse16))) (and (fp.geq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse15))) (fp.leq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse16)))))) (= ((_ sign_extend 8) c_~var_1_10~0) c_~var_1_11~0) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2023-11-28 23:53:53,988 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ zero_extend 16) c_~var_1_14~0)) (.cse2 ((_ zero_extend 16) c_~var_1_24~0)) (.cse3 ((_ sign_extend 24) c_~var_1_10~0))) (and (= ((_ extract 15 0) (bvadd (bvneg ((_ zero_extend 16) c_~var_1_15~0)) .cse0)) c_~var_1_12~0) (let ((.cse1 (fp.gt c_~var_1_5~0 c_~var_1_6~0))) (or (and (= c_~var_1_1~0 c_~var_1_6~0) (not .cse1)) (and .cse1 (= c_~var_1_5~0 c_~var_1_1~0)))) (bvslt (bvneg (bvadd (bvneg .cse2) .cse0)) .cse3) (= c_~var_1_23~0 (bvadd .cse2 (_ bv4 32) ((_ sign_extend 24) c_~var_1_22~0))) (let ((.cse5 (fp.lt c_~var_1_3~0 c_~var_1_17~0)) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_2~0))) (or (and (fp.leq .cse4 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_17~0) c_~var_1_1~0)) (not .cse5)) (and .cse5 (fp.leq .cse4 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_3~0) c_~var_1_1~0))))) (fp.gt c_~var_1_1~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_4~0)) (= c_~var_1_7~0 c_~var_1_10~0) (not (fp.eq (fp.neg ((_ to_fp 8 24) c_currentRoundingMode (/ 2001.0 2.0))) (fp.mul c_currentRoundingMode c_~var_1_2~0 (fp.div c_currentRoundingMode c_~var_1_3~0 c_~var_1_4~0)))) (let ((.cse14 ((_ sign_extend 24) c_~var_1_18~0)) (.cse10 ((_ sign_extend 24) c_~var_1_19~0))) (let ((.cse9 (= c_~var_1_16~0 ((_ extract 7 0) .cse3))) (.cse11 ((_ sign_extend 24) c_~var_1_20~0)) (.cse6 (bvslt .cse14 .cse10))) (or (and (not .cse6) (let ((.cse7 (bvadd .cse10 .cse11))) (let ((.cse8 (bvslt .cse3 .cse7))) (or (and (= c_~var_1_16~0 ((_ extract 7 0) .cse7)) (not .cse8)) (and .cse9 .cse8))))) (and (let ((.cse13 (bvadd .cse14 .cse11))) (let ((.cse12 (bvslt .cse3 .cse13))) (or (and (not .cse12) (= ((_ extract 7 0) .cse13) c_~var_1_16~0)) (and .cse9 .cse12)))) .cse6)))) (let ((.cse15 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (.cse16 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode .cse15)) (fp.geq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode .cse16))) (and (fp.geq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse15))) (fp.leq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse16)))))) (= ((_ sign_extend 8) c_~var_1_10~0) c_~var_1_11~0) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2023-11-28 23:54:02,391 WARN L293 SmtUtils]: Spent 8.33s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:54:10,716 WARN L293 SmtUtils]: Spent 8.32s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:54:19,041 WARN L293 SmtUtils]: Spent 8.32s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:54:27,369 WARN L293 SmtUtils]: Spent 8.33s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:54:35,596 WARN L293 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 23:54:43,926 WARN L293 SmtUtils]: Spent 8.33s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)