./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-63.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_b9b9458f-77e3-47d8-a219-4c9da3e3ce02/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b9458f-77e3-47d8-a219-4c9da3e3ce02/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_b9b9458f-77e3-47d8-a219-4c9da3e3ce02/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b9458f-77e3-47d8-a219-4c9da3e3ce02/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-63.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b9458f-77e3-47d8-a219-4c9da3e3ce02/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_b9b9458f-77e3-47d8-a219-4c9da3e3ce02/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 e0b44752a13f23ceb23e783beee65a99026269ecd792e26d1e2b1859d51a527d --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 01:34:04,009 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 01:34:04,079 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b9458f-77e3-47d8-a219-4c9da3e3ce02/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 01:34:04,084 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 01:34:04,085 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 01:34:04,110 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 01:34:04,110 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 01:34:04,111 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 01:34:04,112 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 01:34:04,112 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 01:34:04,113 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 01:34:04,113 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 01:34:04,114 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 01:34:04,115 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 01:34:04,115 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 01:34:04,116 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 01:34:04,117 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 01:34:04,117 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 01:34:04,118 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 01:34:04,118 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 01:34:04,119 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 01:34:04,122 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 01:34:04,122 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 01:34:04,123 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 01:34:04,123 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 01:34:04,124 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 01:34:04,124 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 01:34:04,124 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 01:34:04,125 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 01:34:04,125 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 01:34:04,125 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 01:34:04,125 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:34:04,126 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 01:34:04,127 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 01:34:04,127 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 01:34:04,127 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 01:34:04,128 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 01:34:04,128 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 01:34:04,129 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 01:34:04,129 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 01:34:04,129 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 01:34:04,129 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 01:34:04,130 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_b9b9458f-77e3-47d8-a219-4c9da3e3ce02/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_b9b9458f-77e3-47d8-a219-4c9da3e3ce02/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 -> e0b44752a13f23ceb23e783beee65a99026269ecd792e26d1e2b1859d51a527d [2023-11-29 01:34:04,339 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 01:34:04,363 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 01:34:04,366 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 01:34:04,367 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 01:34:04,368 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 01:34:04,369 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b9458f-77e3-47d8-a219-4c9da3e3ce02/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-63.i [2023-11-29 01:34:07,232 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 01:34:07,418 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 01:34:07,419 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b9458f-77e3-47d8-a219-4c9da3e3ce02/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-63.i [2023-11-29 01:34:07,430 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b9458f-77e3-47d8-a219-4c9da3e3ce02/bin/uautomizer-verify-BQ2R08f2Ya/data/9830f6758/7623714aad5f412aa86865ad51c5b31e/FLAG1ccf9a5ea [2023-11-29 01:34:07,444 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b9458f-77e3-47d8-a219-4c9da3e3ce02/bin/uautomizer-verify-BQ2R08f2Ya/data/9830f6758/7623714aad5f412aa86865ad51c5b31e [2023-11-29 01:34:07,447 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 01:34:07,449 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 01:34:07,450 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 01:34:07,450 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 01:34:07,455 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 01:34:07,456 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:34:07" (1/1) ... [2023-11-29 01:34:07,457 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5aed8221 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:34:07, skipping insertion in model container [2023-11-29 01:34:07,457 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:34:07" (1/1) ... [2023-11-29 01:34:07,496 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 01:34:07,628 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_b9b9458f-77e3-47d8-a219-4c9da3e3ce02/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-63.i[919,932] [2023-11-29 01:34:07,700 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:34:07,724 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 01:34:07,735 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_b9b9458f-77e3-47d8-a219-4c9da3e3ce02/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-63.i[919,932] [2023-11-29 01:34:07,777 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:34:07,794 INFO L206 MainTranslator]: Completed translation [2023-11-29 01:34:07,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:34:07 WrapperNode [2023-11-29 01:34:07,795 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 01:34:07,795 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 01:34:07,796 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 01:34:07,796 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 01:34:07,801 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:34:07" (1/1) ... [2023-11-29 01:34:07,817 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:34:07" (1/1) ... [2023-11-29 01:34:07,862 INFO L138 Inliner]: procedures = 26, calls = 53, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 300 [2023-11-29 01:34:07,863 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 01:34:07,863 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 01:34:07,864 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 01:34:07,864 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 01:34:07,873 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:34:07" (1/1) ... [2023-11-29 01:34:07,874 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:34:07" (1/1) ... [2023-11-29 01:34:07,879 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:34:07" (1/1) ... [2023-11-29 01:34:07,901 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-29 01:34:07,902 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:34:07" (1/1) ... [2023-11-29 01:34:07,902 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:34:07" (1/1) ... [2023-11-29 01:34:07,917 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:34:07" (1/1) ... [2023-11-29 01:34:07,922 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:34:07" (1/1) ... [2023-11-29 01:34:07,927 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:34:07" (1/1) ... [2023-11-29 01:34:07,931 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:34:07" (1/1) ... [2023-11-29 01:34:07,937 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 01:34:07,938 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 01:34:07,938 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 01:34:07,938 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 01:34:07,939 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:34:07" (1/1) ... [2023-11-29 01:34:07,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:34:07,956 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b9458f-77e3-47d8-a219-4c9da3e3ce02/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:34:07,969 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b9458f-77e3-47d8-a219-4c9da3e3ce02/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 01:34:07,972 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b9458f-77e3-47d8-a219-4c9da3e3ce02/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 01:34:08,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 01:34:08,004 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 01:34:08,004 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 01:34:08,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 01:34:08,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 01:34:08,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 01:34:08,097 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 01:34:08,099 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 01:34:08,574 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 01:34:08,617 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 01:34:08,618 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 01:34:08,619 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:34:08 BoogieIcfgContainer [2023-11-29 01:34:08,619 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 01:34:08,621 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 01:34:08,622 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 01:34:08,624 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 01:34:08,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 01:34:07" (1/3) ... [2023-11-29 01:34:08,625 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51858720 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:34:08, skipping insertion in model container [2023-11-29 01:34:08,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:34:07" (2/3) ... [2023-11-29 01:34:08,626 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51858720 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:34:08, skipping insertion in model container [2023-11-29 01:34:08,626 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:34:08" (3/3) ... [2023-11-29 01:34:08,627 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-cn_file-63.i [2023-11-29 01:34:08,641 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 01:34:08,642 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 01:34:08,687 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 01:34:08,694 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;@7f1ac671, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 01:34:08,694 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 01:34:08,699 INFO L276 IsEmpty]: Start isEmpty. Operand has 116 states, 73 states have (on average 1.4794520547945205) internal successors, (108), 74 states have internal predecessors, (108), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-11-29 01:34:08,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2023-11-29 01:34:08,716 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:34:08,717 INFO L195 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 01:34:08,717 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:34:08,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:34:08,722 INFO L85 PathProgramCache]: Analyzing trace with hash -819118899, now seen corresponding path program 1 times [2023-11-29 01:34:08,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:34:08,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732340305] [2023-11-29 01:34:08,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:34:08,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:34:08,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:09,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:34:09,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:09,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 01:34:09,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:09,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 01:34:09,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:09,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 01:34:09,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:09,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 01:34:09,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:09,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 01:34:09,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:09,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:34:09,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:09,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 01:34:09,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:09,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 01:34:09,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:09,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 01:34:09,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:09,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 01:34:09,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:09,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 01:34:09,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:09,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 01:34:09,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:09,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 01:34:09,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:09,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 01:34:09,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:09,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 01:34:09,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:09,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 01:34:09,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:09,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 01:34:09,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:09,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 01:34:09,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:09,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 01:34:09,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:09,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 01:34:09,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:09,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 01:34:09,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:09,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-11-29 01:34:09,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:09,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 01:34:09,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:09,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 01:34:09,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:09,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-29 01:34:09,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:09,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2023-11-29 01:34:09,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:09,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-29 01:34:09,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:09,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2023-11-29 01:34:09,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:09,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2023-11-29 01:34:09,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:09,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2023-11-29 01:34:09,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:09,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2023-11-29 01:34:09,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:09,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2023-11-29 01:34:09,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:09,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2023-11-29 01:34:09,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:09,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2023-11-29 01:34:09,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:09,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2023-11-29 01:34:09,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:09,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2023-11-29 01:34:09,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:09,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2023-11-29 01:34:09,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:09,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2023-11-29 01:34:09,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:09,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2023-11-29 01:34:09,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:09,424 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2023-11-29 01:34:09,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:34:09,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732340305] [2023-11-29 01:34:09,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732340305] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:34:09,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:34:09,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:34:09,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166798050] [2023-11-29 01:34:09,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:34:09,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:34:09,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:34:09,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:34:09,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:34:09,466 INFO L87 Difference]: Start difference. First operand has 116 states, 73 states have (on average 1.4794520547945205) internal successors, (108), 74 states have internal predecessors, (108), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2023-11-29 01:34:09,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:34:09,558 INFO L93 Difference]: Finished difference Result 253 states and 454 transitions. [2023-11-29 01:34:09,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:34:09,561 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 256 [2023-11-29 01:34:09,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:34:09,573 INFO L225 Difference]: With dead ends: 253 [2023-11-29 01:34:09,573 INFO L226 Difference]: Without dead ends: 138 [2023-11-29 01:34:09,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 82 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-29 01:34:09,582 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 27 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:34:09,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 359 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:34:09,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2023-11-29 01:34:09,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 125. [2023-11-29 01:34:09,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 83 states have (on average 1.4457831325301205) internal successors, (120), 83 states have internal predecessors, (120), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-11-29 01:34:09,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 200 transitions. [2023-11-29 01:34:09,641 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 200 transitions. Word has length 256 [2023-11-29 01:34:09,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:34:09,644 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 200 transitions. [2023-11-29 01:34:09,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2023-11-29 01:34:09,645 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 200 transitions. [2023-11-29 01:34:09,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2023-11-29 01:34:09,651 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:34:09,651 INFO L195 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 01:34:09,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 01:34:09,652 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:34:09,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:34:09,653 INFO L85 PathProgramCache]: Analyzing trace with hash 866432141, now seen corresponding path program 1 times [2023-11-29 01:34:09,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:34:09,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491730446] [2023-11-29 01:34:09,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:34:09,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:34:09,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:10,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:34:10,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:10,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 01:34:10,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:10,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 01:34:10,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:10,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 01:34:10,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:10,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 01:34:10,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:10,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 01:34:10,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:10,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:34:10,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:10,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 01:34:10,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:10,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 01:34:10,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:10,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 01:34:10,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:10,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 01:34:10,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:10,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 01:34:10,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:10,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 01:34:10,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:10,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 01:34:10,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:10,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 01:34:10,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:10,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 01:34:10,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:10,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 01:34:10,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:10,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 01:34:10,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:10,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 01:34:10,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:10,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 01:34:10,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:10,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 01:34:10,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:10,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 01:34:10,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:10,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-11-29 01:34:10,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:10,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 01:34:10,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:10,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 01:34:10,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:10,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-29 01:34:10,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:10,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2023-11-29 01:34:10,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:10,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-29 01:34:10,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:10,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2023-11-29 01:34:10,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:10,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2023-11-29 01:34:10,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:10,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2023-11-29 01:34:10,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:10,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2023-11-29 01:34:10,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:10,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2023-11-29 01:34:10,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:10,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2023-11-29 01:34:10,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:10,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2023-11-29 01:34:10,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:10,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2023-11-29 01:34:10,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:10,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2023-11-29 01:34:10,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:10,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2023-11-29 01:34:10,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:10,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2023-11-29 01:34:10,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:10,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2023-11-29 01:34:10,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:10,362 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2023-11-29 01:34:10,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:34:10,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491730446] [2023-11-29 01:34:10,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491730446] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:34:10,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:34:10,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 01:34:10,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981085998] [2023-11-29 01:34:10,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:34:10,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:34:10,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:34:10,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:34:10,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:34:10,367 INFO L87 Difference]: Start difference. First operand 125 states and 200 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2023-11-29 01:34:11,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:34:11,712 INFO L93 Difference]: Finished difference Result 857 states and 1370 transitions. [2023-11-29 01:34:11,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 01:34:11,713 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 256 [2023-11-29 01:34:11,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:34:11,723 INFO L225 Difference]: With dead ends: 857 [2023-11-29 01:34:11,723 INFO L226 Difference]: Without dead ends: 733 [2023-11-29 01:34:11,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-11-29 01:34:11,727 INFO L413 NwaCegarLoop]: 469 mSDtfsCounter, 756 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 331 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 756 SdHoareTripleChecker+Valid, 1795 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 331 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:34:11,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [756 Valid, 1795 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [331 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 01:34:11,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2023-11-29 01:34:11,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 329. [2023-11-29 01:34:11,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 246 states have (on average 1.4959349593495934) internal successors, (368), 246 states have internal predecessors, (368), 80 states have call successors, (80), 2 states have call predecessors, (80), 2 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2023-11-29 01:34:11,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 528 transitions. [2023-11-29 01:34:11,846 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 528 transitions. Word has length 256 [2023-11-29 01:34:11,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:34:11,847 INFO L495 AbstractCegarLoop]: Abstraction has 329 states and 528 transitions. [2023-11-29 01:34:11,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2023-11-29 01:34:11,848 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 528 transitions. [2023-11-29 01:34:11,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2023-11-29 01:34:11,853 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:34:11,853 INFO L195 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 01:34:11,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 01:34:11,853 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:34:11,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:34:11,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1124597579, now seen corresponding path program 1 times [2023-11-29 01:34:11,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:34:11,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669470541] [2023-11-29 01:34:11,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:34:11,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:34:11,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:12,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:34:12,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:12,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 01:34:12,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:12,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 01:34:12,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:12,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 01:34:12,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:12,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 01:34:12,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:12,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 01:34:12,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:12,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:34:12,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:12,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 01:34:12,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:12,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 01:34:12,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:12,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 01:34:12,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:12,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 01:34:12,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:12,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 01:34:12,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:12,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 01:34:12,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:12,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 01:34:12,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:12,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 01:34:12,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:12,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 01:34:12,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:12,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 01:34:12,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:12,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 01:34:12,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:12,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 01:34:12,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:12,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 01:34:12,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:12,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 01:34:12,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:12,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 01:34:12,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:12,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-11-29 01:34:12,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:12,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 01:34:12,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:12,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 01:34:12,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:12,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-29 01:34:12,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:12,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2023-11-29 01:34:12,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:12,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-29 01:34:12,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:12,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2023-11-29 01:34:12,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:12,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2023-11-29 01:34:12,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:12,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2023-11-29 01:34:12,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:12,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2023-11-29 01:34:12,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:12,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2023-11-29 01:34:12,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:12,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2023-11-29 01:34:12,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:12,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2023-11-29 01:34:12,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:12,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2023-11-29 01:34:12,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:12,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2023-11-29 01:34:12,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:12,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2023-11-29 01:34:12,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:12,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2023-11-29 01:34:12,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:12,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2023-11-29 01:34:12,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:12,644 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2023-11-29 01:34:12,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:34:12,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669470541] [2023-11-29 01:34:12,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669470541] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:34:12,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:34:12,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 01:34:12,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335964218] [2023-11-29 01:34:12,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:34:12,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:34:12,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:34:12,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:34:12,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:34:12,648 INFO L87 Difference]: Start difference. First operand 329 states and 528 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2023-11-29 01:34:13,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:34:13,646 INFO L93 Difference]: Finished difference Result 1060 states and 1697 transitions. [2023-11-29 01:34:13,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:34:13,647 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 256 [2023-11-29 01:34:13,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:34:13,654 INFO L225 Difference]: With dead ends: 1060 [2023-11-29 01:34:13,654 INFO L226 Difference]: Without dead ends: 732 [2023-11-29 01:34:13,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:34:13,656 INFO L413 NwaCegarLoop]: 449 mSDtfsCounter, 615 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 01:34:13,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 1092 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 01:34:13,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2023-11-29 01:34:13,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 327. [2023-11-29 01:34:13,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 244 states have (on average 1.4631147540983607) internal successors, (357), 244 states have internal predecessors, (357), 80 states have call successors, (80), 2 states have call predecessors, (80), 2 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2023-11-29 01:34:13,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 517 transitions. [2023-11-29 01:34:13,725 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 517 transitions. Word has length 256 [2023-11-29 01:34:13,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:34:13,726 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 517 transitions. [2023-11-29 01:34:13,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2023-11-29 01:34:13,727 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 517 transitions. [2023-11-29 01:34:13,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2023-11-29 01:34:13,730 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:34:13,730 INFO L195 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 01:34:13,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 01:34:13,730 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:34:13,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:34:13,731 INFO L85 PathProgramCache]: Analyzing trace with hash -144685109, now seen corresponding path program 1 times [2023-11-29 01:34:13,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:34:13,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076012353] [2023-11-29 01:34:13,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:34:13,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:34:13,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:14,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:34:14,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:14,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 01:34:14,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:14,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 01:34:14,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:14,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 01:34:14,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:14,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 01:34:14,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:14,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 01:34:14,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:14,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:34:14,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:14,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 01:34:14,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:14,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 01:34:14,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:14,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 01:34:14,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:14,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 01:34:14,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:14,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 01:34:14,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:14,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 01:34:14,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:14,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 01:34:14,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:14,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 01:34:14,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:14,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 01:34:14,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:14,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 01:34:14,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:14,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 01:34:14,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:14,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 01:34:14,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:14,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 01:34:14,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:14,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 01:34:14,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:14,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 01:34:14,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:14,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-11-29 01:34:14,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:14,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 01:34:14,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:14,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 01:34:14,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:14,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-29 01:34:14,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:14,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2023-11-29 01:34:14,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:14,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-29 01:34:14,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:14,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2023-11-29 01:34:14,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:14,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2023-11-29 01:34:14,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:14,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2023-11-29 01:34:14,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:14,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2023-11-29 01:34:14,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:14,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2023-11-29 01:34:14,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:14,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2023-11-29 01:34:14,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:14,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2023-11-29 01:34:14,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:14,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2023-11-29 01:34:14,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:14,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2023-11-29 01:34:14,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:14,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2023-11-29 01:34:14,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:14,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2023-11-29 01:34:14,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:14,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2023-11-29 01:34:14,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:14,268 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2023-11-29 01:34:14,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:34:14,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076012353] [2023-11-29 01:34:14,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076012353] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:34:14,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:34:14,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 01:34:14,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942328699] [2023-11-29 01:34:14,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:34:14,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:34:14,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:34:14,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:34:14,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:34:14,271 INFO L87 Difference]: Start difference. First operand 327 states and 517 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2023-11-29 01:34:14,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:34:14,910 INFO L93 Difference]: Finished difference Result 875 states and 1384 transitions. [2023-11-29 01:34:14,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 01:34:14,928 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 256 [2023-11-29 01:34:14,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:34:14,932 INFO L225 Difference]: With dead ends: 875 [2023-11-29 01:34:14,932 INFO L226 Difference]: Without dead ends: 549 [2023-11-29 01:34:14,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-29 01:34:14,935 INFO L413 NwaCegarLoop]: 317 mSDtfsCounter, 172 mSDsluCounter, 923 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 1240 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 01:34:14,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 1240 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 01:34:14,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2023-11-29 01:34:15,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 351. [2023-11-29 01:34:15,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 268 states have (on average 1.458955223880597) internal successors, (391), 268 states have internal predecessors, (391), 80 states have call successors, (80), 2 states have call predecessors, (80), 2 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2023-11-29 01:34:15,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 551 transitions. [2023-11-29 01:34:15,033 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 551 transitions. Word has length 256 [2023-11-29 01:34:15,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:34:15,034 INFO L495 AbstractCegarLoop]: Abstraction has 351 states and 551 transitions. [2023-11-29 01:34:15,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2023-11-29 01:34:15,034 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 551 transitions. [2023-11-29 01:34:15,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2023-11-29 01:34:15,039 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:34:15,040 INFO L195 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 01:34:15,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 01:34:15,040 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:34:15,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:34:15,041 INFO L85 PathProgramCache]: Analyzing trace with hash 984328643, now seen corresponding path program 1 times [2023-11-29 01:34:15,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:34:15,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170489930] [2023-11-29 01:34:15,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:34:15,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:34:15,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:15,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:34:15,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:15,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 01:34:15,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:15,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 01:34:15,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:15,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 01:34:15,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:15,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 01:34:15,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:15,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 01:34:15,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:15,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:34:15,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:15,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 01:34:15,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:15,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 01:34:15,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:15,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 01:34:15,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:15,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 01:34:15,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:15,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 01:34:15,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:15,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 01:34:16,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:16,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 01:34:16,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:16,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 01:34:16,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:16,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 01:34:16,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:16,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 01:34:16,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:16,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 01:34:16,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:16,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 01:34:16,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:16,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 01:34:16,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:16,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 01:34:16,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:16,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 01:34:16,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:16,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-11-29 01:34:16,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:16,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 01:34:16,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:16,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 01:34:16,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:16,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-29 01:34:16,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:16,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2023-11-29 01:34:16,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:16,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-29 01:34:16,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:16,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2023-11-29 01:34:16,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:16,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2023-11-29 01:34:16,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:16,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2023-11-29 01:34:16,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:16,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2023-11-29 01:34:16,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:16,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2023-11-29 01:34:16,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:16,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2023-11-29 01:34:16,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:16,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2023-11-29 01:34:16,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:16,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2023-11-29 01:34:16,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:16,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2023-11-29 01:34:16,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:16,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2023-11-29 01:34:16,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:16,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2023-11-29 01:34:16,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:16,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2023-11-29 01:34:16,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:16,077 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2023-11-29 01:34:16,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:34:16,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170489930] [2023-11-29 01:34:16,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170489930] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:34:16,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:34:16,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 01:34:16,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246055435] [2023-11-29 01:34:16,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:34:16,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 01:34:16,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:34:16,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 01:34:16,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-11-29 01:34:16,081 INFO L87 Difference]: Start difference. First operand 351 states and 551 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2023-11-29 01:34:16,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:34:16,796 INFO L93 Difference]: Finished difference Result 851 states and 1306 transitions. [2023-11-29 01:34:16,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 01:34:16,797 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 257 [2023-11-29 01:34:16,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:34:16,801 INFO L225 Difference]: With dead ends: 851 [2023-11-29 01:34:16,801 INFO L226 Difference]: Without dead ends: 501 [2023-11-29 01:34:16,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2023-11-29 01:34:16,804 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 90 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 01:34:16,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 717 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 01:34:16,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2023-11-29 01:34:16,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 366. [2023-11-29 01:34:16,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 283 states have (on average 1.392226148409894) internal successors, (394), 283 states have internal predecessors, (394), 80 states have call successors, (80), 2 states have call predecessors, (80), 2 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2023-11-29 01:34:16,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 554 transitions. [2023-11-29 01:34:16,883 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 554 transitions. Word has length 257 [2023-11-29 01:34:16,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:34:16,884 INFO L495 AbstractCegarLoop]: Abstraction has 366 states and 554 transitions. [2023-11-29 01:34:16,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2023-11-29 01:34:16,884 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 554 transitions. [2023-11-29 01:34:16,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2023-11-29 01:34:16,888 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:34:16,888 INFO L195 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 01:34:16,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 01:34:16,889 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:34:16,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:34:16,889 INFO L85 PathProgramCache]: Analyzing trace with hash -579196706, now seen corresponding path program 1 times [2023-11-29 01:34:16,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:34:16,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244694230] [2023-11-29 01:34:16,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:34:16,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:34:16,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:34:17,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 01:34:17,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 01:34:17,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 01:34:17,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 01:34:17,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 01:34:17,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:34:17,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 01:34:17,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 01:34:17,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 01:34:17,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 01:34:17,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 01:34:17,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 01:34:17,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 01:34:17,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 01:34:17,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 01:34:17,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 01:34:17,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 01:34:17,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 01:34:17,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 01:34:17,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 01:34:17,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 01:34:17,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-11-29 01:34:17,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 01:34:17,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 01:34:17,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-29 01:34:17,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2023-11-29 01:34:17,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-29 01:34:17,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2023-11-29 01:34:17,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2023-11-29 01:34:17,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2023-11-29 01:34:17,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2023-11-29 01:34:17,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2023-11-29 01:34:17,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2023-11-29 01:34:17,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2023-11-29 01:34:17,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2023-11-29 01:34:17,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2023-11-29 01:34:17,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2023-11-29 01:34:17,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2023-11-29 01:34:17,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2023-11-29 01:34:17,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,123 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2023-11-29 01:34:17,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:34:17,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244694230] [2023-11-29 01:34:17,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244694230] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:34:17,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:34:17,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:34:17,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589482573] [2023-11-29 01:34:17,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:34:17,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:34:17,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:34:17,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:34:17,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:34:17,126 INFO L87 Difference]: Start difference. First operand 366 states and 554 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2023-11-29 01:34:17,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:34:17,321 INFO L93 Difference]: Finished difference Result 955 states and 1452 transitions. [2023-11-29 01:34:17,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:34:17,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 257 [2023-11-29 01:34:17,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:34:17,326 INFO L225 Difference]: With dead ends: 955 [2023-11-29 01:34:17,327 INFO L226 Difference]: Without dead ends: 590 [2023-11-29 01:34:17,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 82 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-29 01:34:17,329 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 161 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:34:17,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 360 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:34:17,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2023-11-29 01:34:17,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 384. [2023-11-29 01:34:17,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 301 states have (on average 1.3754152823920265) internal successors, (414), 301 states have internal predecessors, (414), 80 states have call successors, (80), 2 states have call predecessors, (80), 2 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2023-11-29 01:34:17,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 574 transitions. [2023-11-29 01:34:17,443 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 574 transitions. Word has length 257 [2023-11-29 01:34:17,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:34:17,444 INFO L495 AbstractCegarLoop]: Abstraction has 384 states and 574 transitions. [2023-11-29 01:34:17,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2023-11-29 01:34:17,444 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 574 transitions. [2023-11-29 01:34:17,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2023-11-29 01:34:17,448 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:34:17,448 INFO L195 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 01:34:17,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 01:34:17,448 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:34:17,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:34:17,449 INFO L85 PathProgramCache]: Analyzing trace with hash -97136921, now seen corresponding path program 1 times [2023-11-29 01:34:17,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:34:17,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977491457] [2023-11-29 01:34:17,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:34:17,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:34:17,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:34:17,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 01:34:17,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 01:34:17,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 01:34:17,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 01:34:17,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 01:34:17,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:34:17,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 01:34:17,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 01:34:17,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 01:34:17,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 01:34:17,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 01:34:17,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 01:34:17,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 01:34:17,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 01:34:17,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 01:34:17,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 01:34:17,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 01:34:17,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 01:34:17,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 01:34:17,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 01:34:17,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 01:34:17,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-11-29 01:34:17,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 01:34:17,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 01:34:17,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-29 01:34:17,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2023-11-29 01:34:17,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-29 01:34:17,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2023-11-29 01:34:17,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2023-11-29 01:34:17,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2023-11-29 01:34:17,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2023-11-29 01:34:17,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2023-11-29 01:34:17,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2023-11-29 01:34:17,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2023-11-29 01:34:17,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2023-11-29 01:34:17,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2023-11-29 01:34:17,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2023-11-29 01:34:17,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2023-11-29 01:34:17,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2023-11-29 01:34:17,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:17,879 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2023-11-29 01:34:17,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:34:17,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977491457] [2023-11-29 01:34:17,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977491457] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:34:17,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:34:17,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 01:34:17,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120412711] [2023-11-29 01:34:17,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:34:17,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 01:34:17,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:34:17,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 01:34:17,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:34:17,882 INFO L87 Difference]: Start difference. First operand 384 states and 574 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2023-11-29 01:34:18,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:34:18,498 INFO L93 Difference]: Finished difference Result 1032 states and 1550 transitions. [2023-11-29 01:34:18,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 01:34:18,499 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 258 [2023-11-29 01:34:18,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:34:18,503 INFO L225 Difference]: With dead ends: 1032 [2023-11-29 01:34:18,503 INFO L226 Difference]: Without dead ends: 649 [2023-11-29 01:34:18,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:34:18,505 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 439 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 01:34:18,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 324 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 01:34:18,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2023-11-29 01:34:18,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 406. [2023-11-29 01:34:18,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 323 states have (on average 1.3591331269349844) internal successors, (439), 323 states have internal predecessors, (439), 80 states have call successors, (80), 2 states have call predecessors, (80), 2 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2023-11-29 01:34:18,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 599 transitions. [2023-11-29 01:34:18,587 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 599 transitions. Word has length 258 [2023-11-29 01:34:18,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:34:18,588 INFO L495 AbstractCegarLoop]: Abstraction has 406 states and 599 transitions. [2023-11-29 01:34:18,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2023-11-29 01:34:18,588 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 599 transitions. [2023-11-29 01:34:18,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2023-11-29 01:34:18,592 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:34:18,592 INFO L195 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 01:34:18,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 01:34:18,592 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:34:18,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:34:18,593 INFO L85 PathProgramCache]: Analyzing trace with hash -906483547, now seen corresponding path program 1 times [2023-11-29 01:34:18,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:34:18,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988628359] [2023-11-29 01:34:18,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:34:18,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:34:18,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:19,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:34:19,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:19,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 01:34:19,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:19,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 01:34:19,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:19,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 01:34:19,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:19,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 01:34:19,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:19,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 01:34:19,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:19,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:34:19,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:19,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 01:34:19,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:19,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 01:34:19,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:19,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 01:34:19,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:19,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 01:34:19,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:19,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 01:34:19,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:19,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 01:34:19,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:19,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 01:34:19,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:19,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 01:34:19,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:19,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 01:34:19,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:19,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 01:34:19,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:19,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 01:34:19,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:19,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 01:34:19,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:19,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 01:34:19,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:19,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 01:34:19,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:19,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 01:34:19,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:19,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-11-29 01:34:19,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:19,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 01:34:19,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:19,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 01:34:19,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:19,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-29 01:34:19,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:19,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2023-11-29 01:34:19,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:19,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-29 01:34:19,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:19,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2023-11-29 01:34:19,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:19,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2023-11-29 01:34:19,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:19,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2023-11-29 01:34:19,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:19,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2023-11-29 01:34:19,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:19,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2023-11-29 01:34:19,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:19,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2023-11-29 01:34:19,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:19,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2023-11-29 01:34:19,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:19,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2023-11-29 01:34:19,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:19,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2023-11-29 01:34:19,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:19,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2023-11-29 01:34:19,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:19,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2023-11-29 01:34:19,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:19,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2023-11-29 01:34:19,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:19,167 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2023-11-29 01:34:19,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:34:19,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988628359] [2023-11-29 01:34:19,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988628359] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:34:19,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:34:19,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 01:34:19,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704064510] [2023-11-29 01:34:19,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:34:19,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 01:34:19,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:34:19,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 01:34:19,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-29 01:34:19,171 INFO L87 Difference]: Start difference. First operand 406 states and 599 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2023-11-29 01:34:19,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:34:19,623 INFO L93 Difference]: Finished difference Result 962 states and 1386 transitions. [2023-11-29 01:34:19,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 01:34:19,623 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 258 [2023-11-29 01:34:19,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:34:19,628 INFO L225 Difference]: With dead ends: 962 [2023-11-29 01:34:19,628 INFO L226 Difference]: Without dead ends: 557 [2023-11-29 01:34:19,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2023-11-29 01:34:19,630 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 84 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 01:34:19,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 925 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 01:34:19,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2023-11-29 01:34:19,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 400. [2023-11-29 01:34:19,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 317 states have (on average 1.3564668769716088) internal successors, (430), 317 states have internal predecessors, (430), 80 states have call successors, (80), 2 states have call predecessors, (80), 2 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2023-11-29 01:34:19,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 590 transitions. [2023-11-29 01:34:19,758 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 590 transitions. Word has length 258 [2023-11-29 01:34:19,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:34:19,759 INFO L495 AbstractCegarLoop]: Abstraction has 400 states and 590 transitions. [2023-11-29 01:34:19,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2023-11-29 01:34:19,760 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 590 transitions. [2023-11-29 01:34:19,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2023-11-29 01:34:19,764 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:34:19,764 INFO L195 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 01:34:19,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 01:34:19,765 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:34:19,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:34:19,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1892012678, now seen corresponding path program 1 times [2023-11-29 01:34:19,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:34:19,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193718121] [2023-11-29 01:34:19,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:34:19,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:34:19,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:20,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:34:20,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:20,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 01:34:20,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:20,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 01:34:20,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:20,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 01:34:20,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:20,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 01:34:20,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:20,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 01:34:20,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:20,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:34:20,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:20,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 01:34:20,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:20,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 01:34:20,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:20,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 01:34:20,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:20,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 01:34:20,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:20,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 01:34:20,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:20,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 01:34:20,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:20,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 01:34:20,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:20,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 01:34:20,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:20,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 01:34:20,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:20,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 01:34:20,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:20,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 01:34:20,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:20,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 01:34:20,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:20,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 01:34:20,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:20,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 01:34:20,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:20,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 01:34:20,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:20,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-11-29 01:34:20,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:20,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 01:34:20,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:20,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 01:34:20,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:20,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-29 01:34:20,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:20,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2023-11-29 01:34:20,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:20,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-29 01:34:20,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:20,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2023-11-29 01:34:20,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:20,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2023-11-29 01:34:20,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:20,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2023-11-29 01:34:20,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:20,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2023-11-29 01:34:20,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:20,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2023-11-29 01:34:20,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:20,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2023-11-29 01:34:20,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:20,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2023-11-29 01:34:20,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:20,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2023-11-29 01:34:20,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:20,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2023-11-29 01:34:20,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:20,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2023-11-29 01:34:20,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:20,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2023-11-29 01:34:20,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:20,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2023-11-29 01:34:20,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:20,288 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2023-11-29 01:34:20,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:34:20,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193718121] [2023-11-29 01:34:20,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193718121] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:34:20,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:34:20,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 01:34:20,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758924118] [2023-11-29 01:34:20,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:34:20,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:34:20,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:34:20,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:34:20,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:34:20,291 INFO L87 Difference]: Start difference. First operand 400 states and 590 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2023-11-29 01:34:20,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:34:20,910 INFO L93 Difference]: Finished difference Result 1033 states and 1534 transitions. [2023-11-29 01:34:20,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 01:34:20,910 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 258 [2023-11-29 01:34:20,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:34:20,916 INFO L225 Difference]: With dead ends: 1033 [2023-11-29 01:34:20,916 INFO L226 Difference]: Without dead ends: 634 [2023-11-29 01:34:20,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-29 01:34:20,918 INFO L413 NwaCegarLoop]: 328 mSDtfsCounter, 162 mSDsluCounter, 942 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 1270 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 01:34:20,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 1270 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 01:34:20,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2023-11-29 01:34:21,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 440. [2023-11-29 01:34:21,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 357 states have (on average 1.3333333333333333) internal successors, (476), 357 states have internal predecessors, (476), 80 states have call successors, (80), 2 states have call predecessors, (80), 2 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2023-11-29 01:34:21,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 636 transitions. [2023-11-29 01:34:21,045 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 636 transitions. Word has length 258 [2023-11-29 01:34:21,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:34:21,046 INFO L495 AbstractCegarLoop]: Abstraction has 440 states and 636 transitions. [2023-11-29 01:34:21,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2023-11-29 01:34:21,047 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 636 transitions. [2023-11-29 01:34:21,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2023-11-29 01:34:21,051 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:34:21,051 INFO L195 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 01:34:21,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 01:34:21,051 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:34:21,052 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:34:21,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1139060866, now seen corresponding path program 1 times [2023-11-29 01:34:21,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:34:21,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357607394] [2023-11-29 01:34:21,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:34:21,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:34:21,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:21,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:34:21,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:21,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 01:34:21,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:21,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 01:34:21,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:21,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 01:34:21,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:21,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 01:34:21,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:21,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 01:34:21,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:21,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:34:21,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:21,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 01:34:21,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:21,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 01:34:21,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:21,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 01:34:21,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:21,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 01:34:21,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:21,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 01:34:21,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:21,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 01:34:21,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:21,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 01:34:21,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:21,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 01:34:21,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:21,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 01:34:21,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:21,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 01:34:21,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:21,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 01:34:21,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:21,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 01:34:21,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:21,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 01:34:21,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:21,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 01:34:21,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:21,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 01:34:21,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:21,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-11-29 01:34:21,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:21,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 01:34:21,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:21,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 01:34:21,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:21,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-29 01:34:21,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:21,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2023-11-29 01:34:21,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:21,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-29 01:34:21,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:21,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2023-11-29 01:34:21,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:21,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2023-11-29 01:34:21,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:21,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2023-11-29 01:34:21,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:21,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2023-11-29 01:34:21,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:21,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2023-11-29 01:34:21,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:21,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2023-11-29 01:34:21,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:21,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2023-11-29 01:34:21,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:21,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2023-11-29 01:34:21,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:21,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2023-11-29 01:34:21,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:21,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2023-11-29 01:34:21,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:21,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2023-11-29 01:34:21,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:21,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2023-11-29 01:34:21,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:21,249 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2023-11-29 01:34:21,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:34:21,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357607394] [2023-11-29 01:34:21,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357607394] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:34:21,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:34:21,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:34:21,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143146283] [2023-11-29 01:34:21,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:34:21,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:34:21,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:34:21,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:34:21,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:34:21,252 INFO L87 Difference]: Start difference. First operand 440 states and 636 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2023-11-29 01:34:21,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:34:21,525 INFO L93 Difference]: Finished difference Result 1128 states and 1645 transitions. [2023-11-29 01:34:21,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:34:21,526 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 258 [2023-11-29 01:34:21,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:34:21,531 INFO L225 Difference]: With dead ends: 1128 [2023-11-29 01:34:21,531 INFO L226 Difference]: Without dead ends: 689 [2023-11-29 01:34:21,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 82 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-29 01:34:21,533 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 166 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:34:21,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 357 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 01:34:21,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2023-11-29 01:34:21,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 470. [2023-11-29 01:34:21,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 387 states have (on average 1.2945736434108528) internal successors, (501), 387 states have internal predecessors, (501), 80 states have call successors, (80), 2 states have call predecessors, (80), 2 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2023-11-29 01:34:21,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 661 transitions. [2023-11-29 01:34:21,656 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 661 transitions. Word has length 258 [2023-11-29 01:34:21,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:34:21,657 INFO L495 AbstractCegarLoop]: Abstraction has 470 states and 661 transitions. [2023-11-29 01:34:21,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2023-11-29 01:34:21,657 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 661 transitions. [2023-11-29 01:34:21,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2023-11-29 01:34:21,661 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:34:21,661 INFO L195 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 01:34:21,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 01:34:21,661 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:34:21,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:34:21,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1196319168, now seen corresponding path program 1 times [2023-11-29 01:34:21,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:34:21,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670948043] [2023-11-29 01:34:21,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:34:21,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:34:21,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:22,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:34:22,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:22,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 01:34:22,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:22,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 01:34:22,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:22,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 01:34:22,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:22,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 01:34:22,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:22,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 01:34:22,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:22,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:34:22,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:22,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 01:34:22,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:22,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 01:34:22,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:22,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 01:34:22,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:22,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 01:34:22,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:22,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 01:34:22,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:22,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 01:34:22,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:22,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 01:34:22,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:22,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 01:34:22,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:22,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 01:34:22,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:22,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 01:34:22,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:22,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 01:34:22,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:22,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 01:34:22,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:22,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 01:34:22,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:22,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 01:34:22,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:22,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 01:34:22,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:22,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-11-29 01:34:22,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:22,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 01:34:22,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:22,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 01:34:22,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:22,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-29 01:34:22,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:22,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2023-11-29 01:34:22,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:22,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-29 01:34:22,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:22,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2023-11-29 01:34:22,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:22,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2023-11-29 01:34:22,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:22,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2023-11-29 01:34:22,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:22,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2023-11-29 01:34:22,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:22,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2023-11-29 01:34:22,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:22,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2023-11-29 01:34:22,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:22,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2023-11-29 01:34:22,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:22,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2023-11-29 01:34:22,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:22,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2023-11-29 01:34:22,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:22,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2023-11-29 01:34:22,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:22,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2023-11-29 01:34:22,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:22,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2023-11-29 01:34:22,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:22,165 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2023-11-29 01:34:22,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:34:22,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670948043] [2023-11-29 01:34:22,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670948043] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:34:22,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:34:22,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 01:34:22,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177109212] [2023-11-29 01:34:22,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:34:22,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:34:22,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:34:22,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:34:22,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:34:22,168 INFO L87 Difference]: Start difference. First operand 470 states and 661 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2023-11-29 01:34:23,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:34:23,010 INFO L93 Difference]: Finished difference Result 1110 states and 1601 transitions. [2023-11-29 01:34:23,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:34:23,011 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 258 [2023-11-29 01:34:23,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:34:23,016 INFO L225 Difference]: With dead ends: 1110 [2023-11-29 01:34:23,016 INFO L226 Difference]: Without dead ends: 641 [2023-11-29 01:34:23,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:34:23,018 INFO L413 NwaCegarLoop]: 321 mSDtfsCounter, 357 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 01:34:23,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 697 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 01:34:23,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2023-11-29 01:34:23,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 434. [2023-11-29 01:34:23,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 351 states have (on average 1.2792022792022792) internal successors, (449), 351 states have internal predecessors, (449), 80 states have call successors, (80), 2 states have call predecessors, (80), 2 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2023-11-29 01:34:23,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 609 transitions. [2023-11-29 01:34:23,151 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 609 transitions. Word has length 258 [2023-11-29 01:34:23,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:34:23,151 INFO L495 AbstractCegarLoop]: Abstraction has 434 states and 609 transitions. [2023-11-29 01:34:23,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2023-11-29 01:34:23,151 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 609 transitions. [2023-11-29 01:34:23,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2023-11-29 01:34:23,154 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:34:23,154 INFO L195 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 01:34:23,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 01:34:23,154 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:34:23,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:34:23,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1968387662, now seen corresponding path program 1 times [2023-11-29 01:34:23,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:34:23,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417196861] [2023-11-29 01:34:23,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:34:23,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:34:23,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:23,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:34:23,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:23,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 01:34:23,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:23,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 01:34:23,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:23,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 01:34:23,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:23,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 01:34:23,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:23,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 01:34:23,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:23,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 01:34:23,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:23,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 01:34:23,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:23,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 01:34:23,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:23,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 01:34:23,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:23,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 01:34:23,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:23,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 01:34:23,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:23,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 01:34:23,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:23,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 01:34:23,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:23,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 01:34:23,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:23,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 01:34:23,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:23,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 01:34:23,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:23,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 01:34:23,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:23,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 01:34:23,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:23,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 01:34:23,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:23,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 01:34:23,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:23,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 01:34:23,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:23,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-11-29 01:34:23,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:23,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 01:34:23,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:23,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 01:34:23,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:23,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-29 01:34:23,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:23,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2023-11-29 01:34:23,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:23,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-29 01:34:23,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:23,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2023-11-29 01:34:23,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:23,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2023-11-29 01:34:23,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:23,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2023-11-29 01:34:23,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:23,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2023-11-29 01:34:23,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:23,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2023-11-29 01:34:23,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:23,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2023-11-29 01:34:23,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:23,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2023-11-29 01:34:23,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:23,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2023-11-29 01:34:23,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:23,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2023-11-29 01:34:23,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:23,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2023-11-29 01:34:23,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:23,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2023-11-29 01:34:23,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:23,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2023-11-29 01:34:23,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:23,721 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2023-11-29 01:34:23,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:34:23,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417196861] [2023-11-29 01:34:23,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417196861] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:34:23,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:34:23,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 01:34:23,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429577645] [2023-11-29 01:34:23,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:34:23,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 01:34:23,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:34:23,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 01:34:23,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:34:23,723 INFO L87 Difference]: Start difference. First operand 434 states and 609 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2023-11-29 01:34:24,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:34:24,124 INFO L93 Difference]: Finished difference Result 1126 states and 1570 transitions. [2023-11-29 01:34:24,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:34:24,125 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 258 [2023-11-29 01:34:24,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:34:24,129 INFO L225 Difference]: With dead ends: 1126 [2023-11-29 01:34:24,129 INFO L226 Difference]: Without dead ends: 693 [2023-11-29 01:34:24,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 01:34:24,131 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 169 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 01:34:24,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 618 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 01:34:24,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2023-11-29 01:34:24,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 521. [2023-11-29 01:34:24,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 397 states have (on average 1.2821158690176322) internal successors, (509), 397 states have internal predecessors, (509), 120 states have call successors, (120), 3 states have call predecessors, (120), 3 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2023-11-29 01:34:24,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 749 transitions. [2023-11-29 01:34:24,248 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 749 transitions. Word has length 258 [2023-11-29 01:34:24,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:34:24,249 INFO L495 AbstractCegarLoop]: Abstraction has 521 states and 749 transitions. [2023-11-29 01:34:24,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2023-11-29 01:34:24,249 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 749 transitions. [2023-11-29 01:34:24,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2023-11-29 01:34:24,252 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:34:24,253 INFO L195 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 01:34:24,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 01:34:24,253 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:34:24,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:34:24,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1545685836, now seen corresponding path program 1 times [2023-11-29 01:34:24,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:34:24,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730429947] [2023-11-29 01:34:24,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:34:24,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:34:24,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:34:24,352 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:34:24,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:34:24,565 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:34:24,566 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 01:34:24,566 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 01:34:24,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 01:34:24,571 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:34:24,574 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 01:34:24,674 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-29 01:34:24,675 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated [2023-11-29 01:34:24,675 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-29 01:34:24,677 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet6 could not be translated [2023-11-29 01:34:24,678 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet7 could not be translated [2023-11-29 01:34:24,679 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet33 could not be translated [2023-11-29 01:34:24,680 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short35 could not be translated [2023-11-29 01:34:24,680 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet33 could not be translated [2023-11-29 01:34:24,680 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet34 could not be translated [2023-11-29 01:34:24,680 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short35 could not be translated [2023-11-29 01:34:24,680 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet33 could not be translated [2023-11-29 01:34:24,680 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet33 could not be translated [2023-11-29 01:34:24,680 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short35 could not be translated [2023-11-29 01:34:24,681 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet34 could not be translated [2023-11-29 01:34:24,710 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 01:34:24 BoogieIcfgContainer [2023-11-29 01:34:24,711 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 01:34:24,711 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 01:34:24,711 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 01:34:24,711 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 01:34:24,712 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:34:08" (3/4) ... [2023-11-29 01:34:24,713 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 01:34:24,714 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 01:34:24,715 INFO L158 Benchmark]: Toolchain (without parser) took 17266.12ms. Allocated memory was 159.4MB in the beginning and 434.1MB in the end (delta: 274.7MB). Free memory was 119.5MB in the beginning and 206.5MB in the end (delta: -87.0MB). Peak memory consumption was 190.6MB. Max. memory is 16.1GB. [2023-11-29 01:34:24,715 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 159.4MB. Free memory was 101.8MB in the beginning and 101.6MB in the end (delta: 159.7kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 01:34:24,715 INFO L158 Benchmark]: CACSL2BoogieTranslator took 344.99ms. Allocated memory is still 159.4MB. Free memory was 119.5MB in the beginning and 102.8MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-29 01:34:24,715 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.39ms. Allocated memory is still 159.4MB. Free memory was 102.5MB in the beginning and 97.8MB in the end (delta: 4.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-29 01:34:24,716 INFO L158 Benchmark]: Boogie Preprocessor took 73.57ms. Allocated memory is still 159.4MB. Free memory was 97.8MB in the beginning and 91.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-29 01:34:24,716 INFO L158 Benchmark]: RCFGBuilder took 680.99ms. Allocated memory was 159.4MB in the beginning and 207.6MB in the end (delta: 48.2MB). Free memory was 91.1MB in the beginning and 152.0MB in the end (delta: -60.9MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. [2023-11-29 01:34:24,716 INFO L158 Benchmark]: TraceAbstraction took 16089.45ms. Allocated memory was 207.6MB in the beginning and 434.1MB in the end (delta: 226.5MB). Free memory was 150.9MB in the beginning and 206.5MB in the end (delta: -55.6MB). Peak memory consumption was 170.9MB. Max. memory is 16.1GB. [2023-11-29 01:34:24,717 INFO L158 Benchmark]: Witness Printer took 2.80ms. Allocated memory is still 434.1MB. Free memory is still 206.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 01:34:24,718 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.23ms. Allocated memory is still 159.4MB. Free memory was 101.8MB in the beginning and 101.6MB in the end (delta: 159.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 344.99ms. Allocated memory is still 159.4MB. Free memory was 119.5MB in the beginning and 102.8MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.39ms. Allocated memory is still 159.4MB. Free memory was 102.5MB in the beginning and 97.8MB in the end (delta: 4.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.57ms. Allocated memory is still 159.4MB. Free memory was 97.8MB in the beginning and 91.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 680.99ms. Allocated memory was 159.4MB in the beginning and 207.6MB in the end (delta: 48.2MB). Free memory was 91.1MB in the beginning and 152.0MB in the end (delta: -60.9MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. * TraceAbstraction took 16089.45ms. Allocated memory was 207.6MB in the beginning and 434.1MB in the end (delta: 226.5MB). Free memory was 150.9MB in the beginning and 206.5MB in the end (delta: -55.6MB). Peak memory consumption was 170.9MB. Max. memory is 16.1GB. * Witness Printer took 2.80ms. Allocated memory is still 434.1MB. Free memory is still 206.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet33 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short35 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet33 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet34 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short35 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet33 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet33 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short35 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet34 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 222, overapproximation of shiftRight at line 222, overapproximation of someUnaryDOUBLEoperation at line 52, overapproximation of someBinaryDOUBLEComparisonOperation at line 222. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 64; [L23] unsigned char var_1_7 = 0; [L24] unsigned short int var_1_11 = 500; [L25] unsigned char var_1_13 = 64; [L26] unsigned char var_1_15 = 1; [L27] unsigned char var_1_16 = 8; [L28] double var_1_17 = 7.5; [L29] double var_1_18 = 31.125; [L30] double var_1_19 = 10.5; [L31] double var_1_20 = 0.0; [L32] double var_1_21 = 16.75; [L33] double var_1_22 = 2.5; [L34] double var_1_23 = 64.5; [L35] signed long int var_1_24 = 10; [L36] signed char var_1_26 = 16; [L37] signed char var_1_27 = 4; [L38] signed char var_1_28 = -10; [L39] float var_1_29 = 63.794; [L40] unsigned short int var_1_30 = 1; [L41] signed long int var_1_31 = -2; [L42] unsigned char var_1_32 = 64; [L43] unsigned char var_1_33 = 8; [L44] unsigned long int var_1_34 = 128; [L45] unsigned long int var_1_35 = 50; [L46] unsigned long int var_1_36 = 16; [L47] unsigned long int var_1_37 = 4; [L48] unsigned char var_1_38 = 8; [L49] unsigned char var_1_39 = 10; [L50] double var_1_40 = 8.35; [L51] double var_1_41 = 63.75; [L52] double var_1_42 = -0.125; [L53] double var_1_43 = -0.8; [L54] double var_1_44 = -0.5; [L55] unsigned short int var_1_45 = 50; [L56] unsigned char var_1_46 = 0; [L57] unsigned char var_1_47 = 5; [L58] unsigned char var_1_48 = 1; [L59] signed char var_1_49 = -16; [L60] signed char var_1_50 = 2; [L61] signed char var_1_51 = 16; [L62] signed char var_1_52 = 0; [L63] signed long int var_1_53 = 256; [L64] double var_1_54 = 1.25; [L65] unsigned long int var_1_55 = 5; [L66] signed long int last_1_var_1_1 = 64; [L67] unsigned char last_1_var_1_13 = 64; [L226] isInitial = 1 [L227] FCALL initially() [L228] COND TRUE 1 [L229] CALL updateLastVariables() [L218] last_1_var_1_1 = var_1_1 [L219] last_1_var_1_13 = var_1_13 [L229] RET updateLastVariables() [L230] CALL updateVariables() [L151] var_1_7 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5] [L152] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5] [L153] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L153] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L154] var_1_15 = __VERIFIER_nondet_uchar() [L155] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L155] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L156] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L156] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L157] var_1_16 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L158] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L159] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L159] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L160] var_1_18 = __VERIFIER_nondet_double() [L161] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L161] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L162] var_1_19 = __VERIFIER_nondet_double() [L163] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L163] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L164] var_1_20 = __VERIFIER_nondet_double() [L165] CALL assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L165] RET assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L166] var_1_21 = __VERIFIER_nondet_double() [L167] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L167] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L168] var_1_22 = __VERIFIER_nondet_double() [L169] CALL assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L169] RET assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L170] var_1_23 = __VERIFIER_nondet_double() [L171] CALL assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L171] RET assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L172] var_1_27 = __VERIFIER_nondet_char() [L173] CALL assume_abort_if_not(var_1_27 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L173] RET assume_abort_if_not(var_1_27 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L174] CALL assume_abort_if_not(var_1_27 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L174] RET assume_abort_if_not(var_1_27 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L175] var_1_28 = __VERIFIER_nondet_char() [L176] CALL assume_abort_if_not(var_1_28 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L176] RET assume_abort_if_not(var_1_28 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L177] CALL assume_abort_if_not(var_1_28 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L177] RET assume_abort_if_not(var_1_28 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=128, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L178] var_1_34 = __VERIFIER_nondet_ulong() [L179] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L179] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L180] CALL assume_abort_if_not(var_1_34 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L180] RET assume_abort_if_not(var_1_34 <= 4294967295) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_35=50, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L181] var_1_35 = __VERIFIER_nondet_ulong() [L182] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L182] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L183] CALL assume_abort_if_not(var_1_35 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L183] RET assume_abort_if_not(var_1_35 <= 4294967295) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_36=16, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L184] var_1_36 = __VERIFIER_nondet_ulong() [L185] CALL assume_abort_if_not(var_1_36 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L185] RET assume_abort_if_not(var_1_36 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L186] CALL assume_abort_if_not(var_1_36 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L186] RET assume_abort_if_not(var_1_36 <= 4294967295) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_37=4, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L187] var_1_37 = __VERIFIER_nondet_ulong() [L188] CALL assume_abort_if_not(var_1_37 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L188] RET assume_abort_if_not(var_1_37 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L189] CALL assume_abort_if_not(var_1_37 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L189] RET assume_abort_if_not(var_1_37 <= 4294967295) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L190] var_1_38 = __VERIFIER_nondet_uchar() [L191] CALL assume_abort_if_not(var_1_38 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L191] RET assume_abort_if_not(var_1_38 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L192] CALL assume_abort_if_not(var_1_38 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L192] RET assume_abort_if_not(var_1_38 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L193] var_1_39 = __VERIFIER_nondet_uchar() [L194] CALL assume_abort_if_not(var_1_39 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L194] RET assume_abort_if_not(var_1_39 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L195] CALL assume_abort_if_not(var_1_39 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L195] RET assume_abort_if_not(var_1_39 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L196] var_1_41 = __VERIFIER_nondet_double() [L197] CALL assume_abort_if_not((var_1_41 >= -922337.2036854765600e+13F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 9223372.036854765600e+12F && var_1_41 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L197] RET assume_abort_if_not((var_1_41 >= -922337.2036854765600e+13F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 9223372.036854765600e+12F && var_1_41 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L198] var_1_42 = __VERIFIER_nondet_double() [L199] CALL assume_abort_if_not((var_1_42 >= -922337.2036854765600e+13F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 9223372.036854765600e+12F && var_1_42 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L199] RET assume_abort_if_not((var_1_42 >= -922337.2036854765600e+13F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 9223372.036854765600e+12F && var_1_42 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L200] var_1_43 = __VERIFIER_nondet_double() [L201] CALL assume_abort_if_not((var_1_43 >= -461168.6018427382800e+13F && var_1_43 <= -1.0e-20F) || (var_1_43 <= 4611686.018427382800e+12F && var_1_43 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L201] RET assume_abort_if_not((var_1_43 >= -461168.6018427382800e+13F && var_1_43 <= -1.0e-20F) || (var_1_43 <= 4611686.018427382800e+12F && var_1_43 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L202] var_1_44 = __VERIFIER_nondet_double() [L203] CALL assume_abort_if_not((var_1_44 >= -461168.6018427382800e+13F && var_1_44 <= -1.0e-20F) || (var_1_44 <= 4611686.018427382800e+12F && var_1_44 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L203] RET assume_abort_if_not((var_1_44 >= -461168.6018427382800e+13F && var_1_44 <= -1.0e-20F) || (var_1_44 <= 4611686.018427382800e+12F && var_1_44 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L204] var_1_47 = __VERIFIER_nondet_uchar() [L205] CALL assume_abort_if_not(var_1_47 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L205] RET assume_abort_if_not(var_1_47 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L206] CALL assume_abort_if_not(var_1_47 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L206] RET assume_abort_if_not(var_1_47 <= 127) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L207] var_1_50 = __VERIFIER_nondet_char() [L208] CALL assume_abort_if_not(var_1_50 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L208] RET assume_abort_if_not(var_1_50 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L209] CALL assume_abort_if_not(var_1_50 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L209] RET assume_abort_if_not(var_1_50 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L210] var_1_51 = __VERIFIER_nondet_char() [L211] CALL assume_abort_if_not(var_1_51 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=63, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=63, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L211] RET assume_abort_if_not(var_1_51 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=63, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L212] CALL assume_abort_if_not(var_1_51 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=63, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=63, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L212] RET assume_abort_if_not(var_1_51 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=63, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L213] var_1_52 = __VERIFIER_nondet_char() [L214] CALL assume_abort_if_not(var_1_52 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=63, var_1_52=-63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=63, var_1_52=-63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L214] RET assume_abort_if_not(var_1_52 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=63, var_1_52=-63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L215] CALL assume_abort_if_not(var_1_52 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=63, var_1_52=-63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=63, var_1_52=-63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L215] RET assume_abort_if_not(var_1_52 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=63, var_1_52=-63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L230] RET updateVariables() [L231] CALL step() [L71] EXPR var_1_34 ^ var_1_35 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=0, var_1_35=0, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=63, var_1_52=-63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L71] EXPR var_1_36 | var_1_37 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=63, var_1_52=-63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L71] COND FALSE !((var_1_34 ^ var_1_35) < (var_1_36 | var_1_37)) [L74] var_1_33 = (((((((var_1_39) < (var_1_38)) ? (var_1_39) : (var_1_38))) < 0 ) ? -((((var_1_39) < (var_1_38)) ? (var_1_39) : (var_1_38))) : ((((var_1_39) < (var_1_38)) ? (var_1_39) : (var_1_38))))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=4, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=254, var_1_39=4, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=63, var_1_52=-63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L76] COND TRUE (-32 & var_1_38) > var_1_35 [L77] var_1_40 = ((((var_1_41) > (var_1_42)) ? (var_1_41) : (var_1_42))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=4, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=254, var_1_39=4, var_1_40=4294967302, var_1_41=4294967302, var_1_42=4294967302, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=63, var_1_52=-63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L81] COND FALSE !(var_1_44 >= ((((var_1_41) < 0 ) ? -(var_1_41) : (var_1_41)))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=4, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=254, var_1_39=4, var_1_40=4294967302, var_1_41=4294967302, var_1_42=4294967302, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=63, var_1_52=-63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L88] COND TRUE var_1_44 <= (var_1_40 + var_1_43) [L89] var_1_45 = var_1_33 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=4, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=254, var_1_39=4, var_1_40=4294967302, var_1_41=4294967302, var_1_42=4294967302, var_1_45=4, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=63, var_1_52=-63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L92] COND FALSE !(var_1_44 > (var_1_43 + var_1_41)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=4, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=254, var_1_39=4, var_1_40=4294967302, var_1_41=4294967302, var_1_42=4294967302, var_1_45=4, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=63, var_1_52=-63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L99] var_1_48 = var_1_39 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=4, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=254, var_1_39=4, var_1_40=4294967302, var_1_41=4294967302, var_1_42=4294967302, var_1_45=4, var_1_46=0, var_1_47=127, var_1_48=4, var_1_49=-16, var_1_50=63, var_1_51=63, var_1_52=-63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L100] COND FALSE !(var_1_41 < var_1_40) [L103] var_1_49 = ((((((((var_1_50) < (var_1_51)) ? (var_1_50) : (var_1_51)))) > (var_1_52)) ? (((((var_1_50) < (var_1_51)) ? (var_1_50) : (var_1_51)))) : (var_1_52))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=4, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=254, var_1_39=4, var_1_40=4294967302, var_1_41=4294967302, var_1_42=4294967302, var_1_45=4, var_1_46=0, var_1_47=127, var_1_48=4, var_1_49=63, var_1_50=63, var_1_51=63, var_1_52=-63, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L105] var_1_53 = var_1_33 [L106] var_1_54 = var_1_44 [L107] var_1_55 = var_1_46 [L108] signed long int stepLocal_1 = last_1_var_1_1; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=4, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=254, var_1_39=4, var_1_40=4294967302, var_1_41=4294967302, var_1_42=4294967302, var_1_44=4294967303, var_1_45=4, var_1_46=0, var_1_47=127, var_1_48=4, var_1_49=63, var_1_50=63, var_1_51=63, var_1_52=-63, var_1_53=4, var_1_54=4294967303, var_1_55=0, var_1_7=0] [L109] COND FALSE !(stepLocal_1 != last_1_var_1_13) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=4, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=254, var_1_39=4, var_1_40=4294967302, var_1_41=4294967302, var_1_42=4294967302, var_1_44=4294967303, var_1_45=4, var_1_46=0, var_1_47=127, var_1_48=4, var_1_49=63, var_1_50=63, var_1_51=63, var_1_52=-63, var_1_53=4, var_1_54=4294967303, var_1_55=0, var_1_7=0] [L112] var_1_31 = var_1_13 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_33=4, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=254, var_1_39=4, var_1_40=4294967302, var_1_41=4294967302, var_1_42=4294967302, var_1_44=4294967303, var_1_45=4, var_1_46=0, var_1_47=127, var_1_48=4, var_1_49=63, var_1_50=63, var_1_51=63, var_1_52=-63, var_1_53=4, var_1_54=4294967303, var_1_55=0, var_1_7=0] [L113] COND FALSE !(\read(var_1_7)) [L116] var_1_17 = var_1_22 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=4294967301, var_1_1=64, var_1_22=4294967301, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_33=4, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=254, var_1_39=4, var_1_40=4294967302, var_1_41=4294967302, var_1_42=4294967302, var_1_44=4294967303, var_1_45=4, var_1_46=0, var_1_47=127, var_1_48=4, var_1_49=63, var_1_50=63, var_1_51=63, var_1_52=-63, var_1_53=4, var_1_54=4294967303, var_1_55=0, var_1_7=0] [L118] COND FALSE !(\read(var_1_7)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=4294967301, var_1_1=64, var_1_22=4294967301, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_33=4, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=254, var_1_39=4, var_1_40=4294967302, var_1_41=4294967302, var_1_42=4294967302, var_1_44=4294967303, var_1_45=4, var_1_46=0, var_1_47=127, var_1_48=4, var_1_49=63, var_1_50=63, var_1_51=63, var_1_52=-63, var_1_53=4, var_1_54=4294967303, var_1_55=0, var_1_7=0] [L121] var_1_32 = var_1_16 [L122] var_1_30 = var_1_32 [L123] unsigned char stepLocal_0 = var_1_13; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=4294967301, var_1_1=64, var_1_22=4294967301, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=4, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=254, var_1_39=4, var_1_40=4294967302, var_1_41=4294967302, var_1_42=4294967302, var_1_44=4294967303, var_1_45=4, var_1_46=0, var_1_47=127, var_1_48=4, var_1_49=63, var_1_50=63, var_1_51=63, var_1_52=-63, var_1_53=4, var_1_54=4294967303, var_1_55=0, var_1_7=0] [L124] EXPR var_1_32 >> var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=4294967301, var_1_1=64, var_1_22=4294967301, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=4, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=254, var_1_39=4, var_1_40=4294967302, var_1_41=4294967302, var_1_42=4294967302, var_1_44=4294967303, var_1_45=4, var_1_46=0, var_1_47=127, var_1_48=4, var_1_49=63, var_1_50=63, var_1_51=63, var_1_52=-63, var_1_53=4, var_1_54=4294967303, var_1_55=0, var_1_7=0] [L124] COND TRUE (var_1_32 >> var_1_32) < stepLocal_0 [L125] var_1_11 = var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=68, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=4294967301, var_1_1=64, var_1_22=4294967301, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=4, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=254, var_1_39=4, var_1_40=4294967302, var_1_41=4294967302, var_1_42=4294967302, var_1_44=4294967303, var_1_45=4, var_1_46=0, var_1_47=127, var_1_48=4, var_1_49=63, var_1_50=63, var_1_51=63, var_1_52=-63, var_1_53=4, var_1_54=4294967303, var_1_55=0, var_1_7=0] [L127] COND TRUE var_1_11 >= var_1_30 [L128] var_1_26 = (var_1_27 + var_1_28) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=68, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=4294967301, var_1_1=64, var_1_22=4294967301, var_1_24=10, var_1_26=-1, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=4, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=254, var_1_39=4, var_1_40=4294967302, var_1_41=4294967302, var_1_42=4294967302, var_1_44=4294967303, var_1_45=4, var_1_46=0, var_1_47=127, var_1_48=4, var_1_49=63, var_1_50=63, var_1_51=63, var_1_52=-63, var_1_53=4, var_1_54=4294967303, var_1_55=0, var_1_7=0] [L130] EXPR (var_1_31 + 4u) | var_1_30 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=68, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=4294967301, var_1_1=64, var_1_22=4294967301, var_1_24=10, var_1_26=-1, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=4, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=254, var_1_39=4, var_1_40=4294967302, var_1_41=4294967302, var_1_42=4294967302, var_1_44=4294967303, var_1_45=4, var_1_46=0, var_1_47=127, var_1_48=4, var_1_49=63, var_1_50=63, var_1_51=63, var_1_52=-63, var_1_53=4, var_1_54=4294967303, var_1_55=0, var_1_7=0] [L130] COND TRUE 32u < ((var_1_31 + 4u) | var_1_30) [L131] var_1_1 = (var_1_26 + (var_1_26 + var_1_32)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=68, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=4294967301, var_1_1=66, var_1_22=4294967301, var_1_24=10, var_1_26=-1, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=4, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=254, var_1_39=4, var_1_40=4294967302, var_1_41=4294967302, var_1_42=4294967302, var_1_44=4294967303, var_1_45=4, var_1_46=0, var_1_47=127, var_1_48=4, var_1_49=63, var_1_50=63, var_1_51=63, var_1_52=-63, var_1_53=4, var_1_54=4294967303, var_1_55=0, var_1_7=0] [L139] unsigned short int stepLocal_2 = var_1_30; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, stepLocal_2=68, var_1_11=68, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=4294967301, var_1_1=66, var_1_22=4294967301, var_1_24=10, var_1_26=-1, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=4, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=254, var_1_39=4, var_1_40=4294967302, var_1_41=4294967302, var_1_42=4294967302, var_1_44=4294967303, var_1_45=4, var_1_46=0, var_1_47=127, var_1_48=4, var_1_49=63, var_1_50=63, var_1_51=63, var_1_52=-63, var_1_53=4, var_1_54=4294967303, var_1_55=0, var_1_7=0] [L140] COND TRUE ! var_1_7 [L141] var_1_24 = (var_1_11 - ((((((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) < ((var_1_30 + var_1_15))) ? (((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) : ((var_1_30 + var_1_15))))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, stepLocal_2=68, var_1_11=68, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=4294967301, var_1_1=66, var_1_22=4294967301, var_1_24=0, var_1_26=-1, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=4, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=254, var_1_39=4, var_1_40=4294967302, var_1_41=4294967302, var_1_42=4294967302, var_1_44=4294967303, var_1_45=4, var_1_46=0, var_1_47=127, var_1_48=4, var_1_49=63, var_1_50=63, var_1_51=63, var_1_52=-63, var_1_53=4, var_1_54=4294967303, var_1_55=0, var_1_7=0] [L231] RET step() [L232] CALL, EXPR property() [L222] EXPR (var_1_31 + 4u) | var_1_30 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=4294967301, var_1_1=66, var_1_22=4294967301, var_1_24=0, var_1_26=-1, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=4, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=254, var_1_39=4, var_1_40=4294967302, var_1_41=4294967302, var_1_42=4294967302, var_1_44=4294967303, var_1_45=4, var_1_46=0, var_1_47=127, var_1_48=4, var_1_49=63, var_1_50=63, var_1_51=63, var_1_52=-63, var_1_53=4, var_1_54=4294967303, var_1_55=0, var_1_7=0] [L222] EXPR ((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=4294967301, var_1_1=66, var_1_22=4294967301, var_1_24=0, var_1_26=-1, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=4, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=254, var_1_39=4, var_1_40=4294967302, var_1_41=4294967302, var_1_42=4294967302, var_1_44=4294967303, var_1_45=4, var_1_46=0, var_1_47=127, var_1_48=4, var_1_49=63, var_1_50=63, var_1_51=63, var_1_52=-63, var_1_53=4, var_1_54=4294967303, var_1_55=0, var_1_7=0] [L222] EXPR var_1_32 >> var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=4294967301, var_1_1=66, var_1_22=4294967301, var_1_24=0, var_1_26=-1, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=4, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=254, var_1_39=4, var_1_40=4294967302, var_1_41=4294967302, var_1_42=4294967302, var_1_44=4294967303, var_1_45=4, var_1_46=0, var_1_47=127, var_1_48=4, var_1_49=63, var_1_50=63, var_1_51=63, var_1_52=-63, var_1_53=4, var_1_54=4294967303, var_1_55=0, var_1_7=0] [L222] EXPR ((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=4294967301, var_1_1=66, var_1_22=4294967301, var_1_24=0, var_1_26=-1, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=4, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=254, var_1_39=4, var_1_40=4294967302, var_1_41=4294967302, var_1_42=4294967302, var_1_44=4294967303, var_1_45=4, var_1_46=0, var_1_47=127, var_1_48=4, var_1_49=63, var_1_50=63, var_1_51=63, var_1_52=-63, var_1_53=4, var_1_54=4294967303, var_1_55=0, var_1_7=0] [L222-L223] return ((((((((((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1)) && ((last_1_var_1_1 != last_1_var_1_13) ? (var_1_13 == ((unsigned char) ((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16))))) : 1)) && (var_1_7 ? (var_1_17 == ((double) ((((((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) < (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23))))) ? (((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) : (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23)))))))) : (var_1_17 == ((double) var_1_22)))) && ((! var_1_7) ? (var_1_24 == ((signed long int) (var_1_11 - ((((((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) < ((var_1_30 + var_1_15))) ? (((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) : ((var_1_30 + var_1_15))))))) : ((var_1_11 < var_1_30) ? (var_1_24 == ((signed long int) -4)) : (var_1_24 == ((signed long int) var_1_26))))) && ((var_1_11 >= var_1_30) ? (var_1_26 == ((signed char) (var_1_27 + var_1_28))) : 1)) && (var_1_7 ? (var_1_29 == ((float) var_1_20)) : 1)) && (var_1_30 == ((unsigned short int) var_1_32))) && (var_1_31 == ((signed long int) var_1_13))) && (var_1_32 == ((unsigned char) var_1_16)) ; [L232] RET, EXPR property() [L232] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=4294967301, var_1_1=66, var_1_22=4294967301, var_1_24=0, var_1_26=-1, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=4, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=254, var_1_39=4, var_1_40=4294967302, var_1_41=4294967302, var_1_42=4294967302, var_1_44=4294967303, var_1_45=4, var_1_46=0, var_1_47=127, var_1_48=4, var_1_49=63, var_1_50=63, var_1_51=63, var_1_52=-63, var_1_53=4, var_1_54=4294967303, var_1_55=0, var_1_7=0] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=67, var_1_16=68, var_1_17=4294967301, var_1_1=66, var_1_22=4294967301, var_1_24=0, var_1_26=-1, var_1_27=-63, var_1_28=62, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=4, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=254, var_1_39=4, var_1_40=4294967302, var_1_41=4294967302, var_1_42=4294967302, var_1_44=4294967303, var_1_45=4, var_1_46=0, var_1_47=127, var_1_48=4, var_1_49=63, var_1_50=63, var_1_51=63, var_1_52=-63, var_1_53=4, var_1_54=4294967303, var_1_55=0, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 116 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.9s, OverallIterations: 13, TraceHistogramMax: 40, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3198 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3198 mSDsluCounter, 9754 SdHoareTripleChecker+Invalid, 3.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6576 mSDsCounter, 815 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2776 IncrementalHoareTripleChecker+Invalid, 3591 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 815 mSolverCounterUnsat, 3178 mSDtfsCounter, 2776 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1069 GetRequests, 999 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=521occurred in iteration=12, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 2553 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 3344 NumberOfCodeBlocks, 3344 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 3074 ConstructedInterpolants, 0 QuantifiedInterpolants, 5601 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 37440/37440 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-29 01:34:24,748 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b9458f-77e3-47d8-a219-4c9da3e3ce02/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b9458f-77e3-47d8-a219-4c9da3e3ce02/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b9458f-77e3-47d8-a219-4c9da3e3ce02/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_b9b9458f-77e3-47d8-a219-4c9da3e3ce02/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b9458f-77e3-47d8-a219-4c9da3e3ce02/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-63.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b9458f-77e3-47d8-a219-4c9da3e3ce02/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_b9b9458f-77e3-47d8-a219-4c9da3e3ce02/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 e0b44752a13f23ceb23e783beee65a99026269ecd792e26d1e2b1859d51a527d --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 01:34:26,759 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 01:34:26,824 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b9458f-77e3-47d8-a219-4c9da3e3ce02/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-29 01:34:26,837 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 01:34:26,838 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 01:34:26,865 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 01:34:26,866 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 01:34:26,867 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 01:34:26,868 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 01:34:26,868 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 01:34:26,869 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 01:34:26,869 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 01:34:26,870 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 01:34:26,870 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 01:34:26,871 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 01:34:26,872 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 01:34:26,872 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 01:34:26,873 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 01:34:26,873 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 01:34:26,874 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 01:34:26,874 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 01:34:26,875 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 01:34:26,876 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 01:34:26,876 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 01:34:26,876 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 01:34:26,877 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 01:34:26,877 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 01:34:26,877 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 01:34:26,878 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 01:34:26,878 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 01:34:26,879 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 01:34:26,879 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 01:34:26,880 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 01:34:26,880 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:34:26,880 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 01:34:26,880 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 01:34:26,880 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 01:34:26,881 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 01:34:26,881 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 01:34:26,881 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 01:34:26,882 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 01:34:26,882 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 01:34:26,882 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 01:34:26,882 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 01:34:26,883 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 01:34:26,883 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_b9b9458f-77e3-47d8-a219-4c9da3e3ce02/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_b9b9458f-77e3-47d8-a219-4c9da3e3ce02/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 -> e0b44752a13f23ceb23e783beee65a99026269ecd792e26d1e2b1859d51a527d [2023-11-29 01:34:27,182 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 01:34:27,207 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 01:34:27,210 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 01:34:27,211 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 01:34:27,212 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 01:34:27,213 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b9458f-77e3-47d8-a219-4c9da3e3ce02/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-63.i [2023-11-29 01:34:30,011 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 01:34:30,234 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 01:34:30,235 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b9458f-77e3-47d8-a219-4c9da3e3ce02/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-63.i [2023-11-29 01:34:30,246 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b9458f-77e3-47d8-a219-4c9da3e3ce02/bin/uautomizer-verify-BQ2R08f2Ya/data/bfa798aa6/16e4470b5fb440f38d7d65c6d8ed1ed8/FLAG5e82952cc [2023-11-29 01:34:30,258 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b9458f-77e3-47d8-a219-4c9da3e3ce02/bin/uautomizer-verify-BQ2R08f2Ya/data/bfa798aa6/16e4470b5fb440f38d7d65c6d8ed1ed8 [2023-11-29 01:34:30,261 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 01:34:30,263 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 01:34:30,264 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 01:34:30,264 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 01:34:30,269 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 01:34:30,269 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:34:30" (1/1) ... [2023-11-29 01:34:30,270 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63ed5dc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:34:30, skipping insertion in model container [2023-11-29 01:34:30,271 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:34:30" (1/1) ... [2023-11-29 01:34:30,306 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 01:34:30,429 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_b9b9458f-77e3-47d8-a219-4c9da3e3ce02/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-63.i[919,932] [2023-11-29 01:34:30,502 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:34:30,518 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 01:34:30,528 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_b9b9458f-77e3-47d8-a219-4c9da3e3ce02/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-63.i[919,932] [2023-11-29 01:34:30,570 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:34:30,590 INFO L206 MainTranslator]: Completed translation [2023-11-29 01:34:30,591 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:34:30 WrapperNode [2023-11-29 01:34:30,591 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 01:34:30,592 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 01:34:30,592 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 01:34:30,592 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 01:34:30,597 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:34:30" (1/1) ... [2023-11-29 01:34:30,612 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:34:30" (1/1) ... [2023-11-29 01:34:30,644 INFO L138 Inliner]: procedures = 27, calls = 53, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 247 [2023-11-29 01:34:30,644 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 01:34:30,645 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 01:34:30,659 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 01:34:30,660 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 01:34:30,671 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:34:30" (1/1) ... [2023-11-29 01:34:30,672 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:34:30" (1/1) ... [2023-11-29 01:34:30,699 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:34:30" (1/1) ... [2023-11-29 01:34:30,727 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-29 01:34:30,727 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:34:30" (1/1) ... [2023-11-29 01:34:30,727 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:34:30" (1/1) ... [2023-11-29 01:34:30,741 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:34:30" (1/1) ... [2023-11-29 01:34:30,745 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:34:30" (1/1) ... [2023-11-29 01:34:30,749 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:34:30" (1/1) ... [2023-11-29 01:34:30,751 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:34:30" (1/1) ... [2023-11-29 01:34:30,757 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 01:34:30,758 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 01:34:30,758 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 01:34:30,758 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 01:34:30,759 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:34:30" (1/1) ... [2023-11-29 01:34:30,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:34:30,776 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b9458f-77e3-47d8-a219-4c9da3e3ce02/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:34:30,786 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b9458f-77e3-47d8-a219-4c9da3e3ce02/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 01:34:30,792 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b9458f-77e3-47d8-a219-4c9da3e3ce02/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 01:34:30,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 01:34:30,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 01:34:30,823 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 01:34:30,823 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 01:34:30,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 01:34:30,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 01:34:30,931 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 01:34:30,934 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 01:34:38,042 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 01:34:38,116 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 01:34:38,116 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 01:34:38,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:34:38 BoogieIcfgContainer [2023-11-29 01:34:38,117 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 01:34:38,119 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 01:34:38,120 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 01:34:38,123 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 01:34:38,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 01:34:30" (1/3) ... [2023-11-29 01:34:38,124 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5547414d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:34:38, skipping insertion in model container [2023-11-29 01:34:38,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:34:30" (2/3) ... [2023-11-29 01:34:38,125 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5547414d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:34:38, skipping insertion in model container [2023-11-29 01:34:38,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:34:38" (3/3) ... [2023-11-29 01:34:38,126 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-cn_file-63.i [2023-11-29 01:34:38,145 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 01:34:38,145 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 01:34:38,193 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 01:34:38,199 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;@55aa0faa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 01:34:38,199 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 01:34:38,204 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 58 states have (on average 1.396551724137931) internal successors, (81), 59 states have internal predecessors, (81), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-11-29 01:34:38,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2023-11-29 01:34:38,222 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:34:38,223 INFO L195 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 01:34:38,223 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:34:38,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:34:38,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1057649171, now seen corresponding path program 1 times [2023-11-29 01:34:38,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:34:38,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [193577732] [2023-11-29 01:34:38,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:34:38,241 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-29 01:34:38,241 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b9458f-77e3-47d8-a219-4c9da3e3ce02/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:34:38,242 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b9458f-77e3-47d8-a219-4c9da3e3ce02/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-29 01:34:38,249 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b9458f-77e3-47d8-a219-4c9da3e3ce02/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-29 01:34:38,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:38,832 INFO L262 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 01:34:38,847 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:34:38,925 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 1158 proven. 0 refuted. 0 times theorem prover too weak. 1962 trivial. 0 not checked. [2023-11-29 01:34:38,926 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:34:38,927 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:34:38,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [193577732] [2023-11-29 01:34:38,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [193577732] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:34:38,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:34:38,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:34:38,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023285461] [2023-11-29 01:34:38,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:34:38,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 01:34:38,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:34:38,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 01:34:38,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 01:34:38,970 INFO L87 Difference]: Start difference. First operand has 101 states, 58 states have (on average 1.396551724137931) internal successors, (81), 59 states have internal predecessors, (81), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2023-11-29 01:34:42,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.06s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 01:34:42,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:34:42,086 INFO L93 Difference]: Finished difference Result 199 states and 360 transitions. [2023-11-29 01:34:42,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 01:34:42,120 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) Word has length 248 [2023-11-29 01:34:42,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:34:42,128 INFO L225 Difference]: With dead ends: 199 [2023-11-29 01:34:42,129 INFO L226 Difference]: Without dead ends: 99 [2023-11-29 01:34:42,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 247 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-29 01:34:42,136 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:34:42,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 153 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2023-11-29 01:34:42,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-11-29 01:34:42,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2023-11-29 01:34:42,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 57 states have (on average 1.3333333333333333) internal successors, (76), 57 states have internal predecessors, (76), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-11-29 01:34:42,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 156 transitions. [2023-11-29 01:34:42,188 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 156 transitions. Word has length 248 [2023-11-29 01:34:42,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:34:42,188 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 156 transitions. [2023-11-29 01:34:42,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2023-11-29 01:34:42,189 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 156 transitions. [2023-11-29 01:34:42,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2023-11-29 01:34:42,195 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:34:42,196 INFO L195 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 01:34:42,207 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b9458f-77e3-47d8-a219-4c9da3e3ce02/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-29 01:34:42,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b9458f-77e3-47d8-a219-4c9da3e3ce02/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-29 01:34:42,397 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:34:42,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:34:42,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1742766567, now seen corresponding path program 1 times [2023-11-29 01:34:42,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:34:42,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1424929028] [2023-11-29 01:34:42,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:34:42,400 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-29 01:34:42,400 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b9458f-77e3-47d8-a219-4c9da3e3ce02/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:34:42,401 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b9458f-77e3-47d8-a219-4c9da3e3ce02/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-29 01:34:42,402 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b9458f-77e3-47d8-a219-4c9da3e3ce02/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-29 01:34:42,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:42,992 INFO L262 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 01:34:43,008 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:34:45,519 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2023-11-29 01:34:45,520 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:34:45,520 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:34:45,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1424929028] [2023-11-29 01:34:45,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1424929028] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:34:45,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:34:45,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:34:45,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254759143] [2023-11-29 01:34:45,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:34:45,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 01:34:45,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:34:45,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 01:34:45,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:34:45,526 INFO L87 Difference]: Start difference. First operand 99 states and 156 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, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2023-11-29 01:34:50,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 01:34:51,735 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 01:34:55,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.94s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 01:34:55,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:34:55,990 INFO L93 Difference]: Finished difference Result 296 states and 467 transitions. [2023-11-29 01:34:56,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:34:56,018 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, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 248 [2023-11-29 01:34:56,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:34:56,022 INFO L225 Difference]: With dead ends: 296 [2023-11-29 01:34:56,022 INFO L226 Difference]: Without dead ends: 198 [2023-11-29 01:34:56,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 01:34:56,025 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 119 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 81 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2023-11-29 01:34:56,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 513 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 108 Invalid, 1 Unknown, 0 Unchecked, 10.3s Time] [2023-11-29 01:34:56,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2023-11-29 01:34:56,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 181. [2023-11-29 01:34:56,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 98 states have (on average 1.2857142857142858) internal successors, (126), 98 states have internal predecessors, (126), 80 states have call successors, (80), 2 states have call predecessors, (80), 2 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2023-11-29 01:34:56,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 286 transitions. [2023-11-29 01:34:56,074 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 286 transitions. Word has length 248 [2023-11-29 01:34:56,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:34:56,076 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 286 transitions. [2023-11-29 01:34:56,076 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, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2023-11-29 01:34:56,076 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 286 transitions. [2023-11-29 01:34:56,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2023-11-29 01:34:56,081 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:34:56,082 INFO L195 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 01:34:56,095 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b9458f-77e3-47d8-a219-4c9da3e3ce02/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-29 01:34:56,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b9458f-77e3-47d8-a219-4c9da3e3ce02/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-29 01:34:56,288 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:34:56,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:34:56,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1155960553, now seen corresponding path program 1 times [2023-11-29 01:34:56,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:34:56,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [635213652] [2023-11-29 01:34:56,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:34:56,290 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-29 01:34:56,290 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b9458f-77e3-47d8-a219-4c9da3e3ce02/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:34:56,291 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b9458f-77e3-47d8-a219-4c9da3e3ce02/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-29 01:34:56,292 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b9458f-77e3-47d8-a219-4c9da3e3ce02/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-29 01:34:56,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:34:56,807 INFO L262 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 01:34:56,813 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:34:56,857 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2023-11-29 01:34:56,857 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:34:56,858 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:34:56,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [635213652] [2023-11-29 01:34:56,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [635213652] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:34:56,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:34:56,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:34:56,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063193175] [2023-11-29 01:34:56,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:34:56,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:34:56,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:34:56,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:34:56,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:34:56,862 INFO L87 Difference]: Start difference. First operand 181 states and 286 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, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2023-11-29 01:35:00,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.07s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 01:35:01,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:35:01,310 INFO L93 Difference]: Finished difference Result 293 states and 461 transitions. [2023-11-29 01:35:01,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:35:01,310 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, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 248 [2023-11-29 01:35:01,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:35:01,313 INFO L225 Difference]: With dead ends: 293 [2023-11-29 01:35:01,314 INFO L226 Difference]: Without dead ends: 195 [2023-11-29 01:35:01,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 246 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-29 01:35:01,315 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 12 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2023-11-29 01:35:01,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 295 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2023-11-29 01:35:01,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2023-11-29 01:35:01,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 189. [2023-11-29 01:35:01,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 106 states have (on average 1.2924528301886793) internal successors, (137), 106 states have internal predecessors, (137), 80 states have call successors, (80), 2 states have call predecessors, (80), 2 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2023-11-29 01:35:01,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 297 transitions. [2023-11-29 01:35:01,349 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 297 transitions. Word has length 248 [2023-11-29 01:35:01,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:35:01,351 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 297 transitions. [2023-11-29 01:35:01,351 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, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2023-11-29 01:35:01,351 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 297 transitions. [2023-11-29 01:35:01,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2023-11-29 01:35:01,354 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:35:01,354 INFO L195 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 01:35:01,369 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b9458f-77e3-47d8-a219-4c9da3e3ce02/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-29 01:35:01,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b9458f-77e3-47d8-a219-4c9da3e3ce02/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-29 01:35:01,555 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:35:01,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:35:01,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1463998121, now seen corresponding path program 1 times [2023-11-29 01:35:01,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:35:01,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [457518649] [2023-11-29 01:35:01,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:35:01,556 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-29 01:35:01,556 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b9458f-77e3-47d8-a219-4c9da3e3ce02/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:35:01,557 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b9458f-77e3-47d8-a219-4c9da3e3ce02/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-29 01:35:01,558 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b9458f-77e3-47d8-a219-4c9da3e3ce02/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-29 01:35:02,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:35:02,126 INFO L262 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 01:35:02,133 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:35:03,001 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2023-11-29 01:35:03,002 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:35:03,002 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:35:03,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [457518649] [2023-11-29 01:35:03,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [457518649] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:35:03,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:35:03,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:35:03,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542319368] [2023-11-29 01:35:03,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:35:03,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:35:03,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:35:03,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:35:03,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:35:03,006 INFO L87 Difference]: Start difference. First operand 189 states and 297 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2023-11-29 01:35:06,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.77s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 01:35:11,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 01:35:11,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:35:11,051 INFO L93 Difference]: Finished difference Result 401 states and 629 transitions. [2023-11-29 01:35:11,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:35:11,051 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 248 [2023-11-29 01:35:11,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:35:11,056 INFO L225 Difference]: With dead ends: 401 [2023-11-29 01:35:11,056 INFO L226 Difference]: Without dead ends: 295 [2023-11-29 01:35:11,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 245 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-29 01:35:11,058 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 44 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:35:11,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 444 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 1 Unknown, 0 Unchecked, 8.0s Time] [2023-11-29 01:35:11,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2023-11-29 01:35:11,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 293. [2023-11-29 01:35:11,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 169 states have (on average 1.301775147928994) internal successors, (220), 169 states have internal predecessors, (220), 120 states have call successors, (120), 3 states have call predecessors, (120), 3 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2023-11-29 01:35:11,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 460 transitions. [2023-11-29 01:35:11,101 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 460 transitions. Word has length 248 [2023-11-29 01:35:11,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:35:11,102 INFO L495 AbstractCegarLoop]: Abstraction has 293 states and 460 transitions. [2023-11-29 01:35:11,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2023-11-29 01:35:11,103 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 460 transitions. [2023-11-29 01:35:11,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2023-11-29 01:35:11,104 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:35:11,105 INFO L195 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 01:35:11,116 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b9458f-77e3-47d8-a219-4c9da3e3ce02/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-29 01:35:11,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b9458f-77e3-47d8-a219-4c9da3e3ce02/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-29 01:35:11,308 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:35:11,308 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:35:11,308 INFO L85 PathProgramCache]: Analyzing trace with hash -2021622549, now seen corresponding path program 1 times [2023-11-29 01:35:11,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:35:11,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [296176156] [2023-11-29 01:35:11,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:35:11,309 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-29 01:35:11,309 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b9458f-77e3-47d8-a219-4c9da3e3ce02/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:35:11,310 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b9458f-77e3-47d8-a219-4c9da3e3ce02/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-29 01:35:11,311 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9b9458f-77e3-47d8-a219-4c9da3e3ce02/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-29 01:35:11,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:35:11,853 INFO L262 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-29 01:35:11,862 INFO L285 TraceCheckSpWp]: Computing forward predicates...