./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-30.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab53572a-1c36-4252-86b9-53232bffb805/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab53572a-1c36-4252-86b9-53232bffb805/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab53572a-1c36-4252-86b9-53232bffb805/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab53572a-1c36-4252-86b9-53232bffb805/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-30.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab53572a-1c36-4252-86b9-53232bffb805/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab53572a-1c36-4252-86b9-53232bffb805/bin/uautomizer-verify-VRDe98Ueme --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 88c823ba6d01c08a1ca0aef14f9fe845aa3afb85e89e5682ca1c816caf454f50 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 12:03:09,181 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 12:03:09,257 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab53572a-1c36-4252-86b9-53232bffb805/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-26 12:03:09,261 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 12:03:09,262 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 12:03:09,291 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 12:03:09,292 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 12:03:09,292 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 12:03:09,293 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 12:03:09,294 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 12:03:09,294 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 12:03:09,295 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 12:03:09,296 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 12:03:09,297 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 12:03:09,297 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 12:03:09,298 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 12:03:09,298 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 12:03:09,299 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 12:03:09,300 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 12:03:09,300 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 12:03:09,301 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 12:03:09,302 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 12:03:09,302 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 12:03:09,303 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 12:03:09,304 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 12:03:09,304 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 12:03:09,305 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 12:03:09,305 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 12:03:09,306 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 12:03:09,307 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 12:03:09,307 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 12:03:09,308 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 12:03:09,308 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 12:03:09,309 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 12:03:09,309 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 12:03:09,310 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 12:03:09,310 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 12:03:09,311 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 12:03:09,311 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 12:03:09,312 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 12:03:09,312 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 12:03:09,317 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 12:03:09,317 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_ab53572a-1c36-4252-86b9-53232bffb805/bin/uautomizer-verify-VRDe98Ueme/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_ab53572a-1c36-4252-86b9-53232bffb805/bin/uautomizer-verify-VRDe98Ueme 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 -> 88c823ba6d01c08a1ca0aef14f9fe845aa3afb85e89e5682ca1c816caf454f50 [2023-11-26 12:03:09,625 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 12:03:09,661 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 12:03:09,663 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 12:03:09,665 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 12:03:09,665 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 12:03:09,666 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab53572a-1c36-4252-86b9-53232bffb805/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-30.i [2023-11-26 12:03:12,876 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 12:03:13,153 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 12:03:13,154 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab53572a-1c36-4252-86b9-53232bffb805/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-30.i [2023-11-26 12:03:13,164 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab53572a-1c36-4252-86b9-53232bffb805/bin/uautomizer-verify-VRDe98Ueme/data/a57a32f21/09a56abc9a99429582266469b98c5aba/FLAG11da4424c [2023-11-26 12:03:13,185 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab53572a-1c36-4252-86b9-53232bffb805/bin/uautomizer-verify-VRDe98Ueme/data/a57a32f21/09a56abc9a99429582266469b98c5aba [2023-11-26 12:03:13,188 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 12:03:13,189 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 12:03:13,191 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 12:03:13,192 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 12:03:13,198 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 12:03:13,199 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:03:13" (1/1) ... [2023-11-26 12:03:13,200 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@407d68c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:03:13, skipping insertion in model container [2023-11-26 12:03:13,200 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:03:13" (1/1) ... [2023-11-26 12:03:13,254 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 12:03:13,433 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_ab53572a-1c36-4252-86b9-53232bffb805/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-30.i[915,928] [2023-11-26 12:03:13,503 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 12:03:13,520 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 12:03:13,535 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_ab53572a-1c36-4252-86b9-53232bffb805/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-30.i[915,928] [2023-11-26 12:03:13,582 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 12:03:13,601 INFO L206 MainTranslator]: Completed translation [2023-11-26 12:03:13,602 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:03:13 WrapperNode [2023-11-26 12:03:13,602 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 12:03:13,603 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 12:03:13,603 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 12:03:13,604 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 12:03:13,612 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:03:13" (1/1) ... [2023-11-26 12:03:13,623 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:03:13" (1/1) ... [2023-11-26 12:03:13,677 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 187 [2023-11-26 12:03:13,677 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 12:03:13,678 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 12:03:13,678 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 12:03:13,678 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 12:03:13,690 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:03:13" (1/1) ... [2023-11-26 12:03:13,691 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:03:13" (1/1) ... [2023-11-26 12:03:13,694 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:03:13" (1/1) ... [2023-11-26 12:03:13,723 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-26 12:03:13,723 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:03:13" (1/1) ... [2023-11-26 12:03:13,724 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:03:13" (1/1) ... [2023-11-26 12:03:13,733 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:03:13" (1/1) ... [2023-11-26 12:03:13,745 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:03:13" (1/1) ... [2023-11-26 12:03:13,748 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:03:13" (1/1) ... [2023-11-26 12:03:13,750 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:03:13" (1/1) ... [2023-11-26 12:03:13,753 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 12:03:13,754 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 12:03:13,754 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 12:03:13,755 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 12:03:13,756 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:03:13" (1/1) ... [2023-11-26 12:03:13,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 12:03:13,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab53572a-1c36-4252-86b9-53232bffb805/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:03:13,795 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab53572a-1c36-4252-86b9-53232bffb805/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 12:03:13,831 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab53572a-1c36-4252-86b9-53232bffb805/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 12:03:13,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 12:03:13,844 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-26 12:03:13,845 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-26 12:03:13,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 12:03:13,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 12:03:13,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 12:03:13,985 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 12:03:13,988 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 12:03:14,409 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 12:03:14,453 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 12:03:14,454 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-26 12:03:14,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:03:14 BoogieIcfgContainer [2023-11-26 12:03:14,454 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 12:03:14,457 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 12:03:14,457 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 12:03:14,461 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 12:03:14,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:03:13" (1/3) ... [2023-11-26 12:03:14,462 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11e9b5df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:03:14, skipping insertion in model container [2023-11-26 12:03:14,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:03:13" (2/3) ... [2023-11-26 12:03:14,463 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11e9b5df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:03:14, skipping insertion in model container [2023-11-26 12:03:14,463 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:03:14" (3/3) ... [2023-11-26 12:03:14,464 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-30.i [2023-11-26 12:03:14,484 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 12:03:14,484 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-26 12:03:14,531 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 12:03:14,537 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;@7fd9f9e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 12:03:14,537 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-26 12:03:14,541 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 47 states have (on average 1.5106382978723405) internal successors, (71), 48 states have internal predecessors, (71), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-26 12:03:14,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-26 12:03:14,555 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:03:14,556 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 12:03:14,557 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:03:14,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:03:14,562 INFO L85 PathProgramCache]: Analyzing trace with hash -466255086, now seen corresponding path program 1 times [2023-11-26 12:03:14,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:03:14,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199557835] [2023-11-26 12:03:14,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:03:14,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:03:14,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:14,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 12:03:14,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:14,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-26 12:03:14,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:14,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 12:03:14,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:14,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-26 12:03:14,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:14,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-26 12:03:14,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:14,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-26 12:03:14,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:14,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-26 12:03:14,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:14,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-26 12:03:14,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:14,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-26 12:03:14,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:14,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-26 12:03:14,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:14,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-26 12:03:14,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:14,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-26 12:03:14,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:14,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-26 12:03:14,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:14,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-26 12:03:14,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:14,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-26 12:03:14,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:14,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-26 12:03:14,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:14,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-26 12:03:14,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:14,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-26 12:03:14,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:14,987 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-26 12:03:14,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:03:14,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199557835] [2023-11-26 12:03:14,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199557835] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:03:14,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:03:14,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:03:14,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343395305] [2023-11-26 12:03:14,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:03:15,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-26 12:03:15,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:03:15,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-26 12:03:15,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 12:03:15,043 INFO L87 Difference]: Start difference. First operand has 68 states, 47 states have (on average 1.5106382978723405) internal successors, (71), 48 states have internal predecessors, (71), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-26 12:03:15,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:03:15,086 INFO L93 Difference]: Finished difference Result 133 states and 230 transitions. [2023-11-26 12:03:15,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-26 12:03:15,089 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 122 [2023-11-26 12:03:15,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:03:15,098 INFO L225 Difference]: With dead ends: 133 [2023-11-26 12:03:15,098 INFO L226 Difference]: Without dead ends: 66 [2023-11-26 12:03:15,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 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-26 12:03:15,106 INFO L413 NwaCegarLoop]: 99 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, 99 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-26 12:03:15,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 12:03:15,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-11-26 12:03:15,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2023-11-26 12:03:15,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 46 states have (on average 1.434782608695652) internal successors, (66), 46 states have internal predecessors, (66), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-26 12:03:15,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 102 transitions. [2023-11-26 12:03:15,189 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 102 transitions. Word has length 122 [2023-11-26 12:03:15,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:03:15,189 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 102 transitions. [2023-11-26 12:03:15,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-26 12:03:15,190 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 102 transitions. [2023-11-26 12:03:15,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-26 12:03:15,193 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:03:15,193 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 12:03:15,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 12:03:15,194 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:03:15,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:03:15,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1713747102, now seen corresponding path program 1 times [2023-11-26 12:03:15,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:03:15,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767285088] [2023-11-26 12:03:15,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:03:15,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:03:15,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:15,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 12:03:15,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:15,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-26 12:03:15,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:15,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 12:03:15,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:15,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-26 12:03:15,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:15,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-26 12:03:15,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:15,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-26 12:03:15,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:15,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-26 12:03:15,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:15,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-26 12:03:15,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:15,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-26 12:03:15,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:15,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-26 12:03:15,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:15,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-26 12:03:15,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:15,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-26 12:03:15,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:15,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-26 12:03:15,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:15,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-26 12:03:15,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:15,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-26 12:03:15,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:15,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-26 12:03:15,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:15,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-26 12:03:15,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:15,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-26 12:03:15,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:15,930 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-26 12:03:15,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:03:15,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767285088] [2023-11-26 12:03:15,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767285088] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:03:15,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:03:15,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 12:03:15,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459452644] [2023-11-26 12:03:15,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:03:15,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 12:03:15,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:03:15,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 12:03:15,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 12:03:15,935 INFO L87 Difference]: Start difference. First operand 66 states and 102 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-26 12:03:16,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:03:16,159 INFO L93 Difference]: Finished difference Result 220 states and 343 transitions. [2023-11-26 12:03:16,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 12:03:16,160 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 122 [2023-11-26 12:03:16,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:03:16,164 INFO L225 Difference]: With dead ends: 220 [2023-11-26 12:03:16,164 INFO L226 Difference]: Without dead ends: 155 [2023-11-26 12:03:16,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-26 12:03:16,167 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 109 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-26 12:03:16,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 316 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-26 12:03:16,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2023-11-26 12:03:16,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 129. [2023-11-26 12:03:16,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 90 states have (on average 1.4111111111111112) internal successors, (127), 90 states have internal predecessors, (127), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-26 12:03:16,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 199 transitions. [2023-11-26 12:03:16,222 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 199 transitions. Word has length 122 [2023-11-26 12:03:16,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:03:16,225 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 199 transitions. [2023-11-26 12:03:16,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-26 12:03:16,225 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 199 transitions. [2023-11-26 12:03:16,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-11-26 12:03:16,234 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:03:16,234 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 12:03:16,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 12:03:16,235 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:03:16,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:03:16,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1709475534, now seen corresponding path program 1 times [2023-11-26 12:03:16,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:03:16,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564401026] [2023-11-26 12:03:16,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:03:16,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:03:16,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:17,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 12:03:17,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:17,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-26 12:03:17,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:17,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 12:03:17,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:17,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-26 12:03:17,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:17,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-26 12:03:17,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:17,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-26 12:03:17,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:17,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-26 12:03:17,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:17,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-26 12:03:17,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:17,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-26 12:03:17,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:17,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-26 12:03:17,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:17,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-26 12:03:17,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:17,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-26 12:03:17,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:17,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-26 12:03:17,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:17,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-26 12:03:17,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:17,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-26 12:03:17,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:17,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-26 12:03:17,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:17,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-26 12:03:17,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:17,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-26 12:03:17,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:17,382 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-11-26 12:03:17,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:03:17,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564401026] [2023-11-26 12:03:17,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564401026] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 12:03:17,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491746462] [2023-11-26 12:03:17,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:03:17,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 12:03:17,386 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab53572a-1c36-4252-86b9-53232bffb805/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:03:17,391 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab53572a-1c36-4252-86b9-53232bffb805/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 12:03:17,405 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab53572a-1c36-4252-86b9-53232bffb805/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-26 12:03:17,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:17,570 INFO L262 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-26 12:03:17,580 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 12:03:17,904 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 17 proven. 51 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-26 12:03:17,904 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 12:03:18,183 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-11-26 12:03:18,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1491746462] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 12:03:18,184 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 12:03:18,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2023-11-26 12:03:18,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740042545] [2023-11-26 12:03:18,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 12:03:18,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-26 12:03:18,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:03:18,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-26 12:03:18,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-11-26 12:03:18,188 INFO L87 Difference]: Start difference. First operand 129 states and 199 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 1 states have call predecessors, (36), 2 states have call successors, (36) [2023-11-26 12:03:18,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:03:18,747 INFO L93 Difference]: Finished difference Result 215 states and 317 transitions. [2023-11-26 12:03:18,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-26 12:03:18,748 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 1 states have call predecessors, (36), 2 states have call successors, (36) Word has length 123 [2023-11-26 12:03:18,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:03:18,750 INFO L225 Difference]: With dead ends: 215 [2023-11-26 12:03:18,750 INFO L226 Difference]: Without dead ends: 150 [2023-11-26 12:03:18,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 278 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2023-11-26 12:03:18,753 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 191 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-26 12:03:18,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 188 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-26 12:03:18,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-11-26 12:03:18,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 145. [2023-11-26 12:03:18,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 102 states have (on average 1.3431372549019607) internal successors, (137), 102 states have internal predecessors, (137), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-26 12:03:18,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 209 transitions. [2023-11-26 12:03:18,810 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 209 transitions. Word has length 123 [2023-11-26 12:03:18,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:03:18,811 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 209 transitions. [2023-11-26 12:03:18,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 1 states have call predecessors, (36), 2 states have call successors, (36) [2023-11-26 12:03:18,811 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 209 transitions. [2023-11-26 12:03:18,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-26 12:03:18,813 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:03:18,814 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 12:03:18,831 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab53572a-1c36-4252-86b9-53232bffb805/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-26 12:03:19,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab53572a-1c36-4252-86b9-53232bffb805/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 12:03:19,025 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:03:19,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:03:19,026 INFO L85 PathProgramCache]: Analyzing trace with hash -610587940, now seen corresponding path program 1 times [2023-11-26 12:03:19,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:03:19,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189112819] [2023-11-26 12:03:19,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:03:19,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:03:19,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:19,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 12:03:19,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:19,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-26 12:03:19,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:19,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 12:03:19,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:19,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-26 12:03:19,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:19,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-26 12:03:19,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:19,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-26 12:03:19,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:19,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-26 12:03:19,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:19,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-26 12:03:19,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:19,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-26 12:03:19,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:19,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-26 12:03:19,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:19,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-26 12:03:19,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:19,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-26 12:03:19,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:19,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-26 12:03:19,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:19,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-26 12:03:19,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:19,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-26 12:03:19,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:19,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-26 12:03:19,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:19,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-26 12:03:19,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:19,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-26 12:03:19,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:19,216 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-26 12:03:19,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:03:19,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189112819] [2023-11-26 12:03:19,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189112819] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:03:19,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:03:19,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 12:03:19,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809965564] [2023-11-26 12:03:19,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:03:19,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:03:19,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:03:19,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:03:19,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:03:19,223 INFO L87 Difference]: Start difference. First operand 145 states and 209 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-26 12:03:19,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:03:19,319 INFO L93 Difference]: Finished difference Result 289 states and 417 transitions. [2023-11-26 12:03:19,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:03:19,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 124 [2023-11-26 12:03:19,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:03:19,325 INFO L225 Difference]: With dead ends: 289 [2023-11-26 12:03:19,325 INFO L226 Difference]: Without dead ends: 145 [2023-11-26 12:03:19,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 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-26 12:03:19,336 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 20 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 12:03:19,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 151 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 12:03:19,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-11-26 12:03:19,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2023-11-26 12:03:19,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 102 states have (on average 1.3235294117647058) internal successors, (135), 102 states have internal predecessors, (135), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-26 12:03:19,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 207 transitions. [2023-11-26 12:03:19,408 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 207 transitions. Word has length 124 [2023-11-26 12:03:19,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:03:19,409 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 207 transitions. [2023-11-26 12:03:19,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-26 12:03:19,409 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 207 transitions. [2023-11-26 12:03:19,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-11-26 12:03:19,411 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:03:19,411 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 12:03:19,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 12:03:19,411 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:03:19,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:03:19,412 INFO L85 PathProgramCache]: Analyzing trace with hash 264507623, now seen corresponding path program 1 times [2023-11-26 12:03:19,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:03:19,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747844864] [2023-11-26 12:03:19,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:03:19,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:03:19,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:03:19,502 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 12:03:19,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:03:19,603 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 12:03:19,604 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 12:03:19,605 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-26 12:03:19,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 12:03:19,611 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-11-26 12:03:19,615 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-26 12:03:19,735 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-26 12:03:19,745 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short19 could not be translated [2023-11-26 12:03:19,774 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 12:03:19 BoogieIcfgContainer [2023-11-26 12:03:19,775 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-26 12:03:19,775 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 12:03:19,775 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 12:03:19,776 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 12:03:19,776 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:03:14" (3/4) ... [2023-11-26 12:03:19,778 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-26 12:03:19,779 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 12:03:19,780 INFO L158 Benchmark]: Toolchain (without parser) took 6590.89ms. Allocated memory was 176.2MB in the beginning and 224.4MB in the end (delta: 48.2MB). Free memory was 129.6MB in the beginning and 103.2MB in the end (delta: 26.4MB). Peak memory consumption was 77.5MB. Max. memory is 16.1GB. [2023-11-26 12:03:19,780 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 117.4MB. Free memory is still 67.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 12:03:19,781 INFO L158 Benchmark]: CACSL2BoogieTranslator took 410.94ms. Allocated memory is still 176.2MB. Free memory was 129.6MB in the beginning and 115.5MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-26 12:03:19,781 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.29ms. Allocated memory is still 176.2MB. Free memory was 115.5MB in the beginning and 113.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 12:03:19,781 INFO L158 Benchmark]: Boogie Preprocessor took 75.42ms. Allocated memory is still 176.2MB. Free memory was 112.8MB in the beginning and 110.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 12:03:19,782 INFO L158 Benchmark]: RCFGBuilder took 700.27ms. Allocated memory is still 176.2MB. Free memory was 110.0MB in the beginning and 141.7MB in the end (delta: -31.7MB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. [2023-11-26 12:03:19,782 INFO L158 Benchmark]: TraceAbstraction took 5317.71ms. Allocated memory was 176.2MB in the beginning and 224.4MB in the end (delta: 48.2MB). Free memory was 141.0MB in the beginning and 104.2MB in the end (delta: 36.8MB). Peak memory consumption was 84.3MB. Max. memory is 16.1GB. [2023-11-26 12:03:19,782 INFO L158 Benchmark]: Witness Printer took 4.19ms. Allocated memory is still 224.4MB. Free memory is still 103.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 12:03:19,784 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.27ms. Allocated memory is still 117.4MB. Free memory is still 67.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 410.94ms. Allocated memory is still 176.2MB. Free memory was 129.6MB in the beginning and 115.5MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.29ms. Allocated memory is still 176.2MB. Free memory was 115.5MB in the beginning and 113.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.42ms. Allocated memory is still 176.2MB. Free memory was 112.8MB in the beginning and 110.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 700.27ms. Allocated memory is still 176.2MB. Free memory was 110.0MB in the beginning and 141.7MB in the end (delta: -31.7MB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5317.71ms. Allocated memory was 176.2MB in the beginning and 224.4MB in the end (delta: 48.2MB). Free memory was 141.0MB in the beginning and 104.2MB in the end (delta: 36.8MB). Peak memory consumption was 84.3MB. Max. memory is 16.1GB. * Witness Printer took 4.19ms. Allocated memory is still 224.4MB. Free memory is still 103.2MB. 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~short19 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 someBinaryDOUBLEComparisonOperation at line 152, overapproximation of someUnaryDOUBLEoperation at line 39, overapproximation of someBinaryArithmeticDOUBLEoperation at line 96. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_4 = 0; [L24] double var_1_5 = 127.5; [L25] double var_1_7 = 10000000000000.125; [L26] double var_1_8 = 1.25; [L27] double var_1_10 = 25.7; [L28] signed long int var_1_11 = -2; [L29] signed long int var_1_13 = 5; [L30] signed long int var_1_14 = 128; [L31] signed long int var_1_15 = 1000; [L32] double var_1_16 = 0.2; [L33] double var_1_17 = 0.25; [L34] double var_1_18 = 99999999999999.5; [L35] signed short int var_1_19 = -64; [L36] double var_1_20 = 256.75; [L37] double var_1_21 = 100.4; [L38] double var_1_22 = 4.5; [L39] double var_1_23 = -0.5; [L40] signed long int var_1_24 = 10; [L41] signed char var_1_25 = -8; [L42] signed char var_1_26 = 10; [L43] signed long int var_1_27 = 256; [L44] unsigned char var_1_28 = 4; [L45] unsigned char var_1_29 = 32; [L46] unsigned char last_1_var_1_1 = 1; [L47] signed long int last_1_var_1_11 = -2; [L48] signed long int last_1_var_1_15 = 1000; [L49] double last_1_var_1_16 = 0.2; [L156] isInitial = 1 [L157] FCALL initially() [L158] COND TRUE 1 [L159] CALL updateLastVariables() [L146] last_1_var_1_1 = var_1_1 [L147] last_1_var_1_11 = var_1_11 [L148] last_1_var_1_15 = var_1_15 [L149] last_1_var_1_16 = var_1_16 [L159] RET updateLastVariables() [L160] CALL updateVariables() [L113] var_1_4 = __VERIFIER_nondet_uchar() [L114] CALL assume_abort_if_not(var_1_4 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=1, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=1, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L114] RET assume_abort_if_not(var_1_4 >= 1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=1, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L115] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=1, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=1, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L115] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=1, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L116] var_1_7 = __VERIFIER_nondet_double() [L117] CALL assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L117] RET assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L118] var_1_10 = __VERIFIER_nondet_double() [L119] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L119] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L120] var_1_13 = __VERIFIER_nondet_long() [L121] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L121] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L122] CALL assume_abort_if_not(var_1_13 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L122] RET assume_abort_if_not(var_1_13 <= 2147483646) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L123] var_1_14 = __VERIFIER_nondet_long() [L124] CALL assume_abort_if_not(var_1_14 >= -2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L124] RET assume_abort_if_not(var_1_14 >= -2147483647) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L125] CALL assume_abort_if_not(var_1_14 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L125] RET assume_abort_if_not(var_1_14 <= 2147483646) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L126] var_1_17 = __VERIFIER_nondet_double() [L127] CALL assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L127] RET assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L128] var_1_18 = __VERIFIER_nondet_double() [L129] CALL assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L129] RET assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L130] var_1_20 = __VERIFIER_nondet_double() [L131] CALL assume_abort_if_not((var_1_20 >= -922337.2036854776000e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854776000e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L131] RET assume_abort_if_not((var_1_20 >= -922337.2036854776000e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854776000e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L132] var_1_21 = __VERIFIER_nondet_double() [L133] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854776000e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L133] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854776000e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L134] var_1_22 = __VERIFIER_nondet_double() [L135] CALL assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L135] RET assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L136] var_1_23 = __VERIFIER_nondet_double() [L137] CALL assume_abort_if_not((var_1_23 >= -922337.2036854776000e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854776000e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L137] RET assume_abort_if_not((var_1_23 >= -922337.2036854776000e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854776000e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L138] var_1_26 = __VERIFIER_nondet_char() [L139] CALL assume_abort_if_not(var_1_26 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=-127, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=-127, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L139] RET assume_abort_if_not(var_1_26 >= -127) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=-127, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L140] CALL assume_abort_if_not(var_1_26 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=-127, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=-127, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L140] RET assume_abort_if_not(var_1_26 <= 126) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=-127, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L141] var_1_29 = __VERIFIER_nondet_uchar() [L142] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=-127, var_1_27=256, var_1_28=4, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=-127, var_1_27=256, var_1_28=4, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L142] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=-127, var_1_27=256, var_1_28=4, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L143] CALL assume_abort_if_not(var_1_29 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=-127, var_1_27=256, var_1_28=4, var_1_29=254, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=-127, var_1_27=256, var_1_28=4, var_1_29=254, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L143] RET assume_abort_if_not(var_1_29 <= 254) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=-127, var_1_27=256, var_1_28=4, var_1_29=254, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L160] RET updateVariables() [L161] CALL step() [L53] COND TRUE (((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20))) - var_1_21) == (var_1_22 * var_1_23) [L54] var_1_19 = -4 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=-127, var_1_27=256, var_1_28=4, var_1_29=254, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L56] var_1_24 = var_1_19 [L57] var_1_25 = var_1_26 [L58] var_1_27 = var_1_25 [L59] var_1_28 = var_1_29 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=-127, var_1_26=-127, var_1_27=-127, var_1_28=254, var_1_29=254, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L60] COND TRUE \read(last_1_var_1_1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=-127, var_1_26=-127, var_1_27=-127, var_1_28=254, var_1_29=254, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L61] COND TRUE ((((last_1_var_1_16) > (49.75)) ? (last_1_var_1_16) : (49.75))) > last_1_var_1_16 [L62] var_1_11 = ((((last_1_var_1_15) < ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14))))) ? (last_1_var_1_15) : ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14)))))) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=0, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=-127, var_1_26=-127, var_1_27=-127, var_1_28=254, var_1_29=254, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L67] signed long int stepLocal_0 = last_1_var_1_11; VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_0=-2, var_1_11=0, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=-127, var_1_26=-127, var_1_27=-127, var_1_28=254, var_1_29=254, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L68] COND TRUE (last_1_var_1_11 / ((((-16) < 0 ) ? -(-16) : (-16)))) >= stepLocal_0 [L69] var_1_1 = var_1_4 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_0=-2, var_1_11=0, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=-127, var_1_26=-127, var_1_27=-127, var_1_28=254, var_1_29=254, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L71] signed long int stepLocal_2 = var_1_11; [L72] unsigned char stepLocal_1 = var_1_1; VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_0=-2, stepLocal_1=1, stepLocal_2=0, var_1_11=0, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=-127, var_1_26=-127, var_1_27=-127, var_1_28=254, var_1_29=254, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L73] COND TRUE \read(var_1_1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_0=-2, stepLocal_1=1, stepLocal_2=0, var_1_11=0, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=-127, var_1_26=-127, var_1_27=-127, var_1_28=254, var_1_29=254, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L74] COND TRUE var_1_11 >= stepLocal_2 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_0=-2, stepLocal_1=1, stepLocal_2=0, var_1_11=0, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=-127, var_1_26=-127, var_1_27=-127, var_1_28=254, var_1_29=254, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L75] COND TRUE stepLocal_1 || (var_1_11 < var_1_11) [L76] var_1_5 = var_1_7 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_0=-2, stepLocal_1=1, stepLocal_2=0, var_1_11=0, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=-127, var_1_26=-127, var_1_27=-127, var_1_28=254, var_1_29=254, var_1_4=1, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=5/4] [L82] EXPR var_1_11 & var_1_13 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_0=-2, stepLocal_1=1, stepLocal_2=0, var_1_11=0, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=-127, var_1_26=-127, var_1_27=-127, var_1_28=254, var_1_29=254, var_1_4=1, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=5/4] [L82] COND FALSE !((- var_1_11) > (var_1_11 & var_1_13)) [L93] var_1_15 = var_1_13 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_0=-2, stepLocal_1=1, stepLocal_2=0, var_1_11=0, var_1_13=5, var_1_14=-1, var_1_15=5, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=-127, var_1_26=-127, var_1_27=-127, var_1_28=254, var_1_29=254, var_1_4=1, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=5/4] [L95] COND TRUE ((((var_1_5) < (last_1_var_1_16)) ? (var_1_5) : (last_1_var_1_16))) >= var_1_7 [L96] var_1_16 = (var_1_17 + (var_1_18 + 16.75)) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_0=-2, stepLocal_1=1, stepLocal_2=0, var_1_11=0, var_1_13=5, var_1_14=-1, var_1_15=5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=-127, var_1_26=-127, var_1_27=-127, var_1_28=254, var_1_29=254, var_1_4=1, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=5/4] [L100] COND TRUE 10.55f < var_1_16 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_0=-2, stepLocal_1=1, stepLocal_2=0, var_1_11=0, var_1_13=5, var_1_14=-1, var_1_15=5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=-127, var_1_26=-127, var_1_27=-127, var_1_28=254, var_1_29=254, var_1_4=1, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=5/4] [L101] COND TRUE var_1_16 > (var_1_7 * var_1_16) [L102] var_1_8 = ((((var_1_7) > (var_1_10)) ? (var_1_7) : (var_1_10))) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_0=-2, stepLocal_1=1, stepLocal_2=0, var_1_10=100000000000004, var_1_11=0, var_1_13=5, var_1_14=-1, var_1_15=5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=-127, var_1_26=-127, var_1_27=-127, var_1_28=254, var_1_29=254, var_1_4=1, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=100000000000004] [L161] RET step() [L162] CALL, EXPR property() [L152] EXPR ((((((last_1_var_1_11 / ((((-16) < 0 ) ? -(-16) : (-16)))) >= last_1_var_1_11) ? (var_1_1 == ((unsigned char) var_1_4)) : 1) && (var_1_1 ? ((var_1_11 >= var_1_11) ? ((var_1_1 || (var_1_11 < var_1_11)) ? (var_1_5 == ((double) var_1_7)) : 1) : (var_1_5 == ((double) var_1_7))) : 1)) && ((10.55f < var_1_16) ? ((var_1_16 > (var_1_7 * var_1_16)) ? (var_1_8 == ((double) ((((var_1_7) > (var_1_10)) ? (var_1_7) : (var_1_10))))) : 1) : ((var_1_16 > var_1_7) ? (var_1_8 == ((double) var_1_10)) : (var_1_8 == ((double) var_1_7))))) && (last_1_var_1_1 ? ((((((last_1_var_1_16) > (49.75)) ? (last_1_var_1_16) : (49.75))) > last_1_var_1_16) ? (var_1_11 == ((signed long int) ((((last_1_var_1_15) < ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14))))) ? (last_1_var_1_15) : ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14)))))))) : 1) : (var_1_11 == ((signed long int) last_1_var_1_15)))) && (((- var_1_11) > (var_1_11 & var_1_13)) ? ((var_1_11 <= 128) ? (var_1_1 ? (var_1_15 == ((signed long int) var_1_14)) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_13))) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000004, var_1_11=0, var_1_13=5, var_1_14=-1, var_1_15=5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=-127, var_1_26=-127, var_1_27=-127, var_1_28=254, var_1_29=254, var_1_4=1, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=100000000000004] [L152-L153] return (((((((last_1_var_1_11 / ((((-16) < 0 ) ? -(-16) : (-16)))) >= last_1_var_1_11) ? (var_1_1 == ((unsigned char) var_1_4)) : 1) && (var_1_1 ? ((var_1_11 >= var_1_11) ? ((var_1_1 || (var_1_11 < var_1_11)) ? (var_1_5 == ((double) var_1_7)) : 1) : (var_1_5 == ((double) var_1_7))) : 1)) && ((10.55f < var_1_16) ? ((var_1_16 > (var_1_7 * var_1_16)) ? (var_1_8 == ((double) ((((var_1_7) > (var_1_10)) ? (var_1_7) : (var_1_10))))) : 1) : ((var_1_16 > var_1_7) ? (var_1_8 == ((double) var_1_10)) : (var_1_8 == ((double) var_1_7))))) && (last_1_var_1_1 ? ((((((last_1_var_1_16) > (49.75)) ? (last_1_var_1_16) : (49.75))) > last_1_var_1_16) ? (var_1_11 == ((signed long int) ((((last_1_var_1_15) < ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14))))) ? (last_1_var_1_15) : ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14)))))))) : 1) : (var_1_11 == ((signed long int) last_1_var_1_15)))) && (((- var_1_11) > (var_1_11 & var_1_13)) ? ((var_1_11 <= 128) ? (var_1_1 ? (var_1_15 == ((signed long int) var_1_14)) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_13)))) && ((((((var_1_5) < (last_1_var_1_16)) ? (var_1_5) : (last_1_var_1_16))) >= var_1_7) ? (var_1_16 == ((double) (var_1_17 + (var_1_18 + 16.75)))) : (var_1_16 == ((double) var_1_17))) ; [L162] RET, EXPR property() [L162] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000004, var_1_11=0, var_1_13=5, var_1_14=-1, var_1_15=5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=-127, var_1_26=-127, var_1_27=-127, var_1_28=254, var_1_29=254, var_1_4=1, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=100000000000004] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000004, var_1_11=0, var_1_13=5, var_1_14=-1, var_1_15=5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=-127, var_1_26=-127, var_1_27=-127, var_1_28=254, var_1_29=254, var_1_4=1, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=100000000000004] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 68 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.1s, OverallIterations: 5, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 321 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 320 mSDsluCounter, 754 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 364 mSDsCounter, 94 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 184 IncrementalHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 94 mSolverCounterUnsat, 390 mSDtfsCounter, 184 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 434 GetRequests, 411 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145occurred in iteration=3, InterpolantAutomatonStates: 22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 31 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 739 NumberOfCodeBlocks, 739 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 731 ConstructedInterpolants, 0 QuantifiedInterpolants, 2457 SizeOfPredicates, 4 NumberOfNonLiveVariables, 315 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 3519/3672 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-26 12:03:19,814 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab53572a-1c36-4252-86b9-53232bffb805/bin/uautomizer-verify-VRDe98Ueme/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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab53572a-1c36-4252-86b9-53232bffb805/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab53572a-1c36-4252-86b9-53232bffb805/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab53572a-1c36-4252-86b9-53232bffb805/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab53572a-1c36-4252-86b9-53232bffb805/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-30.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab53572a-1c36-4252-86b9-53232bffb805/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab53572a-1c36-4252-86b9-53232bffb805/bin/uautomizer-verify-VRDe98Ueme --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 88c823ba6d01c08a1ca0aef14f9fe845aa3afb85e89e5682ca1c816caf454f50 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 12:03:22,609 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 12:03:22,742 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab53572a-1c36-4252-86b9-53232bffb805/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-26 12:03:22,768 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 12:03:22,769 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 12:03:22,818 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 12:03:22,819 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 12:03:22,820 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 12:03:22,821 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 12:03:22,827 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 12:03:22,827 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 12:03:22,828 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 12:03:22,829 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 12:03:22,831 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 12:03:22,831 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 12:03:22,832 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 12:03:22,833 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 12:03:22,833 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 12:03:22,834 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 12:03:22,835 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 12:03:22,835 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 12:03:22,836 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 12:03:22,836 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 12:03:22,837 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-26 12:03:22,837 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-26 12:03:22,838 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-26 12:03:22,838 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 12:03:22,839 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 12:03:22,839 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 12:03:22,840 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 12:03:22,841 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 12:03:22,842 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 12:03:22,842 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 12:03:22,842 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 12:03:22,843 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 12:03:22,843 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 12:03:22,844 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 12:03:22,844 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-26 12:03:22,844 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-26 12:03:22,845 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 12:03:22,845 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 12:03:22,845 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 12:03:22,846 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 12:03:22,846 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 12:03:22,847 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-26 12:03:22,847 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_ab53572a-1c36-4252-86b9-53232bffb805/bin/uautomizer-verify-VRDe98Ueme/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_ab53572a-1c36-4252-86b9-53232bffb805/bin/uautomizer-verify-VRDe98Ueme 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 -> 88c823ba6d01c08a1ca0aef14f9fe845aa3afb85e89e5682ca1c816caf454f50 [2023-11-26 12:03:23,273 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 12:03:23,302 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 12:03:23,305 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 12:03:23,306 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 12:03:23,307 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 12:03:23,309 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab53572a-1c36-4252-86b9-53232bffb805/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-30.i [2023-11-26 12:03:26,417 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 12:03:26,780 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 12:03:26,781 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab53572a-1c36-4252-86b9-53232bffb805/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-30.i [2023-11-26 12:03:26,793 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab53572a-1c36-4252-86b9-53232bffb805/bin/uautomizer-verify-VRDe98Ueme/data/fa333a8ab/dcc8a15c46bc49ccbe0caead60eca865/FLAGb55251349 [2023-11-26 12:03:26,813 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab53572a-1c36-4252-86b9-53232bffb805/bin/uautomizer-verify-VRDe98Ueme/data/fa333a8ab/dcc8a15c46bc49ccbe0caead60eca865 [2023-11-26 12:03:26,819 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 12:03:26,821 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 12:03:26,825 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 12:03:26,826 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 12:03:26,831 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 12:03:26,832 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:03:26" (1/1) ... [2023-11-26 12:03:26,833 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51e70fa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:03:26, skipping insertion in model container [2023-11-26 12:03:26,834 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:03:26" (1/1) ... [2023-11-26 12:03:26,886 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 12:03:27,095 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_ab53572a-1c36-4252-86b9-53232bffb805/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-30.i[915,928] [2023-11-26 12:03:27,201 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 12:03:27,226 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 12:03:27,247 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_ab53572a-1c36-4252-86b9-53232bffb805/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-30.i[915,928] [2023-11-26 12:03:27,313 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 12:03:27,336 INFO L206 MainTranslator]: Completed translation [2023-11-26 12:03:27,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:03:27 WrapperNode [2023-11-26 12:03:27,337 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 12:03:27,338 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 12:03:27,338 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 12:03:27,339 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 12:03:27,347 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:03:27" (1/1) ... [2023-11-26 12:03:27,361 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:03:27" (1/1) ... [2023-11-26 12:03:27,397 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 159 [2023-11-26 12:03:27,398 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 12:03:27,398 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 12:03:27,399 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 12:03:27,399 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 12:03:27,411 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:03:27" (1/1) ... [2023-11-26 12:03:27,412 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:03:27" (1/1) ... [2023-11-26 12:03:27,417 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:03:27" (1/1) ... [2023-11-26 12:03:27,441 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-26 12:03:27,452 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:03:27" (1/1) ... [2023-11-26 12:03:27,452 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:03:27" (1/1) ... [2023-11-26 12:03:27,482 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:03:27" (1/1) ... [2023-11-26 12:03:27,493 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:03:27" (1/1) ... [2023-11-26 12:03:27,496 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:03:27" (1/1) ... [2023-11-26 12:03:27,513 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:03:27" (1/1) ... [2023-11-26 12:03:27,518 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 12:03:27,519 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 12:03:27,519 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 12:03:27,519 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 12:03:27,520 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:03:27" (1/1) ... [2023-11-26 12:03:27,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 12:03:27,538 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab53572a-1c36-4252-86b9-53232bffb805/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:03:27,553 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab53572a-1c36-4252-86b9-53232bffb805/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 12:03:27,582 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab53572a-1c36-4252-86b9-53232bffb805/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 12:03:27,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 12:03:27,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-26 12:03:27,604 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-26 12:03:27,604 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-26 12:03:27,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 12:03:27,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 12:03:27,733 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 12:03:27,741 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 12:03:46,411 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 12:03:46,538 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 12:03:46,539 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-26 12:03:46,540 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:03:46 BoogieIcfgContainer [2023-11-26 12:03:46,540 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 12:03:46,542 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 12:03:46,543 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 12:03:46,547 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 12:03:46,548 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:03:26" (1/3) ... [2023-11-26 12:03:46,550 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31da00c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:03:46, skipping insertion in model container [2023-11-26 12:03:46,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:03:27" (2/3) ... [2023-11-26 12:03:46,552 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31da00c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:03:46, skipping insertion in model container [2023-11-26 12:03:46,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:03:46" (3/3) ... [2023-11-26 12:03:46,554 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-30.i [2023-11-26 12:03:46,577 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 12:03:46,577 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-26 12:03:46,654 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 12:03:46,663 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;@3d14fd9b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 12:03:46,664 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-26 12:03:46,668 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 40 states have (on average 1.475) internal successors, (59), 41 states have internal predecessors, (59), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-26 12:03:46,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-26 12:03:46,687 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:03:46,688 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 12:03:46,689 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:03:46,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:03:46,696 INFO L85 PathProgramCache]: Analyzing trace with hash -2035393304, now seen corresponding path program 1 times [2023-11-26 12:03:46,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 12:03:46,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1874917933] [2023-11-26 12:03:46,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:03:46,735 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-26 12:03:46,735 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab53572a-1c36-4252-86b9-53232bffb805/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 12:03:46,742 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab53572a-1c36-4252-86b9-53232bffb805/bin/uautomizer-verify-VRDe98Ueme/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-26 12:03:46,751 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab53572a-1c36-4252-86b9-53232bffb805/bin/uautomizer-verify-VRDe98Ueme/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-26 12:03:47,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:47,616 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-26 12:03:47,628 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 12:03:48,504 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-26 12:03:48,508 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 12:03:48,508 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 12:03:48,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1874917933] [2023-11-26 12:03:48,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1874917933] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:03:48,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:03:48,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 12:03:48,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019573236] [2023-11-26 12:03:48,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:03:48,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 12:03:48,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 12:03:48,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 12:03:48,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 12:03:48,568 INFO L87 Difference]: Start difference. First operand has 61 states, 40 states have (on average 1.475) internal successors, (59), 41 states have internal predecessors, (59), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-26 12:03:53,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-26 12:03:57,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-26 12:03:59,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-26 12:04:03,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-26 12:04:07,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-26 12:04:07,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:04:07,343 INFO L93 Difference]: Finished difference Result 194 states and 347 transitions. [2023-11-26 12:04:07,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 12:04:07,396 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2023-11-26 12:04:07,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:04:07,408 INFO L225 Difference]: With dead ends: 194 [2023-11-26 12:04:07,408 INFO L226 Difference]: Without dead ends: 134 [2023-11-26 12:04:07,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-26 12:04:07,415 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 82 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 39 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.7s IncrementalHoareTripleChecker+Time [2023-11-26 12:04:07,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 272 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 17 Invalid, 4 Unknown, 0 Unchecked, 18.7s Time] [2023-11-26 12:04:07,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-11-26 12:04:07,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 115. [2023-11-26 12:04:07,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 76 states have (on average 1.355263157894737) internal successors, (103), 76 states have internal predecessors, (103), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-26 12:04:07,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 175 transitions. [2023-11-26 12:04:07,490 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 175 transitions. Word has length 119 [2023-11-26 12:04:07,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:04:07,492 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 175 transitions. [2023-11-26 12:04:07,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-26 12:04:07,492 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 175 transitions. [2023-11-26 12:04:07,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-26 12:04:07,495 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:04:07,496 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 12:04:07,516 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab53572a-1c36-4252-86b9-53232bffb805/bin/uautomizer-verify-VRDe98Ueme/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-26 12:04:07,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab53572a-1c36-4252-86b9-53232bffb805/bin/uautomizer-verify-VRDe98Ueme/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-26 12:04:07,715 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:04:07,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:04:07,716 INFO L85 PathProgramCache]: Analyzing trace with hash 282131000, now seen corresponding path program 1 times [2023-11-26 12:04:07,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 12:04:07,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [474515341] [2023-11-26 12:04:07,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:04:07,717 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-26 12:04:07,718 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab53572a-1c36-4252-86b9-53232bffb805/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 12:04:07,722 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab53572a-1c36-4252-86b9-53232bffb805/bin/uautomizer-verify-VRDe98Ueme/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-26 12:04:07,723 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab53572a-1c36-4252-86b9-53232bffb805/bin/uautomizer-verify-VRDe98Ueme/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-26 12:04:08,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:08,569 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-26 12:04:08,576 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 12:04:10,092 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 36 proven. 96 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-26 12:04:10,092 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 12:04:10,756 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-11-26 12:04:10,757 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 12:04:10,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [474515341] [2023-11-26 12:04:10,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [474515341] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 12:04:10,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-26 12:04:10,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2023-11-26 12:04:10,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635305708] [2023-11-26 12:04:10,758 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-26 12:04:10,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-26 12:04:10,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 12:04:10,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-26 12:04:10,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-11-26 12:04:10,762 INFO L87 Difference]: Start difference. First operand 115 states and 175 transitions. Second operand has 12 states, 12 states have (on average 5.5) internal successors, (66), 12 states have internal predecessors, (66), 3 states have call successors, (35), 3 states have call predecessors, (35), 5 states have return successors, (36), 2 states have call predecessors, (36), 3 states have call successors, (36)