./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-30.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-30.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 33c1f0c79da133a8e85d7b9730efd8560ba4fbfcdfa2f486932f30e8596806cc --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-28 20:21:32,956 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-28 20:21:33,027 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-28 20:21:33,032 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-28 20:21:33,033 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-28 20:21:33,058 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-28 20:21:33,059 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-28 20:21:33,059 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-28 20:21:33,060 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-28 20:21:33,060 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-28 20:21:33,061 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-28 20:21:33,061 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-28 20:21:33,062 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-28 20:21:33,063 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-28 20:21:33,063 INFO L153 SettingsManager]: * Use SBE=true [2023-11-28 20:21:33,064 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-28 20:21:33,064 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-28 20:21:33,065 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-28 20:21:33,065 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-28 20:21:33,066 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-28 20:21:33,066 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-28 20:21:33,067 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-28 20:21:33,067 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-28 20:21:33,068 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-28 20:21:33,068 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-28 20:21:33,069 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-28 20:21:33,069 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-28 20:21:33,069 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-28 20:21:33,070 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-28 20:21:33,070 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-28 20:21:33,071 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-28 20:21:33,071 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:21:33,071 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-28 20:21:33,072 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-28 20:21:33,072 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-28 20:21:33,072 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-28 20:21:33,072 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-28 20:21:33,073 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-28 20:21:33,073 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-28 20:21:33,073 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-28 20:21:33,073 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-28 20:21:33,074 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-28 20:21:33,074 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_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 33c1f0c79da133a8e85d7b9730efd8560ba4fbfcdfa2f486932f30e8596806cc [2023-11-28 20:21:33,304 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-28 20:21:33,333 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-28 20:21:33,348 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-28 20:21:33,349 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-28 20:21:33,349 INFO L274 PluginConnector]: CDTParser initialized [2023-11-28 20:21:33,351 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-30.i [2023-11-28 20:21:36,103 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-28 20:21:36,326 INFO L384 CDTParser]: Found 1 translation units. [2023-11-28 20:21:36,326 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-30.i [2023-11-28 20:21:36,337 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya/data/b7edf95fd/c7793b3f62ff4ffbbbd71bba264c42ab/FLAGde7b963dd [2023-11-28 20:21:36,350 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya/data/b7edf95fd/c7793b3f62ff4ffbbbd71bba264c42ab [2023-11-28 20:21:36,352 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-28 20:21:36,353 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-28 20:21:36,354 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-28 20:21:36,354 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-28 20:21:36,358 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-28 20:21:36,359 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:21:36" (1/1) ... [2023-11-28 20:21:36,360 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1895194a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:36, skipping insertion in model container [2023-11-28 20:21:36,360 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:21:36" (1/1) ... [2023-11-28 20:21:36,400 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 20:21:36,524 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_fdeae51d-7183-48f8-b119-f7c3715a12cd/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-30.i[915,928] [2023-11-28 20:21:36,584 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:21:36,594 INFO L202 MainTranslator]: Completed pre-run [2023-11-28 20:21:36,607 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_fdeae51d-7183-48f8-b119-f7c3715a12cd/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-30.i[915,928] [2023-11-28 20:21:36,642 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:21:36,660 INFO L206 MainTranslator]: Completed translation [2023-11-28 20:21:36,661 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:36 WrapperNode [2023-11-28 20:21:36,661 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-28 20:21:36,662 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-28 20:21:36,662 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-28 20:21:36,662 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-28 20:21:36,670 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:36" (1/1) ... [2023-11-28 20:21:36,681 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:36" (1/1) ... [2023-11-28 20:21:36,714 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 258 [2023-11-28 20:21:36,714 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-28 20:21:36,715 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-28 20:21:36,715 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-28 20:21:36,715 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-28 20:21:36,724 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:36" (1/1) ... [2023-11-28 20:21:36,724 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:36" (1/1) ... [2023-11-28 20:21:36,727 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:36" (1/1) ... [2023-11-28 20:21:36,739 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-28 20:21:36,739 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:36" (1/1) ... [2023-11-28 20:21:36,740 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:36" (1/1) ... [2023-11-28 20:21:36,749 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:36" (1/1) ... [2023-11-28 20:21:36,754 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:36" (1/1) ... [2023-11-28 20:21:36,757 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:36" (1/1) ... [2023-11-28 20:21:36,759 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:36" (1/1) ... [2023-11-28 20:21:36,763 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-28 20:21:36,764 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-28 20:21:36,764 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-28 20:21:36,764 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-28 20:21:36,765 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:36" (1/1) ... [2023-11-28 20:21:36,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:21:36,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:21:36,799 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-28 20:21:36,803 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-28 20:21:36,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-28 20:21:36,834 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-28 20:21:36,834 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-28 20:21:36,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-28 20:21:36,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-28 20:21:36,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-28 20:21:36,933 INFO L241 CfgBuilder]: Building ICFG [2023-11-28 20:21:36,936 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-28 20:21:37,261 INFO L282 CfgBuilder]: Performing block encoding [2023-11-28 20:21:37,292 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-28 20:21:37,292 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-28 20:21:37,293 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:21:37 BoogieIcfgContainer [2023-11-28 20:21:37,293 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-28 20:21:37,296 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-28 20:21:37,296 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-28 20:21:37,299 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-28 20:21:37,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:21:36" (1/3) ... [2023-11-28 20:21:37,300 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3adb82e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:21:37, skipping insertion in model container [2023-11-28 20:21:37,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:36" (2/3) ... [2023-11-28 20:21:37,301 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3adb82e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:21:37, skipping insertion in model container [2023-11-28 20:21:37,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:21:37" (3/3) ... [2023-11-28 20:21:37,302 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-50_file-30.i [2023-11-28 20:21:37,321 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-28 20:21:37,322 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-28 20:21:37,372 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-28 20:21:37,378 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;@734d3865, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-28 20:21:37,378 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-28 20:21:37,381 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 68 states have (on average 1.5147058823529411) internal successors, (103), 69 states have internal predecessors, (103), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2023-11-28 20:21:37,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2023-11-28 20:21:37,408 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:21:37,410 INFO L195 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:21:37,410 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:21:37,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:21:37,415 INFO L85 PathProgramCache]: Analyzing trace with hash -307117052, now seen corresponding path program 1 times [2023-11-28 20:21:37,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:21:37,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31523462] [2023-11-28 20:21:37,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:21:37,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:21:37,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:37,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:21:37,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:37,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-28 20:21:37,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:37,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-28 20:21:37,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:37,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-28 20:21:37,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:37,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-28 20:21:37,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:37,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-28 20:21:37,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:37,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-28 20:21:37,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:37,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-28 20:21:37,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:37,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-28 20:21:37,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:37,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-28 20:21:37,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:37,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-28 20:21:37,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:37,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-28 20:21:37,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:37,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-28 20:21:37,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:37,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-28 20:21:37,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:37,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-28 20:21:37,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:37,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-28 20:21:37,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:37,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-28 20:21:37,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:37,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-28 20:21:37,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:37,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-28 20:21:37,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:37,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-28 20:21:37,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:37,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-28 20:21:37,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:37,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-28 20:21:37,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:37,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-28 20:21:37,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:37,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-11-28 20:21:37,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:37,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-11-28 20:21:37,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:37,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2023-11-28 20:21:37,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:37,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2023-11-28 20:21:37,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:37,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2023-11-28 20:21:37,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:37,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2023-11-28 20:21:37,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:37,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2023-11-28 20:21:37,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:37,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2023-11-28 20:21:37,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:37,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2023-11-28 20:21:37,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:37,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2023-11-28 20:21:37,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:37,868 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2023-11-28 20:21:37,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:21:37,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31523462] [2023-11-28 20:21:37,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31523462] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:21:37,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:21:37,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:21:37,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976046437] [2023-11-28 20:21:37,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:21:37,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-28 20:21:37,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:21:37,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-28 20:21:37,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-28 20:21:37,910 INFO L87 Difference]: Start difference. First operand has 104 states, 68 states have (on average 1.5147058823529411) internal successors, (103), 69 states have internal predecessors, (103), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2023-11-28 20:21:37,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:21:37,954 INFO L93 Difference]: Finished difference Result 205 states and 369 transitions. [2023-11-28 20:21:37,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-28 20:21:37,957 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) Word has length 213 [2023-11-28 20:21:37,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:21:37,966 INFO L225 Difference]: With dead ends: 205 [2023-11-28 20:21:37,966 INFO L226 Difference]: Without dead ends: 102 [2023-11-28 20:21:37,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-28 20:21:37,974 INFO L413 NwaCegarLoop]: 161 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, 161 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-28 20:21:37,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 161 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-28 20:21:37,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-11-28 20:21:38,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2023-11-28 20:21:38,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 67 states have (on average 1.462686567164179) internal successors, (98), 67 states have internal predecessors, (98), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2023-11-28 20:21:38,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 164 transitions. [2023-11-28 20:21:38,030 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 164 transitions. Word has length 213 [2023-11-28 20:21:38,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:21:38,031 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 164 transitions. [2023-11-28 20:21:38,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2023-11-28 20:21:38,032 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 164 transitions. [2023-11-28 20:21:38,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2023-11-28 20:21:38,037 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:21:38,037 INFO L195 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:21:38,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-28 20:21:38,038 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:21:38,039 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:21:38,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1627793350, now seen corresponding path program 1 times [2023-11-28 20:21:38,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:21:38,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919218347] [2023-11-28 20:21:38,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:21:38,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:21:38,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:38,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:21:38,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:38,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-28 20:21:38,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:38,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-28 20:21:38,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:38,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-28 20:21:38,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:38,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-28 20:21:38,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:38,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-28 20:21:38,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:38,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-28 20:21:38,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:38,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-28 20:21:38,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:38,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-28 20:21:38,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:38,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-28 20:21:38,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:38,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-28 20:21:38,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:38,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-28 20:21:38,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:38,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-28 20:21:38,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:38,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-28 20:21:38,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:38,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-28 20:21:38,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:38,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-28 20:21:38,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:38,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-28 20:21:38,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:38,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-28 20:21:38,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:38,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-28 20:21:38,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:38,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-28 20:21:38,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:38,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-28 20:21:38,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:38,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-28 20:21:38,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:38,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-28 20:21:38,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:38,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-11-28 20:21:38,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:38,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-11-28 20:21:38,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:38,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2023-11-28 20:21:38,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:38,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2023-11-28 20:21:38,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:38,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2023-11-28 20:21:38,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:38,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2023-11-28 20:21:38,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:38,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2023-11-28 20:21:38,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:38,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2023-11-28 20:21:38,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:38,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2023-11-28 20:21:38,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:38,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2023-11-28 20:21:38,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:38,394 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2023-11-28 20:21:38,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:21:38,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919218347] [2023-11-28 20:21:38,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919218347] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:21:38,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:21:38,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 20:21:38,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905219758] [2023-11-28 20:21:38,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:21:38,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:21:38,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:21:38,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:21:38,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:21:38,399 INFO L87 Difference]: Start difference. First operand 102 states and 164 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2023-11-28 20:21:38,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:21:38,436 INFO L93 Difference]: Finished difference Result 204 states and 328 transitions. [2023-11-28 20:21:38,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:21:38,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 213 [2023-11-28 20:21:38,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:21:38,440 INFO L225 Difference]: With dead ends: 204 [2023-11-28 20:21:38,441 INFO L226 Difference]: Without dead ends: 103 [2023-11-28 20:21:38,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:21:38,444 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 155 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-28 20:21:38,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 157 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-28 20:21:38,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-11-28 20:21:38,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2023-11-28 20:21:38,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 67 states have (on average 1.4477611940298507) internal successors, (97), 67 states have internal predecessors, (97), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2023-11-28 20:21:38,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 163 transitions. [2023-11-28 20:21:38,463 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 163 transitions. Word has length 213 [2023-11-28 20:21:38,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:21:38,466 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 163 transitions. [2023-11-28 20:21:38,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2023-11-28 20:21:38,466 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 163 transitions. [2023-11-28 20:21:38,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2023-11-28 20:21:38,471 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:21:38,471 INFO L195 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:21:38,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-28 20:21:38,471 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:21:38,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:21:38,472 INFO L85 PathProgramCache]: Analyzing trace with hash -604718037, now seen corresponding path program 1 times [2023-11-28 20:21:38,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:21:38,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044405509] [2023-11-28 20:21:38,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:21:38,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:21:38,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:38,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:21:38,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:38,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-28 20:21:38,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:38,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-28 20:21:38,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:38,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-28 20:21:38,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:38,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-28 20:21:38,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:38,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-28 20:21:38,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:38,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-28 20:21:38,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:38,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-28 20:21:38,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:38,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-28 20:21:38,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:38,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-28 20:21:38,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:38,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-28 20:21:38,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:38,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-28 20:21:38,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:38,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-28 20:21:38,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:38,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-28 20:21:38,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:38,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-28 20:21:38,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:38,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-28 20:21:38,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:38,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-28 20:21:38,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:38,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-28 20:21:38,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:38,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-28 20:21:38,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:38,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-28 20:21:38,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:38,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-28 20:21:38,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:38,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-28 20:21:38,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:38,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-28 20:21:38,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:38,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-11-28 20:21:38,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:38,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-11-28 20:21:38,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:38,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2023-11-28 20:21:38,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:38,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2023-11-28 20:21:38,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:38,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2023-11-28 20:21:38,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:38,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2023-11-28 20:21:38,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:38,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2023-11-28 20:21:38,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:38,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2023-11-28 20:21:38,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:38,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2023-11-28 20:21:38,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:38,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2023-11-28 20:21:38,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:38,774 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2023-11-28 20:21:38,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:21:38,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044405509] [2023-11-28 20:21:38,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044405509] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:21:38,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:21:38,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 20:21:38,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760190466] [2023-11-28 20:21:38,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:21:38,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 20:21:38,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:21:38,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 20:21:38,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 20:21:38,778 INFO L87 Difference]: Start difference. First operand 102 states and 163 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2023-11-28 20:21:38,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:21:38,973 INFO L93 Difference]: Finished difference Result 265 states and 420 transitions. [2023-11-28 20:21:38,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 20:21:38,973 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 214 [2023-11-28 20:21:38,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:21:38,977 INFO L225 Difference]: With dead ends: 265 [2023-11-28 20:21:38,977 INFO L226 Difference]: Without dead ends: 164 [2023-11-28 20:21:38,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 69 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-28 20:21:38,980 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 248 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-28 20:21:38,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 342 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-28 20:21:38,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2023-11-28 20:21:39,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 102. [2023-11-28 20:21:39,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 67 states have (on average 1.4328358208955223) internal successors, (96), 67 states have internal predecessors, (96), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2023-11-28 20:21:39,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 162 transitions. [2023-11-28 20:21:39,007 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 162 transitions. Word has length 214 [2023-11-28 20:21:39,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:21:39,008 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 162 transitions. [2023-11-28 20:21:39,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2023-11-28 20:21:39,009 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 162 transitions. [2023-11-28 20:21:39,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2023-11-28 20:21:39,012 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:21:39,012 INFO L195 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:21:39,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-28 20:21:39,013 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:21:39,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:21:39,013 INFO L85 PathProgramCache]: Analyzing trace with hash 2101901357, now seen corresponding path program 1 times [2023-11-28 20:21:39,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:21:39,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935487676] [2023-11-28 20:21:39,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:21:39,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:21:39,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:39,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:21:39,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:39,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-28 20:21:39,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:39,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-28 20:21:39,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:39,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-28 20:21:39,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:39,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-28 20:21:39,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:39,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-28 20:21:39,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:39,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-28 20:21:39,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:39,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-28 20:21:39,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:39,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-28 20:21:39,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:39,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-28 20:21:39,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:39,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-28 20:21:39,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:39,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-28 20:21:39,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:39,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-28 20:21:39,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:39,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-28 20:21:39,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:39,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-28 20:21:39,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:39,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-28 20:21:39,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:39,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-28 20:21:39,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:39,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-28 20:21:39,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:39,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-28 20:21:39,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:39,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-28 20:21:39,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:39,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-28 20:21:39,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:39,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-28 20:21:39,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:39,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-28 20:21:39,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:39,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-11-28 20:21:39,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:39,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-11-28 20:21:39,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:39,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2023-11-28 20:21:39,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:39,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2023-11-28 20:21:39,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:39,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2023-11-28 20:21:39,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:39,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2023-11-28 20:21:39,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:39,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2023-11-28 20:21:39,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:39,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2023-11-28 20:21:39,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:39,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2023-11-28 20:21:39,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:39,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2023-11-28 20:21:39,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:39,409 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2023-11-28 20:21:39,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:21:39,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935487676] [2023-11-28 20:21:39,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935487676] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:21:39,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:21:39,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 20:21:39,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777171421] [2023-11-28 20:21:39,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:21:39,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 20:21:39,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:21:39,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 20:21:39,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-28 20:21:39,412 INFO L87 Difference]: Start difference. First operand 102 states and 162 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2023-11-28 20:21:39,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:21:39,748 INFO L93 Difference]: Finished difference Result 330 states and 526 transitions. [2023-11-28 20:21:39,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 20:21:39,749 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 214 [2023-11-28 20:21:39,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:21:39,753 INFO L225 Difference]: With dead ends: 330 [2023-11-28 20:21:39,753 INFO L226 Difference]: Without dead ends: 229 [2023-11-28 20:21:39,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-28 20:21:39,755 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 177 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-28 20:21:39,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 563 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-28 20:21:39,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2023-11-28 20:21:39,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 203. [2023-11-28 20:21:39,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 134 states have (on average 1.4179104477611941) internal successors, (190), 134 states have internal predecessors, (190), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2023-11-28 20:21:39,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 322 transitions. [2023-11-28 20:21:39,808 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 322 transitions. Word has length 214 [2023-11-28 20:21:39,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:21:39,809 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 322 transitions. [2023-11-28 20:21:39,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2023-11-28 20:21:39,809 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 322 transitions. [2023-11-28 20:21:39,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2023-11-28 20:21:39,813 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:21:39,813 INFO L195 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:21:39,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-28 20:21:39,814 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:21:39,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:21:39,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1606259925, now seen corresponding path program 1 times [2023-11-28 20:21:39,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:21:39,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408303251] [2023-11-28 20:21:39,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:21:39,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:21:39,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:40,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:21:40,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:40,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-28 20:21:40,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:40,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-28 20:21:40,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:40,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-28 20:21:40,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:40,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-28 20:21:40,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:40,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-28 20:21:40,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:40,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-28 20:21:40,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:40,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-28 20:21:40,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:40,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-28 20:21:40,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:40,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-28 20:21:40,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:40,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-28 20:21:40,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:40,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-28 20:21:40,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:40,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-28 20:21:40,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:40,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-28 20:21:40,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:40,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-28 20:21:40,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:40,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-28 20:21:40,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:40,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-28 20:21:40,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:40,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-28 20:21:40,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:40,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-28 20:21:40,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:40,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-28 20:21:40,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:40,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-28 20:21:40,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:40,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-28 20:21:40,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:40,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-28 20:21:40,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:40,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-11-28 20:21:40,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:40,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-11-28 20:21:40,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:40,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2023-11-28 20:21:40,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:40,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2023-11-28 20:21:40,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:40,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2023-11-28 20:21:40,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:40,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2023-11-28 20:21:40,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:40,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2023-11-28 20:21:40,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:40,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2023-11-28 20:21:40,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:40,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2023-11-28 20:21:40,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:40,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2023-11-28 20:21:40,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:40,235 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2023-11-28 20:21:40,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:21:40,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408303251] [2023-11-28 20:21:40,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408303251] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:21:40,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:21:40,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 20:21:40,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966202380] [2023-11-28 20:21:40,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:21:40,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 20:21:40,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:21:40,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 20:21:40,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 20:21:40,238 INFO L87 Difference]: Start difference. First operand 203 states and 322 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2023-11-28 20:21:40,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:21:40,482 INFO L93 Difference]: Finished difference Result 432 states and 685 transitions. [2023-11-28 20:21:40,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 20:21:40,483 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 214 [2023-11-28 20:21:40,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:21:40,487 INFO L225 Difference]: With dead ends: 432 [2023-11-28 20:21:40,487 INFO L226 Difference]: Without dead ends: 329 [2023-11-28 20:21:40,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 69 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-28 20:21:40,489 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 114 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-28 20:21:40,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 465 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-28 20:21:40,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2023-11-28 20:21:40,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 278. [2023-11-28 20:21:40,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 175 states have (on average 1.3771428571428572) internal successors, (241), 175 states have internal predecessors, (241), 99 states have call successors, (99), 3 states have call predecessors, (99), 3 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2023-11-28 20:21:40,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 439 transitions. [2023-11-28 20:21:40,565 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 439 transitions. Word has length 214 [2023-11-28 20:21:40,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:21:40,566 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 439 transitions. [2023-11-28 20:21:40,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2023-11-28 20:21:40,567 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 439 transitions. [2023-11-28 20:21:40,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2023-11-28 20:21:40,570 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:21:40,570 INFO L195 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:21:40,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-28 20:21:40,570 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:21:40,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:21:40,571 INFO L85 PathProgramCache]: Analyzing trace with hash 793329878, now seen corresponding path program 1 times [2023-11-28 20:21:40,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:21:40,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614814303] [2023-11-28 20:21:40,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:21:40,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:21:40,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:40,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:21:40,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:41,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-28 20:21:41,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:41,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-28 20:21:41,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:41,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-28 20:21:41,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:41,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-28 20:21:41,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:41,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-28 20:21:41,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:41,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-28 20:21:41,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:41,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-28 20:21:41,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:41,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-28 20:21:41,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:41,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-28 20:21:41,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:41,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-28 20:21:41,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:41,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-28 20:21:41,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:41,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-28 20:21:41,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:41,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-28 20:21:41,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:41,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-28 20:21:41,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:41,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-28 20:21:41,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:41,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-28 20:21:41,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:41,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-28 20:21:41,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:41,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-28 20:21:41,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:41,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-28 20:21:41,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:41,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-28 20:21:41,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:41,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-28 20:21:41,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:41,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-28 20:21:41,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:41,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-11-28 20:21:41,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:41,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-11-28 20:21:41,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:41,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2023-11-28 20:21:41,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:41,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2023-11-28 20:21:41,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:41,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2023-11-28 20:21:41,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:41,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2023-11-28 20:21:41,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:41,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2023-11-28 20:21:41,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:41,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2023-11-28 20:21:41,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:41,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2023-11-28 20:21:41,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:41,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2023-11-28 20:21:41,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:41,164 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2023-11-28 20:21:41,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:21:41,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614814303] [2023-11-28 20:21:41,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614814303] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:21:41,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573981890] [2023-11-28 20:21:41,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:21:41,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:21:41,166 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:21:41,170 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 20:21:41,171 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-28 20:21:41,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:41,375 INFO L262 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-28 20:21:41,389 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:21:41,935 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 32 proven. 96 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2023-11-28 20:21:41,935 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:21:42,317 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2023-11-28 20:21:42,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573981890] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:21:42,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-28 20:21:42,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2023-11-28 20:21:42,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900250660] [2023-11-28 20:21:42,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-28 20:21:42,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-28 20:21:42,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:21:42,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-28 20:21:42,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-11-28 20:21:42,321 INFO L87 Difference]: Start difference. First operand 278 states and 439 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 2 states have call successors, (65), 2 states have call predecessors, (65), 4 states have return successors, (66), 1 states have call predecessors, (66), 2 states have call successors, (66) [2023-11-28 20:21:42,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:21:42,826 INFO L93 Difference]: Finished difference Result 522 states and 814 transitions. [2023-11-28 20:21:42,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-28 20:21:42,827 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 2 states have call successors, (65), 2 states have call predecessors, (65), 4 states have return successors, (66), 1 states have call predecessors, (66), 2 states have call successors, (66) Word has length 215 [2023-11-28 20:21:42,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:21:42,830 INFO L225 Difference]: With dead ends: 522 [2023-11-28 20:21:42,830 INFO L226 Difference]: Without dead ends: 320 [2023-11-28 20:21:42,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 491 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2023-11-28 20:21:42,832 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 401 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-28 20:21:42,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 374 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-28 20:21:42,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2023-11-28 20:21:42,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 290. [2023-11-28 20:21:42,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 184 states have (on average 1.3369565217391304) internal successors, (246), 184 states have internal predecessors, (246), 99 states have call successors, (99), 6 states have call predecessors, (99), 6 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2023-11-28 20:21:42,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 444 transitions. [2023-11-28 20:21:42,905 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 444 transitions. Word has length 215 [2023-11-28 20:21:42,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:21:42,906 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 444 transitions. [2023-11-28 20:21:42,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 2 states have call successors, (65), 2 states have call predecessors, (65), 4 states have return successors, (66), 1 states have call predecessors, (66), 2 states have call successors, (66) [2023-11-28 20:21:42,906 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 444 transitions. [2023-11-28 20:21:42,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2023-11-28 20:21:42,908 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:21:42,908 INFO L195 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:21:42,914 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-28 20:21:43,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-28 20:21:43,109 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:21:43,109 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:21:43,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1162328571, now seen corresponding path program 1 times [2023-11-28 20:21:43,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:21:43,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836570307] [2023-11-28 20:21:43,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:21:43,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:21:43,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:43,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:21:43,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:43,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-28 20:21:43,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:43,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-28 20:21:43,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:43,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-28 20:21:43,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:43,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-28 20:21:43,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:43,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-28 20:21:43,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:43,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-28 20:21:43,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:43,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-28 20:21:43,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:43,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-28 20:21:43,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:43,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-28 20:21:43,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:43,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-28 20:21:43,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:43,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-28 20:21:43,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:43,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-28 20:21:43,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:43,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-28 20:21:43,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:43,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-28 20:21:43,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:43,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-28 20:21:43,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:43,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-28 20:21:43,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:43,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-28 20:21:43,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:43,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-28 20:21:43,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:43,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-28 20:21:43,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:43,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-28 20:21:43,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:43,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-28 20:21:43,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:43,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-28 20:21:43,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:43,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-11-28 20:21:43,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:43,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-11-28 20:21:43,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:43,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2023-11-28 20:21:43,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:43,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2023-11-28 20:21:43,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:43,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2023-11-28 20:21:43,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:43,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2023-11-28 20:21:43,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:43,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2023-11-28 20:21:43,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:43,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2023-11-28 20:21:43,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:43,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2023-11-28 20:21:43,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:43,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2023-11-28 20:21:43,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:43,325 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2023-11-28 20:21:43,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:21:43,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836570307] [2023-11-28 20:21:43,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836570307] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:21:43,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:21:43,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 20:21:43,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231953854] [2023-11-28 20:21:43,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:21:43,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:21:43,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:21:43,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:21:43,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:21:43,328 INFO L87 Difference]: Start difference. First operand 290 states and 444 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2023-11-28 20:21:43,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:21:43,419 INFO L93 Difference]: Finished difference Result 500 states and 767 transitions. [2023-11-28 20:21:43,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:21:43,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 216 [2023-11-28 20:21:43,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:21:43,422 INFO L225 Difference]: With dead ends: 500 [2023-11-28 20:21:43,423 INFO L226 Difference]: Without dead ends: 290 [2023-11-28 20:21:43,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:21:43,424 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 20 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 271 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-28 20:21:43,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 271 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-28 20:21:43,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2023-11-28 20:21:43,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2023-11-28 20:21:43,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 184 states have (on average 1.326086956521739) internal successors, (244), 184 states have internal predecessors, (244), 99 states have call successors, (99), 6 states have call predecessors, (99), 6 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2023-11-28 20:21:43,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 442 transitions. [2023-11-28 20:21:43,501 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 442 transitions. Word has length 216 [2023-11-28 20:21:43,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:21:43,502 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 442 transitions. [2023-11-28 20:21:43,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2023-11-28 20:21:43,502 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 442 transitions. [2023-11-28 20:21:43,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2023-11-28 20:21:43,505 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:21:43,505 INFO L195 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:21:43,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-28 20:21:43,506 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:21:43,506 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:21:43,506 INFO L85 PathProgramCache]: Analyzing trace with hash -488879829, now seen corresponding path program 1 times [2023-11-28 20:21:43,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:21:43,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073328522] [2023-11-28 20:21:43,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:21:43,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:21:43,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 20:21:43,580 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 20:21:43,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 20:21:43,747 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 20:21:43,747 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-28 20:21:43,748 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-28 20:21:43,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-28 20:21:43,753 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:21:43,757 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-28 20:21:43,867 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-28 20:21:43,868 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short28 could not be translated [2023-11-28 20:21:43,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:21:43 BoogieIcfgContainer [2023-11-28 20:21:43,897 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-28 20:21:43,898 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-28 20:21:43,898 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-28 20:21:43,898 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-28 20:21:43,899 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:21:37" (3/4) ... [2023-11-28 20:21:43,900 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-28 20:21:43,901 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-28 20:21:43,902 INFO L158 Benchmark]: Toolchain (without parser) took 7549.03ms. Allocated memory was 132.1MB in the beginning and 192.9MB in the end (delta: 60.8MB). Free memory was 97.1MB in the beginning and 144.3MB in the end (delta: -47.3MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. [2023-11-28 20:21:43,902 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 132.1MB. Free memory is still 106.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-28 20:21:43,902 INFO L158 Benchmark]: CACSL2BoogieTranslator took 307.65ms. Allocated memory is still 132.1MB. Free memory was 96.6MB in the beginning and 81.3MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-28 20:21:43,903 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.33ms. Allocated memory is still 132.1MB. Free memory was 81.3MB in the beginning and 78.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-28 20:21:43,903 INFO L158 Benchmark]: Boogie Preprocessor took 48.46ms. Allocated memory is still 132.1MB. Free memory was 78.2MB in the beginning and 75.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-28 20:21:43,903 INFO L158 Benchmark]: RCFGBuilder took 529.14ms. Allocated memory is still 132.1MB. Free memory was 75.1MB in the beginning and 50.5MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-28 20:21:43,904 INFO L158 Benchmark]: TraceAbstraction took 6601.31ms. Allocated memory was 132.1MB in the beginning and 192.9MB in the end (delta: 60.8MB). Free memory was 50.0MB in the beginning and 144.3MB in the end (delta: -94.4MB). Peak memory consumption was 70.1MB. Max. memory is 16.1GB. [2023-11-28 20:21:43,904 INFO L158 Benchmark]: Witness Printer took 3.49ms. Allocated memory is still 192.9MB. Free memory is still 144.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-28 20:21:43,906 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.19ms. Allocated memory is still 132.1MB. Free memory is still 106.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 307.65ms. Allocated memory is still 132.1MB. Free memory was 96.6MB in the beginning and 81.3MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.33ms. Allocated memory is still 132.1MB. Free memory was 81.3MB in the beginning and 78.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.46ms. Allocated memory is still 132.1MB. Free memory was 78.2MB in the beginning and 75.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 529.14ms. Allocated memory is still 132.1MB. Free memory was 75.1MB in the beginning and 50.5MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6601.31ms. Allocated memory was 132.1MB in the beginning and 192.9MB in the end (delta: 60.8MB). Free memory was 50.0MB in the beginning and 144.3MB in the end (delta: -94.4MB). Peak memory consumption was 70.1MB. Max. memory is 16.1GB. * Witness Printer took 3.49ms. Allocated memory is still 192.9MB. Free memory is still 144.3MB. 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~short28 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 201, overapproximation of someUnaryDOUBLEoperation at line 39, overapproximation of someBinaryArithmeticDOUBLEoperation at line 141, overapproximation of someBinaryDOUBLEComparisonOperation at line 221, overapproximation of someBinaryArithmeticFLOAToperation at line 90. 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] double var_1_26 = 9.75; [L43] unsigned char var_1_27 = 1; [L44] signed char var_1_28 = 8; [L45] unsigned long int var_1_29 = 16; [L46] unsigned long int var_1_30 = 1; [L47] float var_1_31 = 16.6; [L48] unsigned char var_1_32 = 0; [L49] float var_1_33 = 0.25; [L50] float var_1_34 = 99.8; [L51] signed short int var_1_35 = 256; [L52] unsigned long int var_1_36 = 16; [L53] double var_1_37 = 8.5; [L54] unsigned long int var_1_38 = 3569725445; [L55] unsigned long int var_1_39 = 3551809449; [L56] unsigned long int var_1_40 = 10000000; [L57] unsigned char last_1_var_1_1 = 1; [L58] signed long int last_1_var_1_11 = -2; [L59] signed long int last_1_var_1_15 = 1000; [L60] double last_1_var_1_16 = 0.2; [L225] isInitial = 1 [L226] FCALL initially() [L227] COND TRUE 1 [L228] CALL updateLastVariables() [L215] last_1_var_1_1 = var_1_1 [L216] last_1_var_1_11 = var_1_11 [L217] last_1_var_1_15 = var_1_15 [L218] last_1_var_1_16 = var_1_16 [L228] RET updateLastVariables() [L229] CALL updateVariables() [L158] var_1_4 = __VERIFIER_nondet_uchar() [L159] 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=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, 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=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L159] 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=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L160] 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=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, 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=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L160] 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=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L161] var_1_7 = __VERIFIER_nondet_double() [L162] 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=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, 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=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L162] 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=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L163] var_1_10 = __VERIFIER_nondet_double() [L164] 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=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, 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=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L164] 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=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L165] var_1_13 = __VERIFIER_nondet_long() [L166] 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=0, 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=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, 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=0, 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=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L166] 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=0, 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=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L167] 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=0, 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=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, 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=0, 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=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L167] 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=0, 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=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L168] var_1_14 = __VERIFIER_nondet_long() [L169] 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=0, var_1_14=0, 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=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, 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=0, var_1_14=0, 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=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L169] 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=0, var_1_14=0, 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=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L170] 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=0, var_1_14=0, 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=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, 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=0, var_1_14=0, 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=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L170] 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=0, var_1_14=0, 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=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L171] var_1_17 = __VERIFIER_nondet_double() [L172] 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=0, var_1_14=0, 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=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, 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=0, var_1_14=0, 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=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L172] 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=0, var_1_14=0, 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=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L173] var_1_18 = __VERIFIER_nondet_double() [L174] 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=0, var_1_14=0, 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=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, 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=0, var_1_14=0, 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=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L174] 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=0, var_1_14=0, 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=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L175] var_1_20 = __VERIFIER_nondet_double() [L176] 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=0, var_1_14=0, 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=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, 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=0, var_1_14=0, 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=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L176] 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=0, var_1_14=0, 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=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L177] var_1_21 = __VERIFIER_nondet_double() [L178] 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=0, var_1_14=0, 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=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, 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=0, var_1_14=0, 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=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L178] 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=0, var_1_14=0, 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=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L179] var_1_22 = __VERIFIER_nondet_double() [L180] 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=0, var_1_14=0, 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=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, 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=0, var_1_14=0, 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=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L180] 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=0, var_1_14=0, 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=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L181] var_1_23 = __VERIFIER_nondet_double() [L182] 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=0, var_1_14=0, 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=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, 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=0, var_1_14=0, 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=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L182] 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=0, var_1_14=0, 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=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L183] var_1_26 = __VERIFIER_nondet_double() [L184] CALL assume_abort_if_not((var_1_26 >= -922337.2036854776000e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854776000e+12F && var_1_26 >= 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=0, var_1_14=0, 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_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, 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=0, var_1_14=0, 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_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L184] RET assume_abort_if_not((var_1_26 >= -922337.2036854776000e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854776000e+12F && var_1_26 >= 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=0, var_1_14=0, 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_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L185] CALL assume_abort_if_not(var_1_26 != 0.0F) 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=0, var_1_14=0, 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_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, 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=0, var_1_14=0, 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_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L185] RET assume_abort_if_not(var_1_26 != 0.0F) 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=0, var_1_14=0, 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_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L186] var_1_27 = __VERIFIER_nondet_uchar() [L187] CALL assume_abort_if_not(var_1_27 >= 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=0, var_1_14=0, 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_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, 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=0, var_1_14=0, 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_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L187] RET assume_abort_if_not(var_1_27 >= 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=0, var_1_14=0, 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_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L188] CALL assume_abort_if_not(var_1_27 <= 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=0, var_1_14=0, 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_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, 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=0, var_1_14=0, 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_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L188] RET assume_abort_if_not(var_1_27 <= 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=0, var_1_14=0, 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_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L189] var_1_28 = __VERIFIER_nondet_char() [L190] CALL assume_abort_if_not(var_1_28 >= -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=0, var_1_14=0, 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_27=1, var_1_28=126, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, 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=0, var_1_14=0, 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_27=1, var_1_28=126, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L190] RET assume_abort_if_not(var_1_28 >= -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=0, var_1_14=0, 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_27=1, var_1_28=126, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L191] CALL assume_abort_if_not(var_1_28 <= 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=0, var_1_14=0, 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_27=1, var_1_28=126, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, 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=0, var_1_14=0, 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_27=1, var_1_28=126, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L191] RET assume_abort_if_not(var_1_28 <= 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=0, var_1_14=0, 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_27=1, var_1_28=126, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L192] var_1_30 = __VERIFIER_nondet_ulong() [L193] CALL assume_abort_if_not(var_1_30 >= 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=0, var_1_14=0, 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_27=1, var_1_28=126, var_1_29=16, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, 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=0, var_1_14=0, 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_27=1, var_1_28=126, var_1_29=16, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L193] RET assume_abort_if_not(var_1_30 >= 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=0, var_1_14=0, 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_27=1, var_1_28=126, var_1_29=16, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L194] CALL assume_abort_if_not(var_1_30 <= 4294967294) 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=0, var_1_14=0, 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_27=1, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, 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=0, var_1_14=0, 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_27=1, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L194] RET assume_abort_if_not(var_1_30 <= 4294967294) 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=0, var_1_14=0, 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_27=1, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L195] var_1_32 = __VERIFIER_nondet_uchar() [L196] CALL assume_abort_if_not(var_1_32 >= 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=0, var_1_14=0, 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_27=1, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, 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=0, var_1_14=0, 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_27=1, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L196] RET assume_abort_if_not(var_1_32 >= 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=0, var_1_14=0, 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_27=1, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L197] CALL assume_abort_if_not(var_1_32 <= 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=0, var_1_14=0, 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_27=1, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_32=1, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, 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=0, var_1_14=0, 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_27=1, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_32=1, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L197] RET assume_abort_if_not(var_1_32 <= 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=0, var_1_14=0, 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_27=1, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_32=1, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L198] var_1_33 = __VERIFIER_nondet_float() [L199] CALL assume_abort_if_not((var_1_33 >= -922337.2036854765600e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854765600e+12F && var_1_33 >= 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=0, var_1_14=0, 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_27=1, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_32=1, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, 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=0, var_1_14=0, 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_27=1, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_32=1, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L199] RET assume_abort_if_not((var_1_33 >= -922337.2036854765600e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854765600e+12F && var_1_33 >= 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=0, var_1_14=0, 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_27=1, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_32=1, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L200] var_1_34 = __VERIFIER_nondet_float() [L201] CALL assume_abort_if_not((var_1_34 >= -922337.2036854765600e+13F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 9223372.036854765600e+12F && var_1_34 >= 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=0, var_1_14=0, 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_27=1, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_32=1, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, 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=0, var_1_14=0, 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_27=1, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_32=1, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L201] RET assume_abort_if_not((var_1_34 >= -922337.2036854765600e+13F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 9223372.036854765600e+12F && var_1_34 >= 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=0, var_1_14=0, 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_27=1, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_32=1, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L202] var_1_37 = __VERIFIER_nondet_double() [L203] CALL assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854776000e+12F && var_1_37 >= 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=0, var_1_14=0, 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_27=1, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_32=1, var_1_35=256, var_1_36=16, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, 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=0, var_1_14=0, 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_27=1, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_32=1, var_1_35=256, var_1_36=16, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L203] RET assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854776000e+12F && var_1_37 >= 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=0, var_1_14=0, 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_27=1, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_32=1, var_1_35=256, var_1_36=16, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L204] var_1_38 = __VERIFIER_nondet_ulong() [L205] CALL assume_abort_if_not(var_1_38 >= 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=0, var_1_14=0, 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_27=1, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_32=1, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=3551809449, var_1_40=10000000, 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=0, var_1_14=0, 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_27=1, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_32=1, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L205] RET assume_abort_if_not(var_1_38 >= 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=0, var_1_14=0, 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_27=1, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_32=1, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L206] CALL assume_abort_if_not(var_1_38 <= 4294967294) 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=0, var_1_14=0, 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_27=1, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_32=1, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=3551809449, var_1_40=10000000, 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=0, var_1_14=0, 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_27=1, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_32=1, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L206] RET assume_abort_if_not(var_1_38 <= 4294967294) 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=0, var_1_14=0, 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_27=1, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_32=1, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L207] var_1_39 = __VERIFIER_nondet_ulong() [L208] CALL assume_abort_if_not(var_1_39 >= 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=0, var_1_14=0, 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_27=1, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_32=1, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_40=10000000, 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=0, var_1_14=0, 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_27=1, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_32=1, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L208] RET assume_abort_if_not(var_1_39 >= 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=0, var_1_14=0, 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_27=1, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_32=1, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L209] CALL assume_abort_if_not(var_1_39 <= 4294967294) 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=0, var_1_14=0, 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_27=1, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_32=1, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_40=10000000, 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=0, var_1_14=0, 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_27=1, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_32=1, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L209] RET assume_abort_if_not(var_1_39 <= 4294967294) 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=0, var_1_14=0, 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_27=1, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_32=1, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L210] var_1_40 = __VERIFIER_nondet_ulong() [L211] CALL assume_abort_if_not(var_1_40 >= 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=0, var_1_14=0, 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_27=1, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_32=1, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, 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=0, var_1_14=0, 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_27=1, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_32=1, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L211] RET assume_abort_if_not(var_1_40 >= 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=0, var_1_14=0, 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_27=1, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_32=1, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L212] CALL assume_abort_if_not(var_1_40 <= 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=0, var_1_14=0, 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_27=1, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_32=1, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_40=0, 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=0, var_1_14=0, 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_27=1, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_32=1, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_40=0, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L212] RET assume_abort_if_not(var_1_40 <= 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=0, var_1_14=0, 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_27=1, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_32=1, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_40=0, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L229] RET updateVariables() [L230] CALL step() [L64] COND TRUE (((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20))) - var_1_21) == (var_1_22 * var_1_23) [L65] 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=0, var_1_14=0, 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_27=1, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_32=1, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_40=0, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L67] var_1_24 = var_1_19 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=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=-8, var_1_27=1, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_32=1, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_40=0, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L68] COND TRUE var_1_21 != var_1_23 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=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=-8, var_1_27=1, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_32=1, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_40=0, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L69] COND TRUE var_1_20 < (var_1_22 / var_1_26) [L70] var_1_25 = ((((4) < 0 ) ? -(4) : (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=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=4, var_1_27=1, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_32=1, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_40=0, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L81] var_1_29 = var_1_30 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=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=4, var_1_27=1, var_1_28=126, var_1_29=0, var_1_30=0, var_1_31=83/5, var_1_32=1, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_40=0, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L82] COND FALSE !(var_1_22 > var_1_23) 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=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=4, var_1_27=1, var_1_28=126, var_1_29=0, var_1_30=0, var_1_31=83/5, var_1_32=1, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_40=0, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L89] COND TRUE \read(var_1_27) [L90] var_1_31 = ((((((((var_1_33) < (var_1_34)) ? (var_1_33) : (var_1_34))) < 0 ) ? -((((var_1_33) < (var_1_34)) ? (var_1_33) : (var_1_34))) : ((((var_1_33) < (var_1_34)) ? (var_1_33) : (var_1_34))))) - 256.35f) 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=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=4, var_1_27=1, var_1_28=126, var_1_29=0, var_1_30=0, var_1_32=1, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_40=0, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L93] COND TRUE ! ((1 + var_1_24) <= var_1_19) 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=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=4, var_1_27=1, var_1_28=126, var_1_29=0, var_1_30=0, var_1_32=1, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_40=0, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L94] COND FALSE !(var_1_24 > (((((((-5) < 0 ) ? -(-5) : (-5))) < 0 ) ? -((((-5) < 0 ) ? -(-5) : (-5))) : ((((-5) < 0 ) ? -(-5) : (-5)))))) 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=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=4, var_1_27=1, var_1_28=126, var_1_29=0, var_1_30=0, var_1_32=1, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_40=0, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L98] COND FALSE !(var_1_21 < var_1_23) 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=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=4, var_1_27=1, var_1_28=126, var_1_29=0, var_1_30=0, var_1_32=1, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_40=0, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L105] 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=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=4, var_1_27=1, var_1_28=126, var_1_29=0, var_1_30=0, var_1_32=1, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_40=0, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L106] COND TRUE ((((last_1_var_1_16) > (49.75)) ? (last_1_var_1_16) : (49.75))) > last_1_var_1_16 [L107] 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=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=4, var_1_27=1, var_1_28=126, var_1_29=0, var_1_30=0, var_1_32=1, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_40=0, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L112] 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=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=4, var_1_27=1, var_1_28=126, var_1_29=0, var_1_30=0, var_1_32=1, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_40=0, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L113] COND TRUE (last_1_var_1_11 / ((((-16) < 0 ) ? -(-16) : (-16)))) >= stepLocal_0 [L114] 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=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=4, var_1_27=1, var_1_28=126, var_1_29=0, var_1_30=0, var_1_32=1, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_40=0, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L116] signed long int stepLocal_2 = var_1_11; [L117] 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=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=4, var_1_27=1, var_1_28=126, var_1_29=0, var_1_30=0, var_1_32=1, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_40=0, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L118] 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=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=4, var_1_27=1, var_1_28=126, var_1_29=0, var_1_30=0, var_1_32=1, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_40=0, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L119] 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=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=4, var_1_27=1, var_1_28=126, var_1_29=0, var_1_30=0, var_1_32=1, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_40=0, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L120] COND TRUE stepLocal_1 || (var_1_11 < var_1_11) [L121] 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=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=4, var_1_27=1, var_1_28=126, var_1_29=0, var_1_30=0, var_1_32=1, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_40=0, var_1_4=1, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=5/4] [L127] 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=0, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=4, var_1_27=1, var_1_28=126, var_1_29=0, var_1_30=0, var_1_32=1, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_40=0, var_1_4=1, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=5/4] [L127] COND FALSE !((- var_1_11) > (var_1_11 & var_1_13)) [L138] 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=0, var_1_14=0, var_1_15=0, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=4, var_1_27=1, var_1_28=126, var_1_29=0, var_1_30=0, var_1_32=1, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_40=0, var_1_4=1, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=5/4] [L140] COND TRUE ((((var_1_5) < (last_1_var_1_16)) ? (var_1_5) : (last_1_var_1_16))) >= var_1_7 [L141] 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=0, var_1_14=0, var_1_15=0, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=4, var_1_27=1, var_1_28=126, var_1_29=0, var_1_30=0, var_1_32=1, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_40=0, var_1_4=1, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=5/4] [L145] COND FALSE !(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=0, var_1_14=0, var_1_15=0, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=4, var_1_27=1, var_1_28=126, var_1_29=0, var_1_30=0, var_1_32=1, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_40=0, var_1_4=1, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=5/4] [L150] COND TRUE var_1_16 > var_1_7 [L151] var_1_8 = 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=100000000000005, var_1_11=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=4, var_1_27=1, var_1_28=126, var_1_29=0, var_1_30=0, var_1_32=1, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_40=0, var_1_4=1, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=100000000000005] [L230] RET step() [L231] CALL, EXPR property() [L221] 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=100000000000005, var_1_11=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=4, var_1_27=1, var_1_28=126, var_1_29=0, var_1_30=0, var_1_32=1, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_40=0, var_1_4=1, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=100000000000005] [L221-L222] 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))) ; [L231] RET, EXPR property() [L231] 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=100000000000005, var_1_11=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=4, var_1_27=1, var_1_28=126, var_1_29=0, var_1_30=0, var_1_32=1, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_40=0, var_1_4=1, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=100000000000005] [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=100000000000005, var_1_11=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=4, var_1_27=1, var_1_28=126, var_1_29=0, var_1_30=0, var_1_32=1, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=2147483647, var_1_40=0, var_1_4=1, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=100000000000005] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 104 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.4s, OverallIterations: 8, TraceHistogramMax: 33, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1116 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1115 mSDsluCounter, 2333 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1167 mSDsCounter, 340 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 477 IncrementalHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 340 mSolverCounterUnsat, 1166 mSDtfsCounter, 477 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 965 GetRequests, 934 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=290occurred in iteration=6, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 7 MinimizatonAttempts, 170 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 1931 NumberOfCodeBlocks, 1931 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1920 ConstructedInterpolants, 0 QuantifiedInterpolants, 5552 SizeOfPredicates, 4 NumberOfNonLiveVariables, 486 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 18720/19008 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-28 20:21:43,929 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-30.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 33c1f0c79da133a8e85d7b9730efd8560ba4fbfcdfa2f486932f30e8596806cc --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-28 20:21:45,899 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-28 20:21:45,970 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-28 20:21:45,986 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-28 20:21:45,987 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-28 20:21:46,018 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-28 20:21:46,019 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-28 20:21:46,019 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-28 20:21:46,020 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-28 20:21:46,021 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-28 20:21:46,022 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-28 20:21:46,022 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-28 20:21:46,023 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-28 20:21:46,024 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-28 20:21:46,025 INFO L153 SettingsManager]: * Use SBE=true [2023-11-28 20:21:46,025 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-28 20:21:46,026 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-28 20:21:46,027 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-28 20:21:46,027 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-28 20:21:46,028 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-28 20:21:46,028 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-28 20:21:46,029 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-28 20:21:46,030 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-28 20:21:46,030 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-28 20:21:46,031 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-28 20:21:46,031 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-28 20:21:46,032 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-28 20:21:46,032 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-28 20:21:46,033 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-28 20:21:46,033 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-28 20:21:46,034 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-28 20:21:46,034 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-28 20:21:46,034 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-28 20:21:46,035 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:21:46,035 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-28 20:21:46,036 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-28 20:21:46,036 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-28 20:21:46,036 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-28 20:21:46,036 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-28 20:21:46,037 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-28 20:21:46,037 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-28 20:21:46,038 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-28 20:21:46,038 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-28 20:21:46,038 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-28 20:21:46,038 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-28 20:21:46,039 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_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 33c1f0c79da133a8e85d7b9730efd8560ba4fbfcdfa2f486932f30e8596806cc [2023-11-28 20:21:46,387 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-28 20:21:46,410 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-28 20:21:46,413 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-28 20:21:46,414 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-28 20:21:46,415 INFO L274 PluginConnector]: CDTParser initialized [2023-11-28 20:21:46,417 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-30.i [2023-11-28 20:21:49,290 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-28 20:21:49,529 INFO L384 CDTParser]: Found 1 translation units. [2023-11-28 20:21:49,530 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-30.i [2023-11-28 20:21:49,542 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya/data/b0fb47495/b079aff5983a4b51a1748d3855b240f4/FLAG45ee6c8d0 [2023-11-28 20:21:49,559 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya/data/b0fb47495/b079aff5983a4b51a1748d3855b240f4 [2023-11-28 20:21:49,562 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-28 20:21:49,563 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-28 20:21:49,565 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-28 20:21:49,565 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-28 20:21:49,571 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-28 20:21:49,572 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:21:49" (1/1) ... [2023-11-28 20:21:49,573 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cc9c088 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:49, skipping insertion in model container [2023-11-28 20:21:49,574 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:21:49" (1/1) ... [2023-11-28 20:21:49,618 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 20:21:49,777 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_fdeae51d-7183-48f8-b119-f7c3715a12cd/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-30.i[915,928] [2023-11-28 20:21:49,845 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:21:49,865 INFO L202 MainTranslator]: Completed pre-run [2023-11-28 20:21:49,879 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_fdeae51d-7183-48f8-b119-f7c3715a12cd/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-30.i[915,928] [2023-11-28 20:21:49,919 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:21:49,940 INFO L206 MainTranslator]: Completed translation [2023-11-28 20:21:49,941 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:49 WrapperNode [2023-11-28 20:21:49,941 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-28 20:21:49,943 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-28 20:21:49,943 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-28 20:21:49,943 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-28 20:21:49,952 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:49" (1/1) ... [2023-11-28 20:21:49,969 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:49" (1/1) ... [2023-11-28 20:21:50,002 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 230 [2023-11-28 20:21:50,003 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-28 20:21:50,004 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-28 20:21:50,004 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-28 20:21:50,030 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-28 20:21:50,043 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:49" (1/1) ... [2023-11-28 20:21:50,043 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:49" (1/1) ... [2023-11-28 20:21:50,076 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:49" (1/1) ... [2023-11-28 20:21:50,093 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-28 20:21:50,093 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:49" (1/1) ... [2023-11-28 20:21:50,094 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:49" (1/1) ... [2023-11-28 20:21:50,105 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:49" (1/1) ... [2023-11-28 20:21:50,110 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:49" (1/1) ... [2023-11-28 20:21:50,113 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:49" (1/1) ... [2023-11-28 20:21:50,116 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:49" (1/1) ... [2023-11-28 20:21:50,121 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-28 20:21:50,122 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-28 20:21:50,123 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-28 20:21:50,123 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-28 20:21:50,124 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:49" (1/1) ... [2023-11-28 20:21:50,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:21:50,141 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:21:50,152 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-28 20:21:50,155 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-28 20:21:50,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-28 20:21:50,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-28 20:21:50,185 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-28 20:21:50,186 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-28 20:21:50,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-28 20:21:50,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-28 20:21:50,286 INFO L241 CfgBuilder]: Building ICFG [2023-11-28 20:21:50,289 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-28 20:22:12,596 INFO L282 CfgBuilder]: Performing block encoding [2023-11-28 20:22:12,640 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-28 20:22:12,640 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-28 20:22:12,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:22:12 BoogieIcfgContainer [2023-11-28 20:22:12,641 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-28 20:22:12,643 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-28 20:22:12,644 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-28 20:22:12,646 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-28 20:22:12,646 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:21:49" (1/3) ... [2023-11-28 20:22:12,647 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41eb36a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:22:12, skipping insertion in model container [2023-11-28 20:22:12,647 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:49" (2/3) ... [2023-11-28 20:22:12,648 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41eb36a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:22:12, skipping insertion in model container [2023-11-28 20:22:12,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:22:12" (3/3) ... [2023-11-28 20:22:12,649 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-50_file-30.i [2023-11-28 20:22:12,664 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-28 20:22:12,664 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-28 20:22:12,707 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-28 20:22:12,712 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;@4eb0b3c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-28 20:22:12,713 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-28 20:22:12,716 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 61 states have (on average 1.4918032786885247) internal successors, (91), 62 states have internal predecessors, (91), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2023-11-28 20:22:12,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2023-11-28 20:22:12,732 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:22:12,733 INFO L195 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:22:12,733 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:22:12,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:22:12,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1303543091, now seen corresponding path program 1 times [2023-11-28 20:22:12,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:22:12,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1066760532] [2023-11-28 20:22:12,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:12,753 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:22:12,753 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:22:12,754 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 20:22:12,755 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-28 20:22:14,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:14,397 INFO L262 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-28 20:22:14,415 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:22:14,468 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 892 proven. 0 refuted. 0 times theorem prover too weak. 1220 trivial. 0 not checked. [2023-11-28 20:22:14,468 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:22:14,469 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:22:14,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1066760532] [2023-11-28 20:22:14,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1066760532] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:22:14,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:22:14,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:22:14,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181950842] [2023-11-28 20:22:14,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:22:14,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-28 20:22:14,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:22:14,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-28 20:22:14,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-28 20:22:14,512 INFO L87 Difference]: Start difference. First operand has 97 states, 61 states have (on average 1.4918032786885247) internal successors, (91), 62 states have internal predecessors, (91), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2023-11-28 20:22:16,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:22:20,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:22:20,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:22:20,859 INFO L93 Difference]: Finished difference Result 191 states and 345 transitions. [2023-11-28 20:22:20,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-28 20:22:20,910 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 210 [2023-11-28 20:22:20,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:22:20,918 INFO L225 Difference]: With dead ends: 191 [2023-11-28 20:22:20,918 INFO L226 Difference]: Without dead ends: 95 [2023-11-28 20:22:20,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-28 20:22:20,925 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2023-11-28 20:22:20,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 149 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 6.3s Time] [2023-11-28 20:22:20,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-11-28 20:22:20,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2023-11-28 20:22:20,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 60 states have internal predecessors, (86), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2023-11-28 20:22:20,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 152 transitions. [2023-11-28 20:22:20,973 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 152 transitions. Word has length 210 [2023-11-28 20:22:20,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:22:20,974 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 152 transitions. [2023-11-28 20:22:20,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2023-11-28 20:22:20,975 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 152 transitions. [2023-11-28 20:22:20,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2023-11-28 20:22:20,980 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:22:20,981 INFO L195 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:22:21,011 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-28 20:22:21,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:22:21,182 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:22:21,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:22:21,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1872049577, now seen corresponding path program 1 times [2023-11-28 20:22:21,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:22:21,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1114184801] [2023-11-28 20:22:21,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:21,184 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:22:21,184 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:22:21,185 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 20:22:21,186 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-28 20:22:22,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:22,819 INFO L262 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-28 20:22:22,828 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:22:23,122 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2023-11-28 20:22:23,123 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:22:23,123 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:22:23,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1114184801] [2023-11-28 20:22:23,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1114184801] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:22:23,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:22:23,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 20:22:23,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630699367] [2023-11-28 20:22:23,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:22:23,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 20:22:23,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:22:23,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 20:22:23,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-28 20:22:23,129 INFO L87 Difference]: Start difference. First operand 95 states and 152 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2023-11-28 20:22:27,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:22:31,590 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-28 20:22:35,593 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-28 20:22:39,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.47s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:22:40,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:22:41,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:22:41,010 INFO L93 Difference]: Finished difference Result 284 states and 455 transitions. [2023-11-28 20:22:41,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 20:22:41,011 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 210 [2023-11-28 20:22:41,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:22:41,015 INFO L225 Difference]: With dead ends: 284 [2023-11-28 20:22:41,015 INFO L226 Difference]: Without dead ends: 190 [2023-11-28 20:22:41,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-28 20:22:41,019 INFO L413 NwaCegarLoop]: 275 mSDtfsCounter, 218 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 68 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.8s IncrementalHoareTripleChecker+Time [2023-11-28 20:22:41,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 420 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 14 Invalid, 3 Unknown, 0 Unchecked, 17.8s Time] [2023-11-28 20:22:41,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2023-11-28 20:22:41,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 187. [2023-11-28 20:22:41,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 118 states have (on average 1.423728813559322) internal successors, (168), 118 states have internal predecessors, (168), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2023-11-28 20:22:41,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 300 transitions. [2023-11-28 20:22:41,075 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 300 transitions. Word has length 210 [2023-11-28 20:22:41,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:22:41,077 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 300 transitions. [2023-11-28 20:22:41,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2023-11-28 20:22:41,077 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 300 transitions. [2023-11-28 20:22:41,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2023-11-28 20:22:41,082 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:22:41,082 INFO L195 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:22:41,110 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-28 20:22:41,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:22:41,287 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:22:41,287 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:22:41,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1449347751, now seen corresponding path program 1 times [2023-11-28 20:22:41,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:22:41,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [872291566] [2023-11-28 20:22:41,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:41,288 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:22:41,289 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:22:41,289 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 20:22:41,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-28 20:22:42,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:42,894 INFO L262 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-28 20:22:42,901 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:22:45,019 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2023-11-28 20:22:45,020 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:22:45,020 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:22:45,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [872291566] [2023-11-28 20:22:45,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [872291566] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:22:45,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:22:45,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 20:22:45,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887910823] [2023-11-28 20:22:45,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:22:45,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 20:22:45,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:22:45,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 20:22:45,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-28 20:22:45,024 INFO L87 Difference]: Start difference. First operand 187 states and 300 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2023-11-28 20:22:50,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:22:53,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.77s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:22:57,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:23:01,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.28s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:23:06,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:23:10,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:23:10,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:23:10,288 INFO L93 Difference]: Finished difference Result 437 states and 695 transitions. [2023-11-28 20:23:10,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 20:23:10,289 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 210 [2023-11-28 20:23:10,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:23:10,294 INFO L225 Difference]: With dead ends: 437 [2023-11-28 20:23:10,294 INFO L226 Difference]: Without dead ends: 251 [2023-11-28 20:23:10,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-28 20:23:10,296 INFO L413 NwaCegarLoop]: 291 mSDtfsCounter, 142 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.2s IncrementalHoareTripleChecker+Time [2023-11-28 20:23:10,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 512 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 4 Unknown, 0 Unchecked, 25.2s Time] [2023-11-28 20:23:10,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2023-11-28 20:23:10,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 95. [2023-11-28 20:23:10,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 60 states have (on average 1.4) internal successors, (84), 60 states have internal predecessors, (84), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2023-11-28 20:23:10,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 150 transitions. [2023-11-28 20:23:10,334 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 150 transitions. Word has length 210 [2023-11-28 20:23:10,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:23:10,335 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 150 transitions. [2023-11-28 20:23:10,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2023-11-28 20:23:10,335 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 150 transitions. [2023-11-28 20:23:10,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2023-11-28 20:23:10,339 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:23:10,339 INFO L195 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:23:10,370 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-28 20:23:10,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:23:10,540 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:23:10,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:23:10,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1592935984, now seen corresponding path program 1 times [2023-11-28 20:23:10,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:23:10,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [539324098] [2023-11-28 20:23:10,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:23:10,541 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:23:10,542 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:23:10,542 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 20:23:10,544 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-28 20:23:11,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:23:12,002 INFO L262 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-28 20:23:12,007 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:23:13,798 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2023-11-28 20:23:13,798 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:23:13,799 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:23:13,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [539324098] [2023-11-28 20:23:13,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [539324098] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:23:13,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:23:13,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 20:23:13,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547264738] [2023-11-28 20:23:13,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:23:13,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 20:23:13,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:23:13,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 20:23:13,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 20:23:13,802 INFO L87 Difference]: Start difference. First operand 95 states and 150 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2023-11-28 20:23:18,407 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-28 20:23:21,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.38s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:23:27,627 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-28 20:23:27,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:23:27,627 INFO L93 Difference]: Finished difference Result 300 states and 475 transitions. [2023-11-28 20:23:27,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 20:23:27,678 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 211 [2023-11-28 20:23:27,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:23:27,681 INFO L225 Difference]: With dead ends: 300 [2023-11-28 20:23:27,681 INFO L226 Difference]: Without dead ends: 206 [2023-11-28 20:23:27,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 208 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-28 20:23:27,682 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 131 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 69 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.7s IncrementalHoareTripleChecker+Time [2023-11-28 20:23:27,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 446 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 18 Invalid, 2 Unknown, 0 Unchecked, 13.7s Time] [2023-11-28 20:23:27,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2023-11-28 20:23:27,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 187. [2023-11-28 20:23:27,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 118 states have (on average 1.38135593220339) internal successors, (163), 118 states have internal predecessors, (163), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2023-11-28 20:23:27,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 295 transitions. [2023-11-28 20:23:27,734 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 295 transitions. Word has length 211 [2023-11-28 20:23:27,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:23:27,735 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 295 transitions. [2023-11-28 20:23:27,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2023-11-28 20:23:27,736 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 295 transitions. [2023-11-28 20:23:27,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2023-11-28 20:23:27,738 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:23:27,738 INFO L195 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:23:27,764 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-28 20:23:27,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:23:27,939 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:23:27,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:23:27,940 INFO L85 PathProgramCache]: Analyzing trace with hash 389375163, now seen corresponding path program 1 times [2023-11-28 20:23:27,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:23:27,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1404967123] [2023-11-28 20:23:27,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:23:27,940 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:23:27,941 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:23:27,941 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 20:23:27,942 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-28 20:23:29,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:23:29,433 INFO L262 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-28 20:23:29,437 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:23:33,073 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 66 proven. 186 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2023-11-28 20:23:33,074 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:23:34,145 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2023-11-28 20:23:34,146 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:23:34,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1404967123] [2023-11-28 20:23:34,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1404967123] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:23:34,146 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 20:23:34,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2023-11-28 20:23:34,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583261219] [2023-11-28 20:23:34,147 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 20:23:34,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-28 20:23:34,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:23:34,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-28 20:23:34,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-11-28 20:23:34,150 INFO L87 Difference]: Start difference. First operand 187 states and 295 transitions. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 3 states have call successors, (65), 3 states have call predecessors, (65), 5 states have return successors, (66), 2 states have call predecessors, (66), 3 states have call successors, (66) [2023-11-28 20:23:40,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:23:44,162 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-28 20:23:46,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:23:46,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:23:46,607 INFO L93 Difference]: Finished difference Result 302 states and 461 transitions. [2023-11-28 20:23:46,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-28 20:23:46,608 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 3 states have call successors, (65), 3 states have call predecessors, (65), 5 states have return successors, (66), 2 states have call predecessors, (66), 3 states have call successors, (66) Word has length 212 [2023-11-28 20:23:46,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:23:46,610 INFO L225 Difference]: With dead ends: 302 [2023-11-28 20:23:46,610 INFO L226 Difference]: Without dead ends: 208 [2023-11-28 20:23:46,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 413 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=142, Invalid=278, Unknown=0, NotChecked=0, Total=420 [2023-11-28 20:23:46,612 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 128 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 74 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.9s IncrementalHoareTripleChecker+Time [2023-11-28 20:23:46,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 261 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 203 Invalid, 2 Unknown, 0 Unchecked, 11.9s Time] [2023-11-28 20:23:46,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2023-11-28 20:23:46,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 203. [2023-11-28 20:23:46,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 130 states have (on average 1.3307692307692307) internal successors, (173), 130 states have internal predecessors, (173), 66 states have call successors, (66), 6 states have call predecessors, (66), 6 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2023-11-28 20:23:46,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 305 transitions. [2023-11-28 20:23:46,659 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 305 transitions. Word has length 212 [2023-11-28 20:23:46,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:23:46,660 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 305 transitions. [2023-11-28 20:23:46,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 3 states have call successors, (65), 3 states have call predecessors, (65), 5 states have return successors, (66), 2 states have call predecessors, (66), 3 states have call successors, (66) [2023-11-28 20:23:46,661 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 305 transitions. [2023-11-28 20:23:46,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2023-11-28 20:23:46,662 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:23:46,662 INFO L195 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:23:46,686 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-11-28 20:23:46,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:23:46,866 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:23:46,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:23:46,867 INFO L85 PathProgramCache]: Analyzing trace with hash 2044346202, now seen corresponding path program 1 times [2023-11-28 20:23:46,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:23:46,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1618370204] [2023-11-28 20:23:46,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:23:46,867 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:23:46,867 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:23:46,868 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 20:23:46,869 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-28 20:23:48,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:23:48,336 INFO L262 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-28 20:23:48,340 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:23:50,244 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2023-11-28 20:23:50,244 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:23:50,244 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:23:50,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1618370204] [2023-11-28 20:23:50,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1618370204] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:23:50,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:23:50,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 20:23:50,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293096484] [2023-11-28 20:23:50,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:23:50,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 20:23:50,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:23:50,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 20:23:50,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-28 20:23:50,247 INFO L87 Difference]: Start difference. First operand 203 states and 305 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2023-11-28 20:23:55,726 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-28 20:24:01,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:24:01,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:24:01,456 INFO L93 Difference]: Finished difference Result 514 states and 770 transitions. [2023-11-28 20:24:01,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 20:24:01,457 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 213 [2023-11-28 20:24:01,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:24:01,461 INFO L225 Difference]: With dead ends: 514 [2023-11-28 20:24:01,461 INFO L226 Difference]: Without dead ends: 312 [2023-11-28 20:24:01,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-28 20:24:01,463 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 138 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 68 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.1s IncrementalHoareTripleChecker+Time [2023-11-28 20:24:01,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 492 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 106 Invalid, 2 Unknown, 0 Unchecked, 11.1s Time] [2023-11-28 20:24:01,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2023-11-28 20:24:01,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 288. [2023-11-28 20:24:01,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 179 states have (on average 1.2905027932960893) internal successors, (231), 179 states have internal predecessors, (231), 99 states have call successors, (99), 9 states have call predecessors, (99), 9 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2023-11-28 20:24:01,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 429 transitions. [2023-11-28 20:24:01,525 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 429 transitions. Word has length 213 [2023-11-28 20:24:01,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:24:01,526 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 429 transitions. [2023-11-28 20:24:01,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2023-11-28 20:24:01,526 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 429 transitions. [2023-11-28 20:24:01,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2023-11-28 20:24:01,527 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:24:01,528 INFO L195 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:24:01,550 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-11-28 20:24:01,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:24:01,728 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:24:01,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:24:01,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1343281624, now seen corresponding path program 1 times [2023-11-28 20:24:01,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:24:01,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1033191054] [2023-11-28 20:24:01,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:24:01,730 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:24:01,730 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:24:01,730 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 20:24:01,731 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-28 20:24:03,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:24:03,271 INFO L262 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-28 20:24:03,274 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:24:03,324 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2023-11-28 20:24:03,324 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:24:03,324 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:24:03,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1033191054] [2023-11-28 20:24:03,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1033191054] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:24:03,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:24:03,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 20:24:03,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648930100] [2023-11-28 20:24:03,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:24:03,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:24:03,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:24:03,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:24:03,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:24:03,327 INFO L87 Difference]: Start difference. First operand 288 states and 429 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2023-11-28 20:24:06,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.89s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:24:10,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:24:10,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:24:10,568 INFO L93 Difference]: Finished difference Result 492 states and 734 transitions. [2023-11-28 20:24:10,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:24:10,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 213 [2023-11-28 20:24:10,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:24:10,572 INFO L225 Difference]: With dead ends: 492 [2023-11-28 20:24:10,572 INFO L226 Difference]: Without dead ends: 288 [2023-11-28 20:24:10,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:24:10,573 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 16 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2023-11-28 20:24:10,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 260 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2023-11-28 20:24:10,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2023-11-28 20:24:10,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2023-11-28 20:24:10,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 179 states have (on average 1.2793296089385475) internal successors, (229), 179 states have internal predecessors, (229), 99 states have call successors, (99), 9 states have call predecessors, (99), 9 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2023-11-28 20:24:10,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 427 transitions. [2023-11-28 20:24:10,643 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 427 transitions. Word has length 213 [2023-11-28 20:24:10,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:24:10,644 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 427 transitions. [2023-11-28 20:24:10,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2023-11-28 20:24:10,644 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 427 transitions. [2023-11-28 20:24:10,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2023-11-28 20:24:10,646 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:24:10,647 INFO L195 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:24:10,676 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-11-28 20:24:10,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:24:10,849 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:24:10,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:24:10,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1529298426, now seen corresponding path program 1 times [2023-11-28 20:24:10,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:24:10,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [487636910] [2023-11-28 20:24:10,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:24:10,850 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:24:10,850 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:24:10,851 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 20:24:10,852 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdeae51d-7183-48f8-b119-f7c3715a12cd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-28 20:24:12,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:24:12,358 INFO L262 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-28 20:24:12,363 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:25:21,771 WARN L293 SmtUtils]: Spent 11.47s on a formula simplification that was a NOOP. DAG size: 73 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-28 20:26:04,176 WARN L293 SmtUtils]: Spent 13.13s on a formula simplification that was a NOOP. DAG size: 77 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-28 20:26:16,607 WARN L293 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:26:24,737 WARN L293 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:26:32,902 WARN L293 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:26:38,897 WARN L293 SmtUtils]: Spent 5.99s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:26:47,132 WARN L293 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:26:55,328 WARN L293 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:27:02,915 WARN L293 SmtUtils]: Spent 7.59s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:27:11,117 WARN L293 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:27:19,315 WARN L293 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:27:26,477 WARN L293 SmtUtils]: Spent 7.16s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:27:33,813 WARN L293 SmtUtils]: Spent 7.34s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:27:42,024 WARN L293 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:27:53,045 WARN L293 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:28:02,327 WARN L293 SmtUtils]: Spent 5.12s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:28:10,537 WARN L293 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:28:22,656 WARN L293 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:28:29,122 WARN L293 SmtUtils]: Spent 6.47s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:28:37,327 WARN L293 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:28:51,923 WARN L293 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:29:00,131 WARN L293 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:29:05,238 WARN L293 SmtUtils]: Spent 5.11s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:29:11,649 WARN L293 SmtUtils]: Spent 6.41s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:29:15,707 WARN L854 $PredicateComparison]: unable to prove that (and (= c_~var_1_4~0 c_~var_1_1~0) (fp.lt ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 211.0 20.0))) c_~var_1_16~0) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq c_~var_1_10~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse0))) (fp.leq c_~var_1_10~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse1)))) (and (fp.geq c_~var_1_10~0 ((_ to_fp 11 53) c_currentRoundingMode .cse1)) (fp.leq c_~var_1_10~0 ((_ to_fp 11 53) c_currentRoundingMode .cse0))))) (= c_~var_1_15~0 c_~var_1_13~0) (= (_ bv1 8) c_~last_1_var_1_1~0) (not (bvsgt (bvneg c_~var_1_11~0) (bvand c_~var_1_13~0 c_~var_1_11~0))) (let ((.cse2 (fp.gt c_~var_1_7~0 c_~var_1_10~0))) (or (and .cse2 (= c_~var_1_7~0 c_~var_1_8~0)) (and (not .cse2) (= c_~var_1_8~0 c_~var_1_10~0)))) (= c_~var_1_16~0 (fp.add c_currentRoundingMode c_~var_1_17~0 (fp.add c_currentRoundingMode c_~var_1_18~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 67.0 4.0))))) (= c_~var_1_7~0 c_~var_1_5~0) (fp.geq c_~last_1_var_1_16~0 c_~var_1_7~0) (fp.gt c_~var_1_16~0 (fp.mul c_currentRoundingMode c_~var_1_7~0 c_~var_1_16~0)) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse7 (bvadd (_ bv4294967291 32) c_~var_1_13~0))) (let ((.cse5 (bvsgt .cse7 c_~var_1_14~0)) (.cse3 (= c_~last_1_var_1_15~0 c_~var_1_11~0))) (or (and (let ((.cse4 (bvslt c_~last_1_var_1_15~0 c_~var_1_14~0))) (or (and .cse3 .cse4) (and (= c_~var_1_11~0 c_~var_1_14~0) (not .cse4)))) (not .cse5)) (and .cse5 (let ((.cse6 (bvslt c_~last_1_var_1_15~0 .cse7))) (or (and (not .cse6) (= c_~var_1_13~0 (bvadd c_~var_1_11~0 (_ bv5 32)))) (and .cse3 .cse6)))))))) is different from false