./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-15.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b 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_7031353f-c601-4568-a0c7-5b1cf75b2004/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7031353f-c601-4568-a0c7-5b1cf75b2004/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7031353f-c601-4568-a0c7-5b1cf75b2004/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7031353f-c601-4568-a0c7-5b1cf75b2004/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-15.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7031353f-c601-4568-a0c7-5b1cf75b2004/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7031353f-c601-4568-a0c7-5b1cf75b2004/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 944d6be29b18a7b057c10d85533dd285a58675394c7ffcf3e8926ec3db51ce25 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 23:05:40,284 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 23:05:40,382 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7031353f-c601-4568-a0c7-5b1cf75b2004/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 23:05:40,387 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 23:05:40,388 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 23:05:40,441 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 23:05:40,442 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 23:05:40,442 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 23:05:40,443 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 23:05:40,444 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 23:05:40,445 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 23:05:40,446 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 23:05:40,446 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 23:05:40,447 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 23:05:40,448 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 23:05:40,448 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 23:05:40,449 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 23:05:40,450 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 23:05:40,451 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 23:05:40,451 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 23:05:40,452 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 23:05:40,453 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 23:05:40,453 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 23:05:40,468 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 23:05:40,468 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 23:05:40,469 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 23:05:40,470 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 23:05:40,470 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 23:05:40,471 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:05:40,472 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 23:05:40,472 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 23:05:40,473 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 23:05:40,473 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 23:05:40,474 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 23:05:40,474 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 23:05:40,475 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 23:05:40,475 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 23:05:40,476 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 23:05:40,476 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 23:05:40,477 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_7031353f-c601-4568-a0c7-5b1cf75b2004/bin/uautomizer-verify-WvqO1wxjHP/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_7031353f-c601-4568-a0c7-5b1cf75b2004/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 944d6be29b18a7b057c10d85533dd285a58675394c7ffcf3e8926ec3db51ce25 [2023-11-06 23:05:40,825 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 23:05:40,911 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 23:05:40,914 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 23:05:40,915 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 23:05:40,917 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 23:05:40,918 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7031353f-c601-4568-a0c7-5b1cf75b2004/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-15.i [2023-11-06 23:05:44,228 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 23:05:44,519 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 23:05:44,520 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7031353f-c601-4568-a0c7-5b1cf75b2004/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-15.i [2023-11-06 23:05:44,568 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7031353f-c601-4568-a0c7-5b1cf75b2004/bin/uautomizer-verify-WvqO1wxjHP/data/4d02335ce/0e7cbd5b71cb4679b55bc68899b6b59b/FLAG097596bda [2023-11-06 23:05:44,584 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7031353f-c601-4568-a0c7-5b1cf75b2004/bin/uautomizer-verify-WvqO1wxjHP/data/4d02335ce/0e7cbd5b71cb4679b55bc68899b6b59b [2023-11-06 23:05:44,587 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 23:05:44,589 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 23:05:44,591 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 23:05:44,591 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 23:05:44,598 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 23:05:44,602 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:05:44" (1/1) ... [2023-11-06 23:05:44,604 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4018c1f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:05:44, skipping insertion in model container [2023-11-06 23:05:44,604 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:05:44" (1/1) ... [2023-11-06 23:05:44,658 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 23:05:44,832 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_7031353f-c601-4568-a0c7-5b1cf75b2004/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-15.i[916,929] [2023-11-06 23:05:44,901 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:05:44,917 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 23:05:44,927 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_7031353f-c601-4568-a0c7-5b1cf75b2004/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-15.i[916,929] [2023-11-06 23:05:44,957 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:05:44,977 INFO L206 MainTranslator]: Completed translation [2023-11-06 23:05:44,977 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:05:44 WrapperNode [2023-11-06 23:05:44,978 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 23:05:44,979 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 23:05:44,979 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 23:05:44,979 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 23:05:44,987 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:05:44" (1/1) ... [2023-11-06 23:05:45,001 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:05:44" (1/1) ... [2023-11-06 23:05:45,039 INFO L138 Inliner]: procedures = 29, calls = 162, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 472 [2023-11-06 23:05:45,039 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 23:05:45,040 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 23:05:45,040 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 23:05:45,041 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 23:05:45,051 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:05:44" (1/1) ... [2023-11-06 23:05:45,052 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:05:44" (1/1) ... [2023-11-06 23:05:45,060 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:05:44" (1/1) ... [2023-11-06 23:05:45,060 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:05:44" (1/1) ... [2023-11-06 23:05:45,077 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:05:44" (1/1) ... [2023-11-06 23:05:45,083 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:05:44" (1/1) ... [2023-11-06 23:05:45,087 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:05:44" (1/1) ... [2023-11-06 23:05:45,090 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:05:44" (1/1) ... [2023-11-06 23:05:45,097 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 23:05:45,098 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 23:05:45,098 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 23:05:45,098 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 23:05:45,099 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:05:44" (1/1) ... [2023-11-06 23:05:45,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:05:45,124 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7031353f-c601-4568-a0c7-5b1cf75b2004/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:05:45,150 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7031353f-c601-4568-a0c7-5b1cf75b2004/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 23:05:45,161 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7031353f-c601-4568-a0c7-5b1cf75b2004/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 23:05:45,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 23:05:45,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2023-11-06 23:05:45,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 23:05:45,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2023-11-06 23:05:45,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 23:05:45,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2023-11-06 23:05:45,210 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 23:05:45,211 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 23:05:45,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 23:05:45,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 23:05:45,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 23:05:45,366 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 23:05:45,369 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 23:05:46,118 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 23:05:46,128 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 23:05:46,140 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 23:05:46,143 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:05:46 BoogieIcfgContainer [2023-11-06 23:05:46,144 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 23:05:46,149 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 23:05:46,149 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 23:05:46,152 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 23:05:46,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:05:44" (1/3) ... [2023-11-06 23:05:46,153 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22f46751 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:05:46, skipping insertion in model container [2023-11-06 23:05:46,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:05:44" (2/3) ... [2023-11-06 23:05:46,154 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22f46751 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:05:46, skipping insertion in model container [2023-11-06 23:05:46,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:05:46" (3/3) ... [2023-11-06 23:05:46,156 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-15.i [2023-11-06 23:05:46,178 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 23:05:46,178 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 23:05:46,245 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 23:05:46,255 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=LoopsAndPotentialCycles, 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;@51252a83, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 23:05:46,256 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 23:05:46,262 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 98 states have (on average 1.4489795918367347) internal successors, (142), 99 states have internal predecessors, (142), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-06 23:05:46,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-11-06 23:05:46,286 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:05:46,288 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 23:05:46,289 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:05:46,297 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:05:46,298 INFO L85 PathProgramCache]: Analyzing trace with hash 2035840874, now seen corresponding path program 1 times [2023-11-06 23:05:46,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:05:46,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232148294] [2023-11-06 23:05:46,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:05:46,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:05:46,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:46,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:05:46,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:46,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:05:46,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:46,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 23:05:46,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:46,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 23:05:46,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:46,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:05:46,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:46,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:05:46,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:46,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 23:05:46,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:46,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 23:05:46,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:46,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 23:05:46,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:46,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:05:46,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:46,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 23:05:46,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:46,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 23:05:46,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:46,924 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 23:05:46,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:05:46,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232148294] [2023-11-06 23:05:46,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232148294] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:05:46,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:05:46,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:05:46,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717450356] [2023-11-06 23:05:46,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:05:46,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 23:05:46,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:05:46,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 23:05:46,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 23:05:46,982 INFO L87 Difference]: Start difference. First operand has 113 states, 98 states have (on average 1.4489795918367347) internal successors, (142), 99 states have internal predecessors, (142), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 23:05:47,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:05:47,026 INFO L93 Difference]: Finished difference Result 219 states and 338 transitions. [2023-11-06 23:05:47,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 23:05:47,029 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2023-11-06 23:05:47,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:05:47,041 INFO L225 Difference]: With dead ends: 219 [2023-11-06 23:05:47,041 INFO L226 Difference]: Without dead ends: 109 [2023-11-06 23:05:47,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 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-06 23:05:47,051 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:05:47,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:05:47,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-11-06 23:05:47,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2023-11-06 23:05:47,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 95 states have (on average 1.4) internal successors, (133), 95 states have internal predecessors, (133), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-06 23:05:47,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 157 transitions. [2023-11-06 23:05:47,116 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 157 transitions. Word has length 115 [2023-11-06 23:05:47,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:05:47,117 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 157 transitions. [2023-11-06 23:05:47,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 23:05:47,118 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions. [2023-11-06 23:05:47,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-11-06 23:05:47,123 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:05:47,124 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 23:05:47,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 23:05:47,124 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:05:47,125 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:05:47,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1301520678, now seen corresponding path program 1 times [2023-11-06 23:05:47,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:05:47,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645724630] [2023-11-06 23:05:47,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:05:47,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:05:47,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:47,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:05:47,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:47,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:05:47,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:47,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 23:05:47,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:47,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 23:05:47,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:47,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:05:47,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:47,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:05:47,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:47,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 23:05:47,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:47,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 23:05:47,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:47,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 23:05:47,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:47,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:05:47,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:47,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 23:05:47,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:47,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 23:05:47,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:47,773 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 23:05:47,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:05:47,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645724630] [2023-11-06 23:05:47,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645724630] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:05:47,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:05:47,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:05:47,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177442831] [2023-11-06 23:05:47,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:05:47,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:05:47,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:05:47,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:05:47,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:05:47,779 INFO L87 Difference]: Start difference. First operand 109 states and 157 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 23:05:47,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:05:47,823 INFO L93 Difference]: Finished difference Result 213 states and 308 transitions. [2023-11-06 23:05:47,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:05:47,824 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2023-11-06 23:05:47,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:05:47,833 INFO L225 Difference]: With dead ends: 213 [2023-11-06 23:05:47,836 INFO L226 Difference]: Without dead ends: 107 [2023-11-06 23:05:47,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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-06 23:05:47,843 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:05:47,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 301 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:05:47,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-11-06 23:05:47,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2023-11-06 23:05:47,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 93 states have (on average 1.3870967741935485) internal successors, (129), 93 states have internal predecessors, (129), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-06 23:05:47,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 153 transitions. [2023-11-06 23:05:47,882 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 153 transitions. Word has length 115 [2023-11-06 23:05:47,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:05:47,887 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 153 transitions. [2023-11-06 23:05:47,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 23:05:47,888 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 153 transitions. [2023-11-06 23:05:47,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-11-06 23:05:47,893 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:05:47,893 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 23:05:47,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 23:05:47,894 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:05:47,895 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:05:47,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1429684445, now seen corresponding path program 1 times [2023-11-06 23:05:47,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:05:47,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633610380] [2023-11-06 23:05:47,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:05:47,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:05:48,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:48,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:05:48,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:48,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:05:48,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:48,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 23:05:48,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:48,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 23:05:48,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:48,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:05:48,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:48,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:05:48,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:48,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 23:05:48,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:48,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 23:05:48,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:48,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 23:05:48,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:48,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:05:48,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:48,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 23:05:48,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:48,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 23:05:48,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:48,249 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 23:05:48,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:05:48,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633610380] [2023-11-06 23:05:48,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633610380] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:05:48,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:05:48,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:05:48,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284669968] [2023-11-06 23:05:48,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:05:48,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:05:48,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:05:48,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:05:48,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:05:48,256 INFO L87 Difference]: Start difference. First operand 107 states and 153 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 23:05:48,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:05:48,375 INFO L93 Difference]: Finished difference Result 217 states and 312 transitions. [2023-11-06 23:05:48,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:05:48,383 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2023-11-06 23:05:48,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:05:48,385 INFO L225 Difference]: With dead ends: 217 [2023-11-06 23:05:48,386 INFO L226 Difference]: Without dead ends: 113 [2023-11-06 23:05:48,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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-06 23:05:48,388 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 10 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:05:48,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 447 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:05:48,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-11-06 23:05:48,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 109. [2023-11-06 23:05:48,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 95 states have (on average 1.3789473684210527) internal successors, (131), 95 states have internal predecessors, (131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-06 23:05:48,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 155 transitions. [2023-11-06 23:05:48,411 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 155 transitions. Word has length 115 [2023-11-06 23:05:48,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:05:48,412 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 155 transitions. [2023-11-06 23:05:48,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 23:05:48,412 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 155 transitions. [2023-11-06 23:05:48,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-11-06 23:05:48,415 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:05:48,415 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 23:05:48,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 23:05:48,416 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:05:48,416 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:05:48,416 INFO L85 PathProgramCache]: Analyzing trace with hash 619703397, now seen corresponding path program 1 times [2023-11-06 23:05:48,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:05:48,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240938757] [2023-11-06 23:05:48,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:05:48,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:05:48,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:48,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:05:48,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:48,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:05:48,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:48,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 23:05:48,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:48,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 23:05:48,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:48,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:05:48,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:48,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:05:48,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:48,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 23:05:48,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:48,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 23:05:48,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:48,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 23:05:48,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:48,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:05:48,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:48,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 23:05:48,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:48,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 23:05:48,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:48,625 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 23:05:48,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:05:48,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240938757] [2023-11-06 23:05:48,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240938757] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:05:48,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:05:48,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:05:48,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223242286] [2023-11-06 23:05:48,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:05:48,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:05:48,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:05:48,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:05:48,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:05:48,636 INFO L87 Difference]: Start difference. First operand 109 states and 155 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 23:05:48,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:05:48,677 INFO L93 Difference]: Finished difference Result 239 states and 342 transitions. [2023-11-06 23:05:48,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:05:48,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2023-11-06 23:05:48,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:05:48,689 INFO L225 Difference]: With dead ends: 239 [2023-11-06 23:05:48,689 INFO L226 Difference]: Without dead ends: 133 [2023-11-06 23:05:48,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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-06 23:05:48,700 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 39 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:05:48,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 325 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:05:48,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-11-06 23:05:48,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 110. [2023-11-06 23:05:48,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 96 states have (on average 1.375) internal successors, (132), 96 states have internal predecessors, (132), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-06 23:05:48,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 156 transitions. [2023-11-06 23:05:48,733 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 156 transitions. Word has length 115 [2023-11-06 23:05:48,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:05:48,734 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 156 transitions. [2023-11-06 23:05:48,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 23:05:48,735 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 156 transitions. [2023-11-06 23:05:48,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-11-06 23:05:48,744 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:05:48,745 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 23:05:48,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 23:05:48,745 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:05:48,746 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:05:48,746 INFO L85 PathProgramCache]: Analyzing trace with hash 877868835, now seen corresponding path program 1 times [2023-11-06 23:05:48,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:05:48,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397083771] [2023-11-06 23:05:48,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:05:48,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:05:48,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:49,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:05:49,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:49,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:05:49,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:49,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 23:05:49,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:49,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 23:05:49,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:49,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:05:49,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:49,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:05:49,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:49,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 23:05:49,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:49,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 23:05:49,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:49,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 23:05:49,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:49,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:05:49,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:49,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 23:05:49,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:49,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 23:05:49,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:49,868 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 23:05:49,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:05:49,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397083771] [2023-11-06 23:05:49,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397083771] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:05:49,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:05:49,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 23:05:49,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104861122] [2023-11-06 23:05:49,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:05:49,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 23:05:49,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:05:49,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 23:05:49,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-06 23:05:49,873 INFO L87 Difference]: Start difference. First operand 110 states and 156 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 23:05:50,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:05:50,496 INFO L93 Difference]: Finished difference Result 282 states and 399 transitions. [2023-11-06 23:05:50,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 23:05:50,497 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2023-11-06 23:05:50,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:05:50,500 INFO L225 Difference]: With dead ends: 282 [2023-11-06 23:05:50,500 INFO L226 Difference]: Without dead ends: 175 [2023-11-06 23:05:50,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2023-11-06 23:05:50,508 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 362 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 23:05:50,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 605 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 23:05:50,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2023-11-06 23:05:50,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 119. [2023-11-06 23:05:50,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 105 states have (on average 1.3714285714285714) internal successors, (144), 105 states have internal predecessors, (144), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-06 23:05:50,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 168 transitions. [2023-11-06 23:05:50,548 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 168 transitions. Word has length 115 [2023-11-06 23:05:50,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:05:50,549 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 168 transitions. [2023-11-06 23:05:50,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 23:05:50,549 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 168 transitions. [2023-11-06 23:05:50,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-06 23:05:50,555 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:05:50,555 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 23:05:50,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 23:05:50,555 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:05:50,556 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:05:50,556 INFO L85 PathProgramCache]: Analyzing trace with hash -586503741, now seen corresponding path program 1 times [2023-11-06 23:05:50,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:05:50,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605953521] [2023-11-06 23:05:50,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:05:50,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:05:50,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:51,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:05:51,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:51,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:05:51,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:51,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 23:05:51,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:51,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 23:05:51,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:51,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:05:51,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:51,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:05:51,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:51,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 23:05:51,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:51,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 23:05:51,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:51,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 23:05:51,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:51,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:05:51,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:51,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 23:05:51,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:51,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 23:05:51,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:51,776 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 23:05:51,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:05:51,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605953521] [2023-11-06 23:05:51,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605953521] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:05:51,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:05:51,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 23:05:51,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907148103] [2023-11-06 23:05:51,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:05:51,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 23:05:51,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:05:51,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 23:05:51,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-06 23:05:51,779 INFO L87 Difference]: Start difference. First operand 119 states and 168 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 23:05:52,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:05:52,445 INFO L93 Difference]: Finished difference Result 310 states and 439 transitions. [2023-11-06 23:05:52,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 23:05:52,446 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2023-11-06 23:05:52,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:05:52,449 INFO L225 Difference]: With dead ends: 310 [2023-11-06 23:05:52,449 INFO L226 Difference]: Without dead ends: 194 [2023-11-06 23:05:52,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-11-06 23:05:52,452 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 206 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 23:05:52,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 758 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 23:05:52,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2023-11-06 23:05:52,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 128. [2023-11-06 23:05:52,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 114 states have (on average 1.3859649122807018) internal successors, (158), 114 states have internal predecessors, (158), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-06 23:05:52,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 182 transitions. [2023-11-06 23:05:52,490 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 182 transitions. Word has length 116 [2023-11-06 23:05:52,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:05:52,492 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 182 transitions. [2023-11-06 23:05:52,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 23:05:52,492 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 182 transitions. [2023-11-06 23:05:52,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-06 23:05:52,495 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:05:52,495 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 23:05:52,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 23:05:52,496 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:05:52,496 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:05:52,497 INFO L85 PathProgramCache]: Analyzing trace with hash 231144709, now seen corresponding path program 1 times [2023-11-06 23:05:52,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:05:52,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264913708] [2023-11-06 23:05:52,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:05:52,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:05:52,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:55,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:05:55,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:55,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:05:55,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:55,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 23:05:55,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:55,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 23:05:55,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:55,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:05:55,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:55,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:05:55,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:55,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 23:05:55,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:55,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 23:05:55,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:55,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 23:05:55,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:55,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:05:55,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:55,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 23:05:55,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:55,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 23:05:55,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:55,692 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 23:05:55,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:05:55,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264913708] [2023-11-06 23:05:55,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264913708] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:05:55,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:05:55,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-11-06 23:05:55,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289049558] [2023-11-06 23:05:55,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:05:55,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-06 23:05:55,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:05:55,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-06 23:05:55,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2023-11-06 23:05:55,696 INFO L87 Difference]: Start difference. First operand 128 states and 182 transitions. Second operand has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 8 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2023-11-06 23:05:56,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:05:56,368 INFO L93 Difference]: Finished difference Result 400 states and 572 transitions. [2023-11-06 23:05:56,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:05:56,369 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 8 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) Word has length 116 [2023-11-06 23:05:56,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:05:56,374 INFO L225 Difference]: With dead ends: 400 [2023-11-06 23:05:56,375 INFO L226 Difference]: Without dead ends: 275 [2023-11-06 23:05:56,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=123, Invalid=149, Unknown=0, NotChecked=0, Total=272 [2023-11-06 23:05:56,377 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 314 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 23:05:56,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 536 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 23:05:56,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2023-11-06 23:05:56,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 230. [2023-11-06 23:05:56,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 203 states have (on average 1.3842364532019704) internal successors, (281), 203 states have internal predecessors, (281), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-06 23:05:56,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 329 transitions. [2023-11-06 23:05:56,437 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 329 transitions. Word has length 116 [2023-11-06 23:05:56,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:05:56,439 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 329 transitions. [2023-11-06 23:05:56,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 8 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2023-11-06 23:05:56,440 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 329 transitions. [2023-11-06 23:05:56,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-11-06 23:05:56,443 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:05:56,443 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 23:05:56,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 23:05:56,444 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:05:56,444 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:05:56,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1087355081, now seen corresponding path program 1 times [2023-11-06 23:05:56,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:05:56,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917417214] [2023-11-06 23:05:56,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:05:56,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:05:56,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:58,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:05:58,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:58,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:05:58,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:58,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 23:05:58,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:58,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 23:05:58,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:58,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:05:58,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:58,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:05:58,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:58,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 23:05:58,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:58,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 23:05:58,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:58,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 23:05:58,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:58,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:05:58,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:58,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 23:05:58,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:58,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 23:05:58,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:58,269 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 23:05:58,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:05:58,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917417214] [2023-11-06 23:05:58,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917417214] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:05:58,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:05:58,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-06 23:05:58,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719030299] [2023-11-06 23:05:58,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:05:58,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-06 23:05:58,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:05:58,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-06 23:05:58,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2023-11-06 23:05:58,274 INFO L87 Difference]: Start difference. First operand 230 states and 329 transitions. Second operand has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 8 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2023-11-06 23:05:58,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:05:58,733 INFO L93 Difference]: Finished difference Result 529 states and 760 transitions. [2023-11-06 23:05:58,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:05:58,734 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 8 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) Word has length 117 [2023-11-06 23:05:58,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:05:58,737 INFO L225 Difference]: With dead ends: 529 [2023-11-06 23:05:58,738 INFO L226 Difference]: Without dead ends: 302 [2023-11-06 23:05:58,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=116, Unknown=0, NotChecked=0, Total=210 [2023-11-06 23:05:58,741 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 86 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 23:05:58,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 409 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 23:05:58,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2023-11-06 23:05:58,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 293. [2023-11-06 23:05:58,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 253 states have (on average 1.3675889328063242) internal successors, (346), 253 states have internal predecessors, (346), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 23:05:58,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 418 transitions. [2023-11-06 23:05:58,818 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 418 transitions. Word has length 117 [2023-11-06 23:05:58,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:05:58,819 INFO L495 AbstractCegarLoop]: Abstraction has 293 states and 418 transitions. [2023-11-06 23:05:58,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 8 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2023-11-06 23:05:58,820 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 418 transitions. [2023-11-06 23:05:58,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-06 23:05:58,822 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:05:58,822 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 23:05:58,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 23:05:58,823 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:05:58,823 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:05:58,824 INFO L85 PathProgramCache]: Analyzing trace with hash -61770006, now seen corresponding path program 1 times [2023-11-06 23:05:58,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:05:58,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606517934] [2023-11-06 23:05:58,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:05:58,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:05:59,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:59,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:05:59,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:59,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:05:59,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:59,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 23:05:59,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:59,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 23:05:59,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:59,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:05:59,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:59,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:05:59,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:59,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 23:05:59,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:59,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 23:05:59,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:59,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 23:05:59,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:59,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:05:59,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:59,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 23:05:59,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:59,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 23:05:59,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:59,868 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 23:05:59,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:05:59,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606517934] [2023-11-06 23:05:59,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606517934] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:05:59,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:05:59,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 23:05:59,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310699309] [2023-11-06 23:05:59,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:05:59,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 23:05:59,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:05:59,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 23:05:59,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:05:59,873 INFO L87 Difference]: Start difference. First operand 293 states and 418 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 23:06:00,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:06:00,320 INFO L93 Difference]: Finished difference Result 452 states and 647 transitions. [2023-11-06 23:06:00,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:06:00,321 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 118 [2023-11-06 23:06:00,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:06:00,326 INFO L225 Difference]: With dead ends: 452 [2023-11-06 23:06:00,326 INFO L226 Difference]: Without dead ends: 327 [2023-11-06 23:06:00,327 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-11-06 23:06:00,329 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 170 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 23:06:00,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 394 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 23:06:00,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2023-11-06 23:06:00,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 299. [2023-11-06 23:06:00,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 259 states have (on average 1.359073359073359) internal successors, (352), 259 states have internal predecessors, (352), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 23:06:00,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 424 transitions. [2023-11-06 23:06:00,420 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 424 transitions. Word has length 118 [2023-11-06 23:06:00,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:06:00,421 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 424 transitions. [2023-11-06 23:06:00,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 23:06:00,422 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 424 transitions. [2023-11-06 23:06:00,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-06 23:06:00,424 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:06:00,425 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 23:06:00,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 23:06:00,426 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:06:00,426 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:06:00,427 INFO L85 PathProgramCache]: Analyzing trace with hash 399872471, now seen corresponding path program 1 times [2023-11-06 23:06:00,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:06:00,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373104312] [2023-11-06 23:06:00,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:06:00,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:06:00,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:01,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:06:01,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:01,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:06:01,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:01,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 23:06:01,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:01,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 23:06:01,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:01,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:06:01,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:01,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:06:01,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:01,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 23:06:01,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:01,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 23:06:01,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:01,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 23:06:01,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:01,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:06:01,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:01,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 23:06:01,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:01,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 23:06:01,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:01,129 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 23:06:01,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:06:01,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373104312] [2023-11-06 23:06:01,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373104312] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:06:01,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:06:01,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 23:06:01,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745176217] [2023-11-06 23:06:01,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:06:01,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 23:06:01,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:06:01,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 23:06:01,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-06 23:06:01,132 INFO L87 Difference]: Start difference. First operand 299 states and 424 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 23:06:01,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:06:01,654 INFO L93 Difference]: Finished difference Result 666 states and 941 transitions. [2023-11-06 23:06:01,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 23:06:01,655 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2023-11-06 23:06:01,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:06:01,661 INFO L225 Difference]: With dead ends: 666 [2023-11-06 23:06:01,661 INFO L226 Difference]: Without dead ends: 434 [2023-11-06 23:06:01,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2023-11-06 23:06:01,663 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 274 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 23:06:01,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 703 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 23:06:01,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2023-11-06 23:06:01,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 326. [2023-11-06 23:06:01,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 286 states have (on average 1.3566433566433567) internal successors, (388), 286 states have internal predecessors, (388), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 23:06:01,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 460 transitions. [2023-11-06 23:06:01,748 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 460 transitions. Word has length 118 [2023-11-06 23:06:01,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:06:01,748 INFO L495 AbstractCegarLoop]: Abstraction has 326 states and 460 transitions. [2023-11-06 23:06:01,749 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 23:06:01,749 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 460 transitions. [2023-11-06 23:06:01,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-06 23:06:01,752 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:06:01,752 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 23:06:01,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 23:06:01,753 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:06:01,754 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:06:01,754 INFO L85 PathProgramCache]: Analyzing trace with hash -484650187, now seen corresponding path program 1 times [2023-11-06 23:06:01,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:06:01,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523041283] [2023-11-06 23:06:01,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:06:01,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:06:01,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:02,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:06:02,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:02,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:06:02,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:02,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 23:06:02,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:02,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 23:06:02,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:02,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:06:02,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:02,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:06:02,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:02,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 23:06:02,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:02,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 23:06:02,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:02,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 23:06:02,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:02,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:06:02,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:02,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 23:06:02,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:02,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 23:06:02,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:02,756 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 23:06:02,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:06:02,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523041283] [2023-11-06 23:06:02,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523041283] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:06:02,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:06:02,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 23:06:02,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201980255] [2023-11-06 23:06:02,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:06:02,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 23:06:02,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:06:02,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 23:06:02,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-06 23:06:02,760 INFO L87 Difference]: Start difference. First operand 326 states and 460 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 23:06:03,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:06:03,431 INFO L93 Difference]: Finished difference Result 709 states and 992 transitions. [2023-11-06 23:06:03,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 23:06:03,432 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), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 118 [2023-11-06 23:06:03,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:06:03,438 INFO L225 Difference]: With dead ends: 709 [2023-11-06 23:06:03,438 INFO L226 Difference]: Without dead ends: 450 [2023-11-06 23:06:03,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2023-11-06 23:06:03,440 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 375 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 23:06:03,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 532 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 23:06:03,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2023-11-06 23:06:03,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 339. [2023-11-06 23:06:03,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 299 states have (on average 1.3411371237458194) internal successors, (401), 299 states have internal predecessors, (401), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 23:06:03,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 473 transitions. [2023-11-06 23:06:03,533 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 473 transitions. Word has length 118 [2023-11-06 23:06:03,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:06:03,534 INFO L495 AbstractCegarLoop]: Abstraction has 339 states and 473 transitions. [2023-11-06 23:06:03,534 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), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 23:06:03,535 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 473 transitions. [2023-11-06 23:06:03,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-06 23:06:03,537 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:06:03,537 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 23:06:03,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 23:06:03,538 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:06:03,538 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:06:03,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1723454366, now seen corresponding path program 1 times [2023-11-06 23:06:03,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:06:03,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315987522] [2023-11-06 23:06:03,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:06:03,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:06:03,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:07,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:06:07,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:07,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:06:07,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:07,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 23:06:07,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:07,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 23:06:07,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:07,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:06:07,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:07,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:06:07,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:07,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 23:06:07,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:07,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 23:06:07,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:07,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 23:06:07,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:07,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:06:07,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:07,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 23:06:07,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:07,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 23:06:07,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:07,913 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 23:06:07,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:06:07,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315987522] [2023-11-06 23:06:07,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315987522] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:06:07,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:06:07,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2023-11-06 23:06:07,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748675572] [2023-11-06 23:06:07,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:06:07,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-06 23:06:07,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:06:07,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-06 23:06:07,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2023-11-06 23:06:07,917 INFO L87 Difference]: Start difference. First operand 339 states and 473 transitions. Second operand has 20 states, 20 states have (on average 3.1) internal successors, (62), 20 states have internal predecessors, (62), 8 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2023-11-06 23:06:10,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:06:10,549 INFO L93 Difference]: Finished difference Result 687 states and 951 transitions. [2023-11-06 23:06:10,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 23:06:10,550 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.1) internal successors, (62), 20 states have internal predecessors, (62), 8 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) Word has length 119 [2023-11-06 23:06:10,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:06:10,555 INFO L225 Difference]: With dead ends: 687 [2023-11-06 23:06:10,555 INFO L226 Difference]: Without dead ends: 416 [2023-11-06 23:06:10,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=153, Invalid=447, Unknown=0, NotChecked=0, Total=600 [2023-11-06 23:06:10,558 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 488 mSDsluCounter, 878 mSDsCounter, 0 mSdLazyCounter, 943 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 1079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-06 23:06:10,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 996 Invalid, 1079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 943 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-11-06 23:06:10,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2023-11-06 23:06:10,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 354. [2023-11-06 23:06:10,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 314 states have (on average 1.3343949044585988) internal successors, (419), 314 states have internal predecessors, (419), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 23:06:10,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 491 transitions. [2023-11-06 23:06:10,655 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 491 transitions. Word has length 119 [2023-11-06 23:06:10,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:06:10,659 INFO L495 AbstractCegarLoop]: Abstraction has 354 states and 491 transitions. [2023-11-06 23:06:10,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.1) internal successors, (62), 20 states have internal predecessors, (62), 8 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2023-11-06 23:06:10,659 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 491 transitions. [2023-11-06 23:06:10,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-06 23:06:10,662 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:06:10,662 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 23:06:10,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 23:06:10,663 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:06:10,663 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:06:10,663 INFO L85 PathProgramCache]: Analyzing trace with hash 2062039840, now seen corresponding path program 1 times [2023-11-06 23:06:10,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:06:10,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568624355] [2023-11-06 23:06:10,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:06:10,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:06:10,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:11,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:06:11,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:11,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:06:11,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:11,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 23:06:11,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:11,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 23:06:11,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:11,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:06:11,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:11,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:06:11,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:11,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 23:06:11,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:11,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 23:06:11,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:11,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 23:06:11,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:11,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:06:11,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:11,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 23:06:11,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:11,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 23:06:11,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:11,509 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 23:06:11,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:06:11,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568624355] [2023-11-06 23:06:11,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568624355] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:06:11,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:06:11,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 23:06:11,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217819404] [2023-11-06 23:06:11,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:06:11,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 23:06:11,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:06:11,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 23:06:11,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-06 23:06:11,513 INFO L87 Difference]: Start difference. First operand 354 states and 491 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 23:06:12,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:06:12,022 INFO L93 Difference]: Finished difference Result 759 states and 1051 transitions. [2023-11-06 23:06:12,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 23:06:12,023 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 119 [2023-11-06 23:06:12,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:06:12,026 INFO L225 Difference]: With dead ends: 759 [2023-11-06 23:06:12,027 INFO L226 Difference]: Without dead ends: 447 [2023-11-06 23:06:12,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-11-06 23:06:12,029 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 352 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 23:06:12,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 485 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 23:06:12,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2023-11-06 23:06:12,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 360. [2023-11-06 23:06:12,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 320 states have (on average 1.315625) internal successors, (421), 320 states have internal predecessors, (421), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 23:06:12,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 493 transitions. [2023-11-06 23:06:12,098 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 493 transitions. Word has length 119 [2023-11-06 23:06:12,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:06:12,102 INFO L495 AbstractCegarLoop]: Abstraction has 360 states and 493 transitions. [2023-11-06 23:06:12,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 23:06:12,103 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 493 transitions. [2023-11-06 23:06:12,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-06 23:06:12,105 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:06:12,105 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 23:06:12,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 23:06:12,106 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:06:12,106 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:06:12,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1050922590, now seen corresponding path program 1 times [2023-11-06 23:06:12,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:06:12,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868398689] [2023-11-06 23:06:12,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:06:12,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:06:12,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:15,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:06:15,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:15,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:06:15,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:16,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 23:06:16,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:16,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 23:06:16,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:16,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:06:16,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:16,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:06:16,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:16,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 23:06:16,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:16,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 23:06:16,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:16,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 23:06:16,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:16,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:06:16,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:16,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 23:06:16,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:16,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 23:06:16,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:16,149 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 23:06:16,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:06:16,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868398689] [2023-11-06 23:06:16,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868398689] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:06:16,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:06:16,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2023-11-06 23:06:16,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523583195] [2023-11-06 23:06:16,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:06:16,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-06 23:06:16,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:06:16,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-06 23:06:16,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2023-11-06 23:06:16,153 INFO L87 Difference]: Start difference. First operand 360 states and 493 transitions. Second operand has 21 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 21 states have internal predecessors, (62), 8 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2023-11-06 23:06:20,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:06:20,852 INFO L93 Difference]: Finished difference Result 823 states and 1124 transitions. [2023-11-06 23:06:20,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 23:06:20,853 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 21 states have internal predecessors, (62), 8 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) Word has length 119 [2023-11-06 23:06:20,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:06:20,856 INFO L225 Difference]: With dead ends: 823 [2023-11-06 23:06:20,856 INFO L226 Difference]: Without dead ends: 537 [2023-11-06 23:06:20,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=262, Invalid=730, Unknown=0, NotChecked=0, Total=992 [2023-11-06 23:06:20,858 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 803 mSDsluCounter, 1684 mSDsCounter, 0 mSdLazyCounter, 1606 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 803 SdHoareTripleChecker+Valid, 1864 SdHoareTripleChecker+Invalid, 1786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 1606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-11-06 23:06:20,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [803 Valid, 1864 Invalid, 1786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 1606 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-11-06 23:06:20,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2023-11-06 23:06:20,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 376. [2023-11-06 23:06:20,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 336 states have (on average 1.3125) internal successors, (441), 336 states have internal predecessors, (441), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 23:06:20,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 513 transitions. [2023-11-06 23:06:20,921 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 513 transitions. Word has length 119 [2023-11-06 23:06:20,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:06:20,922 INFO L495 AbstractCegarLoop]: Abstraction has 376 states and 513 transitions. [2023-11-06 23:06:20,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 21 states have internal predecessors, (62), 8 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2023-11-06 23:06:20,922 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 513 transitions. [2023-11-06 23:06:20,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-06 23:06:20,924 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:06:20,925 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 23:06:20,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 23:06:20,925 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:06:20,925 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:06:20,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1802160377, now seen corresponding path program 1 times [2023-11-06 23:06:20,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:06:20,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918533980] [2023-11-06 23:06:20,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:06:20,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:06:21,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:21,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:06:21,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:21,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:06:21,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:21,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 23:06:21,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:21,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 23:06:21,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:21,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:06:21,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:21,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:06:21,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:21,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 23:06:21,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:21,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 23:06:21,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:21,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 23:06:21,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:21,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:06:21,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:21,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 23:06:21,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:21,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 23:06:21,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:21,485 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 23:06:21,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:06:21,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918533980] [2023-11-06 23:06:21,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918533980] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:06:21,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:06:21,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 23:06:21,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410319737] [2023-11-06 23:06:21,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:06:21,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 23:06:21,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:06:21,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 23:06:21,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:06:21,488 INFO L87 Difference]: Start difference. First operand 376 states and 513 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 23:06:21,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:06:21,828 INFO L93 Difference]: Finished difference Result 523 states and 713 transitions. [2023-11-06 23:06:21,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:06:21,833 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 119 [2023-11-06 23:06:21,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:06:21,835 INFO L225 Difference]: With dead ends: 523 [2023-11-06 23:06:21,836 INFO L226 Difference]: Without dead ends: 359 [2023-11-06 23:06:21,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-11-06 23:06:21,837 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 253 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 23:06:21,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 401 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 23:06:21,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2023-11-06 23:06:21,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 355. [2023-11-06 23:06:21,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 315 states have (on average 1.3015873015873016) internal successors, (410), 315 states have internal predecessors, (410), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 23:06:21,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 482 transitions. [2023-11-06 23:06:21,899 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 482 transitions. Word has length 119 [2023-11-06 23:06:21,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:06:21,900 INFO L495 AbstractCegarLoop]: Abstraction has 355 states and 482 transitions. [2023-11-06 23:06:21,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 23:06:21,900 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 482 transitions. [2023-11-06 23:06:21,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-06 23:06:21,902 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:06:21,902 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 23:06:21,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 23:06:21,903 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:06:21,903 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:06:21,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1336011957, now seen corresponding path program 1 times [2023-11-06 23:06:21,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:06:21,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027772689] [2023-11-06 23:06:21,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:06:21,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:06:22,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:24,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:06:24,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:24,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:06:24,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:24,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 23:06:24,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:24,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 23:06:24,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:24,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:06:24,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:24,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:06:24,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:24,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 23:06:24,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:24,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 23:06:24,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:24,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 23:06:24,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:24,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:06:24,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:24,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 23:06:24,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:24,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 23:06:24,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:24,892 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 23:06:24,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:06:24,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027772689] [2023-11-06 23:06:24,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027772689] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:06:24,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:06:24,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2023-11-06 23:06:24,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033328074] [2023-11-06 23:06:24,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:06:24,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-06 23:06:24,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:06:24,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-06 23:06:24,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2023-11-06 23:06:24,895 INFO L87 Difference]: Start difference. First operand 355 states and 482 transitions. Second operand has 19 states, 19 states have (on average 3.263157894736842) internal successors, (62), 19 states have internal predecessors, (62), 8 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2023-11-06 23:06:26,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:06:26,984 INFO L93 Difference]: Finished difference Result 726 states and 987 transitions. [2023-11-06 23:06:26,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 23:06:26,985 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.263157894736842) internal successors, (62), 19 states have internal predecessors, (62), 8 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) Word has length 119 [2023-11-06 23:06:26,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:06:26,988 INFO L225 Difference]: With dead ends: 726 [2023-11-06 23:06:26,988 INFO L226 Difference]: Without dead ends: 448 [2023-11-06 23:06:26,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=210, Invalid=440, Unknown=0, NotChecked=0, Total=650 [2023-11-06 23:06:26,990 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 567 mSDsluCounter, 906 mSDsCounter, 0 mSdLazyCounter, 873 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 1033 SdHoareTripleChecker+Invalid, 974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-06 23:06:26,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [567 Valid, 1033 Invalid, 974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 873 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-06 23:06:26,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2023-11-06 23:06:27,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 347. [2023-11-06 23:06:27,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 307 states have (on average 1.299674267100977) internal successors, (399), 307 states have internal predecessors, (399), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 23:06:27,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 471 transitions. [2023-11-06 23:06:27,064 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 471 transitions. Word has length 119 [2023-11-06 23:06:27,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:06:27,064 INFO L495 AbstractCegarLoop]: Abstraction has 347 states and 471 transitions. [2023-11-06 23:06:27,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.263157894736842) internal successors, (62), 19 states have internal predecessors, (62), 8 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2023-11-06 23:06:27,065 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 471 transitions. [2023-11-06 23:06:27,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-06 23:06:27,067 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:06:27,067 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 23:06:27,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 23:06:27,067 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:06:27,068 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:06:27,068 INFO L85 PathProgramCache]: Analyzing trace with hash -967907686, now seen corresponding path program 1 times [2023-11-06 23:06:27,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:06:27,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147513102] [2023-11-06 23:06:27,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:06:27,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:06:27,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:28,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:06:28,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:28,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:06:28,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:28,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 23:06:28,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:28,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 23:06:28,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:28,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:06:28,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:28,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:06:28,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:28,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 23:06:28,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:28,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 23:06:28,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:28,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 23:06:28,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:28,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:06:28,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:28,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 23:06:28,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:28,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 23:06:28,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:28,639 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 23:06:28,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:06:28,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147513102] [2023-11-06 23:06:28,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147513102] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:06:28,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:06:28,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-06 23:06:28,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411951475] [2023-11-06 23:06:28,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:06:28,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 23:06:28,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:06:28,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 23:06:28,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-11-06 23:06:28,643 INFO L87 Difference]: Start difference. First operand 347 states and 471 transitions. Second operand has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 23:06:29,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:06:29,980 INFO L93 Difference]: Finished difference Result 864 states and 1171 transitions. [2023-11-06 23:06:29,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 23:06:29,981 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 120 [2023-11-06 23:06:29,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:06:29,986 INFO L225 Difference]: With dead ends: 864 [2023-11-06 23:06:29,986 INFO L226 Difference]: Without dead ends: 591 [2023-11-06 23:06:29,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2023-11-06 23:06:29,988 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 324 mSDsluCounter, 880 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-06 23:06:29,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 1040 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-06 23:06:29,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2023-11-06 23:06:30,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 356. [2023-11-06 23:06:30,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 316 states have (on average 1.2943037974683544) internal successors, (409), 316 states have internal predecessors, (409), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 23:06:30,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 481 transitions. [2023-11-06 23:06:30,113 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 481 transitions. Word has length 120 [2023-11-06 23:06:30,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:06:30,114 INFO L495 AbstractCegarLoop]: Abstraction has 356 states and 481 transitions. [2023-11-06 23:06:30,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 23:06:30,115 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 481 transitions. [2023-11-06 23:06:30,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-06 23:06:30,117 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:06:30,118 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 23:06:30,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-06 23:06:30,118 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:06:30,119 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:06:30,119 INFO L85 PathProgramCache]: Analyzing trace with hash 418295708, now seen corresponding path program 1 times [2023-11-06 23:06:30,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:06:30,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176025814] [2023-11-06 23:06:30,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:06:30,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:06:30,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:33,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:06:33,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:33,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:06:33,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:33,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 23:06:33,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:33,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 23:06:33,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:33,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:06:33,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:33,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:06:33,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:33,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 23:06:33,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:34,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 23:06:34,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:34,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 23:06:34,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:34,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:06:34,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:34,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 23:06:34,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:34,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 23:06:34,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:34,080 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 23:06:34,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:06:34,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176025814] [2023-11-06 23:06:34,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176025814] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:06:34,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:06:34,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2023-11-06 23:06:34,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165003597] [2023-11-06 23:06:34,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:06:34,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-06 23:06:34,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:06:34,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-06 23:06:34,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2023-11-06 23:06:34,085 INFO L87 Difference]: Start difference. First operand 356 states and 481 transitions. Second operand has 20 states, 20 states have (on average 3.15) internal successors, (63), 20 states have internal predecessors, (63), 8 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2023-11-06 23:06:37,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:06:37,954 INFO L93 Difference]: Finished difference Result 803 states and 1084 transitions. [2023-11-06 23:06:37,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 23:06:37,955 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.15) internal successors, (63), 20 states have internal predecessors, (63), 8 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) Word has length 120 [2023-11-06 23:06:37,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:06:37,958 INFO L225 Difference]: With dead ends: 803 [2023-11-06 23:06:37,958 INFO L226 Difference]: Without dead ends: 530 [2023-11-06 23:06:37,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=254, Invalid=676, Unknown=0, NotChecked=0, Total=930 [2023-11-06 23:06:37,960 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 752 mSDsluCounter, 1130 mSDsCounter, 0 mSdLazyCounter, 1169 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 1283 SdHoareTripleChecker+Invalid, 1331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 1169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-11-06 23:06:37,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [752 Valid, 1283 Invalid, 1331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 1169 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-11-06 23:06:37,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2023-11-06 23:06:38,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 362. [2023-11-06 23:06:38,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 322 states have (on average 1.295031055900621) internal successors, (417), 322 states have internal predecessors, (417), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 23:06:38,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 489 transitions. [2023-11-06 23:06:38,029 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 489 transitions. Word has length 120 [2023-11-06 23:06:38,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:06:38,030 INFO L495 AbstractCegarLoop]: Abstraction has 362 states and 489 transitions. [2023-11-06 23:06:38,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.15) internal successors, (63), 20 states have internal predecessors, (63), 8 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2023-11-06 23:06:38,030 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 489 transitions. [2023-11-06 23:06:38,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-06 23:06:38,033 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:06:38,033 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 23:06:38,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-06 23:06:38,033 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:06:38,034 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:06:38,034 INFO L85 PathProgramCache]: Analyzing trace with hash 666131493, now seen corresponding path program 1 times [2023-11-06 23:06:38,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:06:38,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178238343] [2023-11-06 23:06:38,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:06:38,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:06:38,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:38,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:06:38,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:38,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:06:38,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:38,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 23:06:38,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:38,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 23:06:38,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:38,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:06:38,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:38,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:06:38,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:38,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 23:06:38,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:38,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 23:06:38,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:38,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 23:06:38,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:38,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:06:38,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:38,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 23:06:38,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:38,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 23:06:38,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:38,530 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 23:06:38,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:06:38,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178238343] [2023-11-06 23:06:38,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178238343] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:06:38,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:06:38,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 23:06:38,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361663110] [2023-11-06 23:06:38,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:06:38,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 23:06:38,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:06:38,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 23:06:38,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:06:38,535 INFO L87 Difference]: Start difference. First operand 362 states and 489 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 23:06:38,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:06:38,931 INFO L93 Difference]: Finished difference Result 635 states and 859 transitions. [2023-11-06 23:06:38,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:06:38,932 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 120 [2023-11-06 23:06:38,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:06:38,936 INFO L225 Difference]: With dead ends: 635 [2023-11-06 23:06:38,936 INFO L226 Difference]: Without dead ends: 347 [2023-11-06 23:06:38,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-06 23:06:38,938 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 112 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 23:06:38,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 488 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 23:06:38,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2023-11-06 23:06:39,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 339. [2023-11-06 23:06:39,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 299 states have (on average 1.294314381270903) internal successors, (387), 299 states have internal predecessors, (387), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 23:06:39,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 459 transitions. [2023-11-06 23:06:39,015 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 459 transitions. Word has length 120 [2023-11-06 23:06:39,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:06:39,016 INFO L495 AbstractCegarLoop]: Abstraction has 339 states and 459 transitions. [2023-11-06 23:06:39,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 23:06:39,016 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 459 transitions. [2023-11-06 23:06:39,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-11-06 23:06:39,018 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:06:39,019 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 23:06:39,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-06 23:06:39,019 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:06:39,019 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:06:39,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1352900189, now seen corresponding path program 1 times [2023-11-06 23:06:39,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:06:39,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550478234] [2023-11-06 23:06:39,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:06:39,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:06:39,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:39,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:06:39,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:39,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:06:39,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:39,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 23:06:39,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:39,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 23:06:39,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:39,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:06:39,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:39,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:06:39,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:39,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 23:06:39,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:39,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 23:06:39,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:39,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 23:06:39,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:39,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:06:39,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:39,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 23:06:39,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:39,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 23:06:39,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:39,722 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 23:06:39,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:06:39,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550478234] [2023-11-06 23:06:39,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550478234] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:06:39,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:06:39,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 23:06:39,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213472676] [2023-11-06 23:06:39,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:06:39,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 23:06:39,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:06:39,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 23:06:39,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-06 23:06:39,726 INFO L87 Difference]: Start difference. First operand 339 states and 459 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 23:06:40,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:06:40,330 INFO L93 Difference]: Finished difference Result 815 states and 1106 transitions. [2023-11-06 23:06:40,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-06 23:06:40,331 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 121 [2023-11-06 23:06:40,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:06:40,335 INFO L225 Difference]: With dead ends: 815 [2023-11-06 23:06:40,335 INFO L226 Difference]: Without dead ends: 546 [2023-11-06 23:06:40,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2023-11-06 23:06:40,337 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 455 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 23:06:40,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 934 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 23:06:40,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2023-11-06 23:06:40,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 365. [2023-11-06 23:06:40,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 325 states have (on average 1.2892307692307692) internal successors, (419), 325 states have internal predecessors, (419), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 23:06:40,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 491 transitions. [2023-11-06 23:06:40,425 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 491 transitions. Word has length 121 [2023-11-06 23:06:40,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:06:40,425 INFO L495 AbstractCegarLoop]: Abstraction has 365 states and 491 transitions. [2023-11-06 23:06:40,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 23:06:40,426 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 491 transitions. [2023-11-06 23:06:40,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-11-06 23:06:40,428 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:06:40,428 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 23:06:40,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-06 23:06:40,429 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:06:40,429 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:06:40,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1134045471, now seen corresponding path program 1 times [2023-11-06 23:06:40,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:06:40,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028923370] [2023-11-06 23:06:40,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:06:40,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:06:40,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:40,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:06:40,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:40,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:06:40,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:40,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 23:06:40,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:40,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 23:06:40,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:40,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:06:40,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:40,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:06:40,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:40,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 23:06:40,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:40,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 23:06:40,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:40,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 23:06:40,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:40,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:06:40,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:40,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 23:06:40,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:40,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 23:06:40,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:40,931 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 23:06:40,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:06:40,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028923370] [2023-11-06 23:06:40,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028923370] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:06:40,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:06:40,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 23:06:40,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946268225] [2023-11-06 23:06:40,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:06:40,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 23:06:40,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:06:40,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 23:06:40,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:06:40,935 INFO L87 Difference]: Start difference. First operand 365 states and 491 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 23:06:41,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:06:41,378 INFO L93 Difference]: Finished difference Result 796 states and 1071 transitions. [2023-11-06 23:06:41,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 23:06:41,379 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 121 [2023-11-06 23:06:41,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:06:41,382 INFO L225 Difference]: With dead ends: 796 [2023-11-06 23:06:41,383 INFO L226 Difference]: Without dead ends: 501 [2023-11-06 23:06:41,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-06 23:06:41,385 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 255 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 23:06:41,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 628 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 23:06:41,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2023-11-06 23:06:41,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 365. [2023-11-06 23:06:41,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 325 states have (on average 1.2861538461538462) internal successors, (418), 325 states have internal predecessors, (418), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 23:06:41,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 490 transitions. [2023-11-06 23:06:41,470 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 490 transitions. Word has length 121 [2023-11-06 23:06:41,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:06:41,470 INFO L495 AbstractCegarLoop]: Abstraction has 365 states and 490 transitions. [2023-11-06 23:06:41,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 23:06:41,471 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 490 transitions. [2023-11-06 23:06:41,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-11-06 23:06:41,473 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:06:41,473 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 23:06:41,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-06 23:06:41,473 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:06:41,474 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:06:41,474 INFO L85 PathProgramCache]: Analyzing trace with hash 348861872, now seen corresponding path program 1 times [2023-11-06 23:06:41,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:06:41,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847365415] [2023-11-06 23:06:41,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:06:41,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:06:41,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:44,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:06:44,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:44,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:06:44,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:44,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 23:06:44,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:44,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 23:06:44,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:44,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:06:44,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:44,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:06:44,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:45,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 23:06:45,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:45,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 23:06:45,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:45,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 23:06:45,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:45,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:06:45,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:45,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 23:06:45,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:45,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 23:06:45,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:45,059 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 23:06:45,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:06:45,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847365415] [2023-11-06 23:06:45,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847365415] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:06:45,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:06:45,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2023-11-06 23:06:45,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89574069] [2023-11-06 23:06:45,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:06:45,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-06 23:06:45,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:06:45,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-06 23:06:45,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2023-11-06 23:06:45,063 INFO L87 Difference]: Start difference. First operand 365 states and 490 transitions. Second operand has 20 states, 19 states have (on average 3.3684210526315788) internal successors, (64), 19 states have internal predecessors, (64), 8 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2023-11-06 23:06:48,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:06:48,510 INFO L93 Difference]: Finished difference Result 638 states and 843 transitions. [2023-11-06 23:06:48,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-06 23:06:48,517 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.3684210526315788) internal successors, (64), 19 states have internal predecessors, (64), 8 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) Word has length 121 [2023-11-06 23:06:48,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:06:48,523 INFO L225 Difference]: With dead ends: 638 [2023-11-06 23:06:48,523 INFO L226 Difference]: Without dead ends: 478 [2023-11-06 23:06:48,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=147, Invalid=609, Unknown=0, NotChecked=0, Total=756 [2023-11-06 23:06:48,526 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 355 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 1231 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 1308 SdHoareTripleChecker+Invalid, 1250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:06:48,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 1308 Invalid, 1250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1231 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-11-06 23:06:48,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2023-11-06 23:06:48,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 399. [2023-11-06 23:06:48,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 356 states have (on average 1.2724719101123596) internal successors, (453), 356 states have internal predecessors, (453), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 23:06:48,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 525 transitions. [2023-11-06 23:06:48,628 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 525 transitions. Word has length 121 [2023-11-06 23:06:48,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:06:48,629 INFO L495 AbstractCegarLoop]: Abstraction has 399 states and 525 transitions. [2023-11-06 23:06:48,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.3684210526315788) internal successors, (64), 19 states have internal predecessors, (64), 8 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2023-11-06 23:06:48,629 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 525 transitions. [2023-11-06 23:06:48,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-11-06 23:06:48,632 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:06:48,632 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 23:06:48,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-06 23:06:48,633 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:06:48,633 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:06:48,633 INFO L85 PathProgramCache]: Analyzing trace with hash 410901486, now seen corresponding path program 1 times [2023-11-06 23:06:48,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:06:48,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187144784] [2023-11-06 23:06:48,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:06:48,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:06:48,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:52,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:06:52,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:52,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:06:52,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:52,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 23:06:52,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:52,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 23:06:52,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:52,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:06:52,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:52,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:06:52,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:52,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 23:06:52,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:52,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 23:06:52,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:52,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 23:06:52,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:52,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:06:52,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:52,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 23:06:52,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:52,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 23:06:52,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:52,577 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 15 proven. 18 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2023-11-06 23:06:52,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:06:52,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187144784] [2023-11-06 23:06:52,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187144784] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:06:52,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026515681] [2023-11-06 23:06:52,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:06:52,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:06:52,579 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7031353f-c601-4568-a0c7-5b1cf75b2004/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:06:52,584 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7031353f-c601-4568-a0c7-5b1cf75b2004/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:06:52,594 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7031353f-c601-4568-a0c7-5b1cf75b2004/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 23:06:52,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:52,943 INFO L262 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-06 23:06:52,965 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:06:54,036 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-06 23:06:54,085 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-06 23:06:54,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:06:54,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:06:54,378 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2023-11-06 23:06:54,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:06:54,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:06:54,512 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2023-11-06 23:06:54,623 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2023-11-06 23:06:54,678 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 23:06:54,678 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:06:54,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026515681] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:06:54,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 23:06:54,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [23] total 29 [2023-11-06 23:06:54,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81984063] [2023-11-06 23:06:54,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:06:54,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 23:06:54,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:06:54,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 23:06:54,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=705, Unknown=0, NotChecked=0, Total=812 [2023-11-06 23:06:54,682 INFO L87 Difference]: Start difference. First operand 399 states and 525 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 23:06:55,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:06:55,549 INFO L93 Difference]: Finished difference Result 701 states and 925 transitions. [2023-11-06 23:06:55,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 23:06:55,550 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 121 [2023-11-06 23:06:55,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:06:55,554 INFO L225 Difference]: With dead ends: 701 [2023-11-06 23:06:55,554 INFO L226 Difference]: Without dead ends: 515 [2023-11-06 23:06:55,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 138 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=126, Invalid=866, Unknown=0, NotChecked=0, Total=992 [2023-11-06 23:06:55,556 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 239 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 23:06:55,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 728 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 23:06:55,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2023-11-06 23:06:55,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 378. [2023-11-06 23:06:55,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 335 states have (on average 1.2746268656716417) internal successors, (427), 335 states have internal predecessors, (427), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 23:06:55,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 499 transitions. [2023-11-06 23:06:55,680 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 499 transitions. Word has length 121 [2023-11-06 23:06:55,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:06:55,682 INFO L495 AbstractCegarLoop]: Abstraction has 378 states and 499 transitions. [2023-11-06 23:06:55,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 23:06:55,682 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 499 transitions. [2023-11-06 23:06:55,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-06 23:06:55,683 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:06:55,684 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 23:06:55,698 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7031353f-c601-4568-a0c7-5b1cf75b2004/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 23:06:55,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7031353f-c601-4568-a0c7-5b1cf75b2004/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:06:55,892 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:06:55,892 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:06:55,892 INFO L85 PathProgramCache]: Analyzing trace with hash 23744931, now seen corresponding path program 1 times [2023-11-06 23:06:55,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:06:55,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269127782] [2023-11-06 23:06:55,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:06:55,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:06:56,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:57,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:06:57,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:57,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:06:57,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:57,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 23:06:57,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:57,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 23:06:57,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:57,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:06:57,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:57,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:06:57,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:57,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 23:06:57,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:57,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 23:06:57,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:57,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 23:06:57,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:57,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:06:57,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:57,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 23:06:57,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:57,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 23:06:57,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:57,171 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 23:06:57,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:06:57,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269127782] [2023-11-06 23:06:57,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269127782] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:06:57,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:06:57,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-06 23:06:57,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180598974] [2023-11-06 23:06:57,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:06:57,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-06 23:06:57,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:06:57,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-06 23:06:57,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2023-11-06 23:06:57,174 INFO L87 Difference]: Start difference. First operand 378 states and 499 transitions. Second operand has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 23:06:58,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:06:58,239 INFO L93 Difference]: Finished difference Result 884 states and 1161 transitions. [2023-11-06 23:06:58,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-06 23:06:58,240 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2023-11-06 23:06:58,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:06:58,246 INFO L225 Difference]: With dead ends: 884 [2023-11-06 23:06:58,247 INFO L226 Difference]: Without dead ends: 580 [2023-11-06 23:06:58,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=146, Invalid=454, Unknown=0, NotChecked=0, Total=600 [2023-11-06 23:06:58,249 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 397 mSDsluCounter, 1065 mSDsCounter, 0 mSdLazyCounter, 692 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 1191 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 23:06:58,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 1191 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 692 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 23:06:58,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2023-11-06 23:06:58,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 396. [2023-11-06 23:06:58,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 353 states have (on average 1.2691218130311614) internal successors, (448), 353 states have internal predecessors, (448), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 23:06:58,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 520 transitions. [2023-11-06 23:06:58,353 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 520 transitions. Word has length 122 [2023-11-06 23:06:58,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:06:58,354 INFO L495 AbstractCegarLoop]: Abstraction has 396 states and 520 transitions. [2023-11-06 23:06:58,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 23:06:58,354 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 520 transitions. [2023-11-06 23:06:58,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-06 23:06:58,356 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:06:58,356 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 23:06:58,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-06 23:06:58,356 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:06:58,357 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:06:58,357 INFO L85 PathProgramCache]: Analyzing trace with hash 724809509, now seen corresponding path program 1 times [2023-11-06 23:06:58,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:06:58,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642631568] [2023-11-06 23:06:58,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:06:58,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:06:58,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:59,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:06:59,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:59,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:06:59,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:59,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 23:06:59,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:59,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 23:06:59,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:59,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:06:59,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:59,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:06:59,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:59,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 23:06:59,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:59,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 23:06:59,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:59,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 23:06:59,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:59,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:06:59,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:59,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 23:06:59,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:59,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 23:06:59,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:59,364 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 23:06:59,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:06:59,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642631568] [2023-11-06 23:06:59,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642631568] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:06:59,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:06:59,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 23:06:59,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149362789] [2023-11-06 23:06:59,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:06:59,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 23:06:59,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:06:59,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 23:06:59,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-06 23:06:59,370 INFO L87 Difference]: Start difference. First operand 396 states and 520 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 23:07:00,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:07:00,339 INFO L93 Difference]: Finished difference Result 935 states and 1232 transitions. [2023-11-06 23:07:00,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 23:07:00,345 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2023-11-06 23:07:00,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:07:00,350 INFO L225 Difference]: With dead ends: 935 [2023-11-06 23:07:00,351 INFO L226 Difference]: Without dead ends: 631 [2023-11-06 23:07:00,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2023-11-06 23:07:00,353 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 309 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 23:07:00,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 689 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 23:07:00,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2023-11-06 23:07:00,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 396. [2023-11-06 23:07:00,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 353 states have (on average 1.2662889518413598) internal successors, (447), 353 states have internal predecessors, (447), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 23:07:00,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 519 transitions. [2023-11-06 23:07:00,463 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 519 transitions. Word has length 122 [2023-11-06 23:07:00,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:07:00,464 INFO L495 AbstractCegarLoop]: Abstraction has 396 states and 519 transitions. [2023-11-06 23:07:00,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 23:07:00,464 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 519 transitions. [2023-11-06 23:07:00,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-06 23:07:00,466 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:07:00,466 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 23:07:00,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-06 23:07:00,467 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:07:00,467 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:07:00,467 INFO L85 PathProgramCache]: Analyzing trace with hash 324379630, now seen corresponding path program 1 times [2023-11-06 23:07:00,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:07:00,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165369456] [2023-11-06 23:07:00,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:07:00,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:07:00,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:00,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:07:00,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:00,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:07:00,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:00,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 23:07:00,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:00,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 23:07:00,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:00,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:07:00,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:00,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:07:00,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:00,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 23:07:00,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:00,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 23:07:00,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:00,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 23:07:00,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:00,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:07:00,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:00,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 23:07:00,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:00,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 23:07:00,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:00,942 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 23:07:00,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:07:00,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165369456] [2023-11-06 23:07:00,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165369456] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:07:00,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:07:00,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 23:07:00,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752138242] [2023-11-06 23:07:00,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:07:00,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:07:00,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:07:00,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:07:00,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:07:00,946 INFO L87 Difference]: Start difference. First operand 396 states and 519 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 23:07:01,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:07:01,257 INFO L93 Difference]: Finished difference Result 787 states and 1041 transitions. [2023-11-06 23:07:01,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:07:01,258 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2023-11-06 23:07:01,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:07:01,262 INFO L225 Difference]: With dead ends: 787 [2023-11-06 23:07:01,263 INFO L226 Difference]: Without dead ends: 483 [2023-11-06 23:07:01,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:07:01,264 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 154 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 23:07:01,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 475 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 23:07:01,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2023-11-06 23:07:01,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 412. [2023-11-06 23:07:01,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 369 states have (on average 1.2601626016260163) internal successors, (465), 369 states have internal predecessors, (465), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 23:07:01,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 537 transitions. [2023-11-06 23:07:01,367 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 537 transitions. Word has length 122 [2023-11-06 23:07:01,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:07:01,367 INFO L495 AbstractCegarLoop]: Abstraction has 412 states and 537 transitions. [2023-11-06 23:07:01,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 23:07:01,367 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 537 transitions. [2023-11-06 23:07:01,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-06 23:07:01,370 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:07:01,371 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 23:07:01,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-06 23:07:01,371 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:07:01,371 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:07:01,372 INFO L85 PathProgramCache]: Analyzing trace with hash 725344805, now seen corresponding path program 1 times [2023-11-06 23:07:01,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:07:01,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921318293] [2023-11-06 23:07:01,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:07:01,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:07:01,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:02,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:07:02,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:02,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:07:02,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:02,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 23:07:02,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:02,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 23:07:02,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:02,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:07:02,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:02,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:07:02,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:02,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 23:07:02,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:02,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 23:07:02,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:02,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 23:07:02,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:02,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:07:02,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:02,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 23:07:02,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:02,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 23:07:02,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:02,365 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 23:07:02,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:07:02,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921318293] [2023-11-06 23:07:02,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921318293] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:07:02,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:07:02,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 23:07:02,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898890941] [2023-11-06 23:07:02,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:07:02,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 23:07:02,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:07:02,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 23:07:02,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-06 23:07:02,368 INFO L87 Difference]: Start difference. First operand 412 states and 537 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 23:07:03,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:07:03,082 INFO L93 Difference]: Finished difference Result 896 states and 1168 transitions. [2023-11-06 23:07:03,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 23:07:03,082 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2023-11-06 23:07:03,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:07:03,086 INFO L225 Difference]: With dead ends: 896 [2023-11-06 23:07:03,087 INFO L226 Difference]: Without dead ends: 576 [2023-11-06 23:07:03,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2023-11-06 23:07:03,088 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 270 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 23:07:03,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 612 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 23:07:03,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2023-11-06 23:07:03,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 446. [2023-11-06 23:07:03,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 403 states have (on average 1.2531017369727047) internal successors, (505), 403 states have internal predecessors, (505), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 23:07:03,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 577 transitions. [2023-11-06 23:07:03,189 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 577 transitions. Word has length 122 [2023-11-06 23:07:03,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:07:03,189 INFO L495 AbstractCegarLoop]: Abstraction has 446 states and 577 transitions. [2023-11-06 23:07:03,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 23:07:03,190 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 577 transitions. [2023-11-06 23:07:03,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-06 23:07:03,191 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:07:03,192 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 23:07:03,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-06 23:07:03,192 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:07:03,192 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:07:03,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1426409383, now seen corresponding path program 1 times [2023-11-06 23:07:03,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:07:03,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628839024] [2023-11-06 23:07:03,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:07:03,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:07:03,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:05,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:07:05,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:05,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:07:05,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:05,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 23:07:05,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:05,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 23:07:05,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:05,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:07:05,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:05,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:07:05,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:05,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 23:07:05,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:05,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 23:07:05,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:05,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 23:07:05,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:05,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:07:05,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:05,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 23:07:05,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:05,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 23:07:05,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:05,335 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 23:07:05,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:07:05,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628839024] [2023-11-06 23:07:05,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628839024] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:07:05,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:07:05,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-06 23:07:05,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375924733] [2023-11-06 23:07:05,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:07:05,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-06 23:07:05,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:07:05,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-06 23:07:05,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2023-11-06 23:07:05,338 INFO L87 Difference]: Start difference. First operand 446 states and 577 transitions. Second operand has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 23:07:08,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:07:08,179 INFO L93 Difference]: Finished difference Result 879 states and 1143 transitions. [2023-11-06 23:07:08,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-06 23:07:08,180 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2023-11-06 23:07:08,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:07:08,184 INFO L225 Difference]: With dead ends: 879 [2023-11-06 23:07:08,184 INFO L226 Difference]: Without dead ends: 559 [2023-11-06 23:07:08,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=128, Invalid=472, Unknown=0, NotChecked=0, Total=600 [2023-11-06 23:07:08,186 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 306 mSDsluCounter, 1217 mSDsCounter, 0 mSdLazyCounter, 972 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 1364 SdHoareTripleChecker+Invalid, 979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 972 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-06 23:07:08,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 1364 Invalid, 979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 972 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-06 23:07:08,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2023-11-06 23:07:08,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 446. [2023-11-06 23:07:08,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 403 states have (on average 1.2531017369727047) internal successors, (505), 403 states have internal predecessors, (505), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 23:07:08,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 577 transitions. [2023-11-06 23:07:08,266 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 577 transitions. Word has length 122 [2023-11-06 23:07:08,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:07:08,267 INFO L495 AbstractCegarLoop]: Abstraction has 446 states and 577 transitions. [2023-11-06 23:07:08,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 23:07:08,267 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 577 transitions. [2023-11-06 23:07:08,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-06 23:07:08,268 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:07:08,269 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 23:07:08,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-11-06 23:07:08,269 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:07:08,269 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:07:08,269 INFO L85 PathProgramCache]: Analyzing trace with hash -129545394, now seen corresponding path program 1 times [2023-11-06 23:07:08,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:07:08,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805863690] [2023-11-06 23:07:08,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:07:08,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:07:08,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:12,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:07:12,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:12,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:07:12,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:12,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 23:07:12,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:12,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 23:07:12,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:12,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:07:12,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:12,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:07:12,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:12,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 23:07:12,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:12,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 23:07:12,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:12,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 23:07:12,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:12,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:07:12,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:12,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 23:07:12,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:12,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 23:07:12,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:12,949 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 23:07:12,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:07:12,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805863690] [2023-11-06 23:07:12,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805863690] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:07:12,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:07:12,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2023-11-06 23:07:12,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553060699] [2023-11-06 23:07:12,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:07:12,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-06 23:07:12,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:07:12,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-06 23:07:12,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2023-11-06 23:07:12,953 INFO L87 Difference]: Start difference. First operand 446 states and 577 transitions. Second operand has 22 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 21 states have internal predecessors, (65), 9 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2023-11-06 23:07:19,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:07:19,094 INFO L93 Difference]: Finished difference Result 814 states and 1052 transitions. [2023-11-06 23:07:19,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-06 23:07:19,095 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 21 states have internal predecessors, (65), 9 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) Word has length 122 [2023-11-06 23:07:19,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:07:19,099 INFO L225 Difference]: With dead ends: 814 [2023-11-06 23:07:19,099 INFO L226 Difference]: Without dead ends: 631 [2023-11-06 23:07:19,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=208, Invalid=914, Unknown=0, NotChecked=0, Total=1122 [2023-11-06 23:07:19,102 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 544 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 1250 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 1212 SdHoareTripleChecker+Invalid, 1333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:07:19,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 1212 Invalid, 1333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1250 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2023-11-06 23:07:19,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2023-11-06 23:07:19,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 464. [2023-11-06 23:07:19,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 421 states have (on average 1.2494061757719714) internal successors, (526), 421 states have internal predecessors, (526), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 23:07:19,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 598 transitions. [2023-11-06 23:07:19,211 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 598 transitions. Word has length 122 [2023-11-06 23:07:19,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:07:19,211 INFO L495 AbstractCegarLoop]: Abstraction has 464 states and 598 transitions. [2023-11-06 23:07:19,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 21 states have internal predecessors, (65), 9 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2023-11-06 23:07:19,212 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 598 transitions. [2023-11-06 23:07:19,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-06 23:07:19,214 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:07:19,214 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 23:07:19,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-11-06 23:07:19,215 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:07:19,215 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:07:19,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1793682640, now seen corresponding path program 1 times [2023-11-06 23:07:19,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:07:19,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544671884] [2023-11-06 23:07:19,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:07:19,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:07:19,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:20,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:07:20,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:20,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:07:20,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:20,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 23:07:20,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:20,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 23:07:20,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:20,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:07:20,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:20,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:07:20,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:20,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 23:07:20,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:20,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 23:07:20,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:20,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 23:07:20,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:20,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:07:20,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:20,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 23:07:20,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:20,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 23:07:20,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:20,612 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 23:07:20,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:07:20,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544671884] [2023-11-06 23:07:20,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544671884] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:07:20,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:07:20,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 23:07:20,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97052128] [2023-11-06 23:07:20,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:07:20,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 23:07:20,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:07:20,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 23:07:20,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-11-06 23:07:20,616 INFO L87 Difference]: Start difference. First operand 464 states and 598 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 23:07:21,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:07:21,516 INFO L93 Difference]: Finished difference Result 754 states and 976 transitions. [2023-11-06 23:07:21,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 23:07:21,516 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2023-11-06 23:07:21,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:07:21,520 INFO L225 Difference]: With dead ends: 754 [2023-11-06 23:07:21,520 INFO L226 Difference]: Without dead ends: 571 [2023-11-06 23:07:21,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2023-11-06 23:07:21,522 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 272 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-06 23:07:21,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 790 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-06 23:07:21,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2023-11-06 23:07:21,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 441. [2023-11-06 23:07:21,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 398 states have (on average 1.2487437185929648) internal successors, (497), 398 states have internal predecessors, (497), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 23:07:21,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 569 transitions. [2023-11-06 23:07:21,628 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 569 transitions. Word has length 122 [2023-11-06 23:07:21,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:07:21,629 INFO L495 AbstractCegarLoop]: Abstraction has 441 states and 569 transitions. [2023-11-06 23:07:21,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 23:07:21,629 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 569 transitions. [2023-11-06 23:07:21,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-06 23:07:21,630 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:07:21,631 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 23:07:21,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-11-06 23:07:21,631 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:07:21,631 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:07:21,631 INFO L85 PathProgramCache]: Analyzing trace with hash 965821653, now seen corresponding path program 1 times [2023-11-06 23:07:21,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:07:21,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410826440] [2023-11-06 23:07:21,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:07:21,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:07:21,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:21,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:07:21,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:21,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:07:21,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:21,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 23:07:21,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:21,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 23:07:21,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:21,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:07:21,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:21,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:07:21,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:21,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 23:07:21,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:21,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 23:07:21,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:21,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 23:07:21,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:21,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:07:21,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:21,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 23:07:21,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:21,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 23:07:21,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:21,865 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 23:07:21,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:07:21,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410826440] [2023-11-06 23:07:21,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410826440] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:07:21,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:07:21,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 23:07:21,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773820825] [2023-11-06 23:07:21,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:07:21,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:07:21,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:07:21,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:07:21,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:07:21,867 INFO L87 Difference]: Start difference. First operand 441 states and 569 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 23:07:22,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:07:22,001 INFO L93 Difference]: Finished difference Result 776 states and 1009 transitions. [2023-11-06 23:07:22,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:07:22,002 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 124 [2023-11-06 23:07:22,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:07:22,005 INFO L225 Difference]: With dead ends: 776 [2023-11-06 23:07:22,005 INFO L226 Difference]: Without dead ends: 461 [2023-11-06 23:07:22,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:07:22,007 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 45 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:07:22,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 575 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:07:22,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2023-11-06 23:07:22,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 447. [2023-11-06 23:07:22,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 404 states have (on average 1.245049504950495) internal successors, (503), 404 states have internal predecessors, (503), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 23:07:22,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 575 transitions. [2023-11-06 23:07:22,109 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 575 transitions. Word has length 124 [2023-11-06 23:07:22,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:07:22,109 INFO L495 AbstractCegarLoop]: Abstraction has 447 states and 575 transitions. [2023-11-06 23:07:22,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 23:07:22,110 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 575 transitions. [2023-11-06 23:07:22,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-06 23:07:22,111 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:07:22,111 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 23:07:22,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-11-06 23:07:22,111 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:07:22,112 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:07:22,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1763944105, now seen corresponding path program 1 times [2023-11-06 23:07:22,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:07:22,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471111406] [2023-11-06 23:07:22,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:07:22,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:07:22,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:22,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:07:22,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:22,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:07:22,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:22,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 23:07:22,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:22,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 23:07:22,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:22,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:07:22,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:22,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:07:22,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:22,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 23:07:22,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:22,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 23:07:22,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:22,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 23:07:22,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:22,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:07:22,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:22,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 23:07:22,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:22,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 23:07:22,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:22,493 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 23:07:22,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:07:22,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471111406] [2023-11-06 23:07:22,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471111406] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:07:22,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:07:22,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 23:07:22,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857843114] [2023-11-06 23:07:22,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:07:22,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:07:22,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:07:22,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:07:22,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:07:22,496 INFO L87 Difference]: Start difference. First operand 447 states and 575 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 23:07:22,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:07:22,754 INFO L93 Difference]: Finished difference Result 678 states and 874 transitions. [2023-11-06 23:07:22,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:07:22,754 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 124 [2023-11-06 23:07:22,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:07:22,757 INFO L225 Difference]: With dead ends: 678 [2023-11-06 23:07:22,757 INFO L226 Difference]: Without dead ends: 497 [2023-11-06 23:07:22,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:07:22,759 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 130 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 23:07:22,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 447 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 23:07:22,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2023-11-06 23:07:22,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 447. [2023-11-06 23:07:22,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 404 states have (on average 1.2425742574257426) internal successors, (502), 404 states have internal predecessors, (502), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 23:07:22,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 574 transitions. [2023-11-06 23:07:22,866 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 574 transitions. Word has length 124 [2023-11-06 23:07:22,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:07:22,867 INFO L495 AbstractCegarLoop]: Abstraction has 447 states and 574 transitions. [2023-11-06 23:07:22,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 23:07:22,867 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 574 transitions. [2023-11-06 23:07:22,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-06 23:07:22,868 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:07:22,869 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 23:07:22,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-11-06 23:07:22,869 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:07:22,869 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:07:22,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1463309406, now seen corresponding path program 1 times [2023-11-06 23:07:22,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:07:22,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945613273] [2023-11-06 23:07:22,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:07:22,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:07:23,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:27,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:07:27,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:27,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:07:27,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:27,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 23:07:27,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:27,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 23:07:27,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:27,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:07:27,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:27,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:07:27,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:27,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 23:07:27,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:27,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 23:07:27,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:27,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 23:07:27,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:27,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:07:27,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:27,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 23:07:27,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:27,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 23:07:27,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:27,490 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 23:07:27,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:07:27,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945613273] [2023-11-06 23:07:27,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945613273] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:07:27,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:07:27,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2023-11-06 23:07:27,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639784170] [2023-11-06 23:07:27,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:07:27,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-06 23:07:27,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:07:27,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-06 23:07:27,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=573, Unknown=0, NotChecked=0, Total=650 [2023-11-06 23:07:27,494 INFO L87 Difference]: Start difference. First operand 447 states and 574 transitions. Second operand has 26 states, 26 states have (on average 2.576923076923077) internal successors, (67), 26 states have internal predecessors, (67), 8 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2023-11-06 23:07:33,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:07:33,126 INFO L93 Difference]: Finished difference Result 683 states and 874 transitions. [2023-11-06 23:07:33,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-06 23:07:33,126 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.576923076923077) internal successors, (67), 26 states have internal predecessors, (67), 8 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) Word has length 124 [2023-11-06 23:07:33,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:07:33,129 INFO L225 Difference]: With dead ends: 683 [2023-11-06 23:07:33,129 INFO L226 Difference]: Without dead ends: 502 [2023-11-06 23:07:33,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=285, Invalid=1785, Unknown=0, NotChecked=0, Total=2070 [2023-11-06 23:07:33,131 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 647 mSDsluCounter, 1186 mSDsCounter, 0 mSdLazyCounter, 1403 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 647 SdHoareTripleChecker+Valid, 1307 SdHoareTripleChecker+Invalid, 1518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 1403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-11-06 23:07:33,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [647 Valid, 1307 Invalid, 1518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 1403 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-11-06 23:07:33,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2023-11-06 23:07:33,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 469. [2023-11-06 23:07:33,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 426 states have (on average 1.2347417840375587) internal successors, (526), 426 states have internal predecessors, (526), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 23:07:33,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 598 transitions. [2023-11-06 23:07:33,224 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 598 transitions. Word has length 124 [2023-11-06 23:07:33,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:07:33,225 INFO L495 AbstractCegarLoop]: Abstraction has 469 states and 598 transitions. [2023-11-06 23:07:33,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.576923076923077) internal successors, (67), 26 states have internal predecessors, (67), 8 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2023-11-06 23:07:33,225 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 598 transitions. [2023-11-06 23:07:33,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-06 23:07:33,227 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:07:33,227 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 23:07:33,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-11-06 23:07:33,228 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:07:33,228 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:07:33,228 INFO L85 PathProgramCache]: Analyzing trace with hash -77106012, now seen corresponding path program 1 times [2023-11-06 23:07:33,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:07:33,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015958559] [2023-11-06 23:07:33,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:07:33,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:07:33,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:34,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:07:34,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:34,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:07:34,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:34,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 23:07:34,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:34,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 23:07:34,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:34,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:07:34,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:34,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:07:34,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:34,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 23:07:34,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:34,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 23:07:34,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:34,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 23:07:34,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:34,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:07:34,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:34,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 23:07:34,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:34,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 23:07:34,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:34,641 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 23:07:34,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:07:34,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015958559] [2023-11-06 23:07:34,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015958559] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:07:34,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:07:34,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-06 23:07:34,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704985317] [2023-11-06 23:07:34,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:07:34,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-06 23:07:34,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:07:34,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-06 23:07:34,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2023-11-06 23:07:34,649 INFO L87 Difference]: Start difference. First operand 469 states and 598 transitions. Second operand has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 23:07:35,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:07:35,913 INFO L93 Difference]: Finished difference Result 697 states and 887 transitions. [2023-11-06 23:07:35,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-06 23:07:35,913 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 124 [2023-11-06 23:07:35,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:07:35,917 INFO L225 Difference]: With dead ends: 697 [2023-11-06 23:07:35,917 INFO L226 Difference]: Without dead ends: 494 [2023-11-06 23:07:35,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2023-11-06 23:07:35,918 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 274 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-06 23:07:35,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 1054 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 712 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-06 23:07:35,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2023-11-06 23:07:36,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 450. [2023-11-06 23:07:36,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 407 states have (on average 1.240786240786241) internal successors, (505), 407 states have internal predecessors, (505), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 23:07:36,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 577 transitions. [2023-11-06 23:07:36,034 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 577 transitions. Word has length 124 [2023-11-06 23:07:36,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:07:36,035 INFO L495 AbstractCegarLoop]: Abstraction has 450 states and 577 transitions. [2023-11-06 23:07:36,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 23:07:36,035 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 577 transitions. [2023-11-06 23:07:36,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-11-06 23:07:36,037 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:07:36,037 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 23:07:36,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-11-06 23:07:36,037 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:07:36,038 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:07:36,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1066686394, now seen corresponding path program 1 times [2023-11-06 23:07:36,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:07:36,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476251640] [2023-11-06 23:07:36,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:07:36,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:07:36,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:36,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:07:36,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:36,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:07:36,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:36,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 23:07:36,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:36,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 23:07:36,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:36,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:07:36,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:36,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:07:36,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:36,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 23:07:36,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:36,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 23:07:36,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:36,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 23:07:36,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:36,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:07:36,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:36,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 23:07:36,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:36,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 23:07:36,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:36,392 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 23:07:36,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:07:36,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476251640] [2023-11-06 23:07:36,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476251640] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:07:36,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:07:36,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 23:07:36,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911133746] [2023-11-06 23:07:36,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:07:36,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:07:36,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:07:36,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:07:36,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:07:36,395 INFO L87 Difference]: Start difference. First operand 450 states and 577 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 23:07:36,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:07:36,685 INFO L93 Difference]: Finished difference Result 812 states and 1048 transitions. [2023-11-06 23:07:36,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:07:36,686 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 126 [2023-11-06 23:07:36,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:07:36,689 INFO L225 Difference]: With dead ends: 812 [2023-11-06 23:07:36,689 INFO L226 Difference]: Without dead ends: 488 [2023-11-06 23:07:36,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:07:36,691 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 113 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 23:07:36,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 449 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 23:07:36,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2023-11-06 23:07:36,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 448. [2023-11-06 23:07:36,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 405 states have (on average 1.237037037037037) internal successors, (501), 405 states have internal predecessors, (501), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 23:07:36,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 573 transitions. [2023-11-06 23:07:36,814 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 573 transitions. Word has length 126 [2023-11-06 23:07:36,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:07:36,814 INFO L495 AbstractCegarLoop]: Abstraction has 448 states and 573 transitions. [2023-11-06 23:07:36,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 23:07:36,815 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 573 transitions. [2023-11-06 23:07:36,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-11-06 23:07:36,816 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:07:36,816 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 23:07:36,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-11-06 23:07:36,817 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:07:36,817 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:07:36,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1395114461, now seen corresponding path program 1 times [2023-11-06 23:07:36,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:07:36,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995195961] [2023-11-06 23:07:36,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:07:36,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:07:36,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:36,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:07:36,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:36,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:07:36,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:36,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 23:07:36,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:36,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 23:07:36,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:36,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:07:36,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:36,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:07:36,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:36,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 23:07:36,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:36,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 23:07:36,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:36,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 23:07:36,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:36,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:07:36,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:36,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 23:07:36,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:36,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 23:07:36,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:07:36,953 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 23:07:36,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:07:36,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995195961] [2023-11-06 23:07:36,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995195961] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:07:36,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:07:36,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:07:36,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761228381] [2023-11-06 23:07:36,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:07:36,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:07:36,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:07:36,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:07:36,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:07:36,956 INFO L87 Difference]: Start difference. First operand 448 states and 573 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 23:07:37,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:07:37,042 INFO L93 Difference]: Finished difference Result 768 states and 985 transitions. [2023-11-06 23:07:37,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:07:37,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 128 [2023-11-06 23:07:37,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:07:37,046 INFO L225 Difference]: With dead ends: 768 [2023-11-06 23:07:37,046 INFO L226 Difference]: Without dead ends: 446 [2023-11-06 23:07:37,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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-06 23:07:37,048 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 5 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:07:37,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 288 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:07:37,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2023-11-06 23:07:37,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 444. [2023-11-06 23:07:37,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 401 states have (on average 1.229426433915212) internal successors, (493), 401 states have internal predecessors, (493), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 23:07:37,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 565 transitions. [2023-11-06 23:07:37,147 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 565 transitions. Word has length 128 [2023-11-06 23:07:37,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:07:37,148 INFO L495 AbstractCegarLoop]: Abstraction has 444 states and 565 transitions. [2023-11-06 23:07:37,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 23:07:37,148 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 565 transitions. [2023-11-06 23:07:37,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-11-06 23:07:37,150 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:07:37,150 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 23:07:37,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-11-06 23:07:37,150 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:07:37,151 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:07:37,151 INFO L85 PathProgramCache]: Analyzing trace with hash -2075759122, now seen corresponding path program 1 times [2023-11-06 23:07:37,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:07:37,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940905089] [2023-11-06 23:07:37,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:07:37,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:07:37,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:07:37,392 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 23:07:37,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:07:37,747 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 23:07:37,747 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 23:07:37,749 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 23:07:37,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-11-06 23:07:37,755 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 23:07:37,761 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 23:07:38,001 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 11:07:38 BoogieIcfgContainer [2023-11-06 23:07:38,002 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 23:07:38,002 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 23:07:38,002 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 23:07:38,003 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 23:07:38,003 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:05:46" (3/4) ... [2023-11-06 23:07:38,005 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 23:07:38,007 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 23:07:38,007 INFO L158 Benchmark]: Toolchain (without parser) took 113418.58ms. Allocated memory was 167.8MB in the beginning and 612.4MB in the end (delta: 444.6MB). Free memory was 138.8MB in the beginning and 315.2MB in the end (delta: -176.4MB). Peak memory consumption was 267.1MB. Max. memory is 16.1GB. [2023-11-06 23:07:38,008 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 125.8MB. Free memory is still 100.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:07:38,014 INFO L158 Benchmark]: CACSL2BoogieTranslator took 387.28ms. Allocated memory is still 167.8MB. Free memory was 138.6MB in the beginning and 128.2MB in the end (delta: 10.4MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. [2023-11-06 23:07:38,014 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.83ms. Allocated memory is still 167.8MB. Free memory was 128.2MB in the beginning and 125.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 23:07:38,014 INFO L158 Benchmark]: Boogie Preprocessor took 56.82ms. Allocated memory is still 167.8MB. Free memory was 125.4MB in the beginning and 122.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 23:07:38,016 INFO L158 Benchmark]: RCFGBuilder took 1046.45ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 118.0MB in the end (delta: 4.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-06 23:07:38,018 INFO L158 Benchmark]: TraceAbstraction took 111853.02ms. Allocated memory was 167.8MB in the beginning and 612.4MB in the end (delta: 444.6MB). Free memory was 117.5MB in the beginning and 316.2MB in the end (delta: -198.7MB). Peak memory consumption was 249.0MB. Max. memory is 16.1GB. [2023-11-06 23:07:38,018 INFO L158 Benchmark]: Witness Printer took 4.73ms. Allocated memory is still 612.4MB. Free memory was 316.2MB in the beginning and 315.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:07:38,019 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.34ms. Allocated memory is still 125.8MB. Free memory is still 100.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 387.28ms. Allocated memory is still 167.8MB. Free memory was 138.6MB in the beginning and 128.2MB in the end (delta: 10.4MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.83ms. Allocated memory is still 167.8MB. Free memory was 128.2MB in the beginning and 125.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.82ms. Allocated memory is still 167.8MB. Free memory was 125.4MB in the beginning and 122.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1046.45ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 118.0MB in the end (delta: 4.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 111853.02ms. Allocated memory was 167.8MB in the beginning and 612.4MB in the end (delta: 444.6MB). Free memory was 117.5MB in the beginning and 316.2MB in the end (delta: -198.7MB). Peak memory consumption was 249.0MB. Max. memory is 16.1GB. * Witness Printer took 4.73ms. Allocated memory is still 612.4MB. Free memory was 316.2MB in the beginning and 315.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 103, overapproximation of someBinaryArithmeticDOUBLEoperation at line 72. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -128; [L23] signed char* var_1_1_Pointer = &(var_1_1); [L24] unsigned char var_1_2 = 1; [L25] unsigned char* var_1_2_Pointer = &(var_1_2); [L26] unsigned char var_1_6 = 1; [L27] unsigned char* var_1_6_Pointer = &(var_1_6); [L28] signed char var_1_7 = 8; [L29] signed char* var_1_7_Pointer = &(var_1_7); [L30] unsigned long int var_1_8 = 1; [L31] unsigned long int* var_1_8_Pointer = &(var_1_8); [L32] unsigned long int var_1_9 = 1885310857; [L33] unsigned long int* var_1_9_Pointer = &(var_1_9); [L34] signed long int var_1_10 = -10; [L35] signed long int* var_1_10_Pointer = &(var_1_10); [L36] double var_1_11 = 32.6; [L37] double* var_1_11_Pointer = &(var_1_11); [L38] double var_1_12 = 9.75; [L39] double* var_1_12_Pointer = &(var_1_12); [L40] double var_1_13 = 5.1; [L41] double* var_1_13_Pointer = &(var_1_13); [L42] double var_1_14 = 128.1; [L43] double* var_1_14_Pointer = &(var_1_14); [L44] double var_1_15 = 63.9; [L45] double* var_1_15_Pointer = &(var_1_15); [L46] signed long int last_1_var_1_10 = -10; VAL [isInitial=0, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L107] isInitial = 1 [L108] FCALL initially() [L109] COND TRUE 1 [L110] CALL updateLastVariables() [L100] EXPR \read(var_1_10) [L100] last_1_var_1_10 = var_1_10 [L110] RET updateLastVariables() [L111] CALL updateVariables() [L78] var_1_2 = __VERIFIER_nondet_uchar() [L79] EXPR \read(var_1_2) VAL [\read(var_1_2)=256, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L79] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L79] RET assume_abort_if_not(var_1_2 >= 0) VAL [\read(var_1_2)=256, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L80] EXPR \read(var_1_2) VAL [\read(var_1_2)=256, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L80] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L80] RET assume_abort_if_not(var_1_2 <= 1) VAL [\read(var_1_2)=256, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L81] var_1_6 = __VERIFIER_nondet_uchar() [L82] EXPR \read(var_1_6) VAL [\read(var_1_6)=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L82] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L82] RET assume_abort_if_not(var_1_6 >= 0) VAL [\read(var_1_6)=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L83] EXPR \read(var_1_6) VAL [\read(var_1_6)=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L83] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L83] RET assume_abort_if_not(var_1_6 <= 1) VAL [\read(var_1_6)=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L84] var_1_7 = __VERIFIER_nondet_char() [L85] EXPR \read(var_1_7) VAL [\read(var_1_7)=126, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L85] CALL assume_abort_if_not(var_1_7 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L85] RET assume_abort_if_not(var_1_7 >= -127) VAL [\read(var_1_7)=126, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L86] EXPR \read(var_1_7) VAL [\read(var_1_7)=126, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L86] CALL assume_abort_if_not(var_1_7 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L86] RET assume_abort_if_not(var_1_7 <= 126) VAL [\read(var_1_7)=126, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L87] var_1_9 = __VERIFIER_nondet_ulong() [L88] EXPR \read(var_1_9) VAL [\read(var_1_9)=2147483647, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L88] CALL assume_abort_if_not(var_1_9 >= 1073741824) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L88] RET assume_abort_if_not(var_1_9 >= 1073741824) VAL [\read(var_1_9)=2147483647, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L89] EXPR \read(var_1_9) VAL [\read(var_1_9)=2147483647, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L89] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L89] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [\read(var_1_9)=2147483647, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L90] var_1_12 = __VERIFIER_nondet_double() [L91] EXPR \read(var_1_12) [L91] EXPR var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F [L91] EXPR \read(var_1_12) [L91] EXPR var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F VAL [\read(var_1_12)=2147483674, \read(var_1_12)=2147483674, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L91] EXPR (var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F ) VAL [(var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )=1, \read(var_1_12)=2147483674, \read(var_1_12)=2147483674, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F=1, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L91] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L91] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [(var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )=1, \read(var_1_12)=2147483674, \read(var_1_12)=2147483674, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F=1, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L92] var_1_13 = __VERIFIER_nondet_double() [L93] EXPR \read(var_1_13) [L93] EXPR var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F [L93] EXPR \read(var_1_13) [L93] EXPR var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F VAL [\read(var_1_13)=2147483677, \read(var_1_13)=2147483677, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L93] EXPR (var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F ) VAL [(var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )=1, \read(var_1_13)=2147483677, \read(var_1_13)=2147483677, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F=1, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L93] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L93] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [(var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )=1, \read(var_1_13)=2147483677, \read(var_1_13)=2147483677, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F=1, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L94] var_1_14 = __VERIFIER_nondet_double() [L95] EXPR \read(var_1_14) [L95] EXPR var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F [L95] EXPR \read(var_1_14) [L95] EXPR var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F VAL [\read(var_1_14)=2147483682, \read(var_1_14)=2147483682, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L95] EXPR (var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F ) VAL [(var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )=1, \read(var_1_14)=2147483682, \read(var_1_14)=2147483682, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F=1, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L95] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L95] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [(var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )=1, \read(var_1_14)=2147483682, \read(var_1_14)=2147483682, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F=1, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L96] var_1_15 = __VERIFIER_nondet_double() [L97] EXPR \read(var_1_15) [L97] EXPR var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F [L97] EXPR \read(var_1_15) [L97] EXPR var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F VAL [\read(var_1_15)=2147483673, \read(var_1_15)=2147483673, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L97] EXPR (var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F ) VAL [(var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )=1, \read(var_1_15)=2147483673, \read(var_1_15)=2147483673, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F=1, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L97] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L97] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [(var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )=1, \read(var_1_15)=2147483673, \read(var_1_15)=2147483673, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F=1, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L111] RET updateVariables() [L112] CALL step() [L50] EXPR \read(*var_1_2_Pointer) VAL [\read(*var_1_2_Pointer)=256, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L50] COND FALSE !((*(var_1_2_Pointer))) [L53] EXPR \read(*var_1_9_Pointer) VAL [\read(*var_1_9_Pointer)=2147483647, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L53] EXPR ((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer))) VAL [((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer)))=-10, \read(*var_1_9_Pointer)=2147483647, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L53] (*(var_1_8_Pointer)) = ((((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer))))) [L55] EXPR \read(*var_1_2_Pointer) VAL [\read(*var_1_2_Pointer)=256, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L55] COND FALSE !((*(var_1_2_Pointer))) [L58] EXPR \read(*var_1_2_Pointer) [L58] unsigned char stepLocal_1 = (*(var_1_2_Pointer)); [L59] EXPR \read(*var_1_10_Pointer) [L59] signed long int stepLocal_0 = (*(var_1_10_Pointer)); [L60] stepLocal_1 || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer))) [L60] EXPR \read(*var_1_10_Pointer) [L60] EXPR \read(*var_1_10_Pointer) [L60] stepLocal_1 || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer))) VAL [\read(*var_1_10_Pointer)=-10, \read(*var_1_10_Pointer)=-10, isInitial=1, last_1_var_1_10=-10, stepLocal_0=-10, stepLocal_1 || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))=1, stepLocal_1=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L60] COND TRUE stepLocal_1 || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer))) [L61] EXPR \read(*var_1_8_Pointer) VAL [\read(*var_1_8_Pointer)=-10, isInitial=1, last_1_var_1_10=-10, stepLocal_0=-10, stepLocal_1=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L61] COND FALSE !(stepLocal_0 < (*(var_1_8_Pointer))) [L66] (*(var_1_1_Pointer)) = 2 VAL [isInitial=1, last_1_var_1_10=-10, stepLocal_0=-10, stepLocal_1=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L71] EXPR \read(*var_1_1_Pointer) [L71] EXPR \read(*var_1_1_Pointer) VAL [\read(*var_1_1_Pointer)=2, \read(*var_1_1_Pointer)=2, isInitial=1, last_1_var_1_10=-10, stepLocal_0=-10, stepLocal_1=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L71] COND TRUE (*(var_1_1_Pointer)) >= (*(var_1_1_Pointer)) [L72] EXPR \read(*var_1_12_Pointer) [L72] EXPR \read(*var_1_13_Pointer) [L72] EXPR \read(*var_1_14_Pointer) [L72] EXPR \read(*var_1_15_Pointer) VAL [\read(*var_1_12_Pointer)=2147483674, \read(*var_1_13_Pointer)=2147483677, \read(*var_1_14_Pointer)=2147483682, \read(*var_1_15_Pointer)=2147483673, isInitial=1, last_1_var_1_10=-10, stepLocal_0=-10, stepLocal_1=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L72] EXPR ((((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) : ((*(var_1_15_Pointer))) [L72] EXPR \read(*var_1_13_Pointer) [L72] EXPR \read(*var_1_14_Pointer) [L72] EXPR ((((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) : ((*(var_1_15_Pointer))) VAL [\read(*var_1_12_Pointer)=2147483674, \read(*var_1_13_Pointer)=2147483677, \read(*var_1_13_Pointer)=2147483677, \read(*var_1_14_Pointer)=2147483682, \read(*var_1_14_Pointer)=2147483682, \read(*var_1_15_Pointer)=2147483673, isInitial=1, last_1_var_1_10=-10, stepLocal_0=-10, stepLocal_1=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L72] (*(var_1_11_Pointer)) = ((*(var_1_12_Pointer)) - ((((((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) : ((*(var_1_15_Pointer)))))) [L112] RET step() [L113] CALL, EXPR property() [L103] EXPR \read(*var_1_2_Pointer) [L103] EXPR (*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer))) [L103] EXPR \read(*var_1_10_Pointer) [L103] EXPR \read(*var_1_10_Pointer) [L103] EXPR (*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer))) VAL [(*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))=1, \read(*var_1_10_Pointer)=-10, \read(*var_1_10_Pointer)=-10, \read(*var_1_2_Pointer)=256, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L103] EXPR ((*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))) ? (((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) [L103] EXPR \read(*var_1_10_Pointer) [L103] EXPR \read(*var_1_8_Pointer) VAL [(*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))=1, \read(*var_1_10_Pointer)=-10, \read(*var_1_10_Pointer)=-10, \read(*var_1_10_Pointer)=-10, \read(*var_1_2_Pointer)=256, \read(*var_1_8_Pointer)=-10, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L103] EXPR ((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2)) [L103] EXPR \read(*var_1_1_Pointer) [L103] EXPR ((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2)) VAL [((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))=1, (*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))=1, \read(*var_1_10_Pointer)=-10, \read(*var_1_10_Pointer)=-10, \read(*var_1_10_Pointer)=-10, \read(*var_1_1_Pointer)=2, \read(*var_1_2_Pointer)=256, \read(*var_1_8_Pointer)=-10, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L103] EXPR ((*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))) ? (((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) VAL [((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))=1, ((*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))) ? (((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))=1, (*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))=1, \read(*var_1_10_Pointer)=-10, \read(*var_1_10_Pointer)=-10, \read(*var_1_10_Pointer)=-10, \read(*var_1_1_Pointer)=2, \read(*var_1_2_Pointer)=256, \read(*var_1_8_Pointer)=-10, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L103] EXPR (((*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))) ? (((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer)))))) - last_1_var_1_10))) : ((*(var_1_8_Pointer)) == ((unsigned long int) ((((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer)))))))) [L103] EXPR \read(*var_1_2_Pointer) VAL [(((*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))) ? (((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer)))))) - last_1_var_1_10))) : ((*(var_1_8_Pointer)) == ((unsigned long int) ((((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer))))))))=1, ((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))=1, ((*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))) ? (((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))=1, (*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))=1, \read(*var_1_10_Pointer)=-10, \read(*var_1_10_Pointer)=-10, \read(*var_1_10_Pointer)=-10, \read(*var_1_1_Pointer)=2, \read(*var_1_2_Pointer)=256, \read(*var_1_2_Pointer)=256, \read(*var_1_8_Pointer)=-10, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L103] EXPR (*(var_1_2_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer)))))) - last_1_var_1_10))) : ((*(var_1_8_Pointer)) == ((unsigned long int) ((((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer))))))) [L103] EXPR \read(*var_1_8_Pointer) [L103] EXPR \read(*var_1_9_Pointer) VAL [(((*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))) ? (((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer)))))) - last_1_var_1_10))) : ((*(var_1_8_Pointer)) == ((unsigned long int) ((((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer))))))))=1, ((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))=1, ((*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))) ? (((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))=1, (*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))=1, \read(*var_1_10_Pointer)=-10, \read(*var_1_10_Pointer)=-10, \read(*var_1_10_Pointer)=-10, \read(*var_1_1_Pointer)=2, \read(*var_1_2_Pointer)=256, \read(*var_1_2_Pointer)=256, \read(*var_1_8_Pointer)=-10, \read(*var_1_8_Pointer)=-10, \read(*var_1_9_Pointer)=2147483647, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L103] EXPR ((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer))) VAL [(((*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))) ? (((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer)))))) - last_1_var_1_10))) : ((*(var_1_8_Pointer)) == ((unsigned long int) ((((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer))))))))=1, ((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))=1, ((*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))) ? (((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))=1, ((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer)))=-10, (*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))=1, \read(*var_1_10_Pointer)=-10, \read(*var_1_10_Pointer)=-10, \read(*var_1_10_Pointer)=-10, \read(*var_1_1_Pointer)=2, \read(*var_1_2_Pointer)=256, \read(*var_1_2_Pointer)=256, \read(*var_1_8_Pointer)=-10, \read(*var_1_8_Pointer)=-10, \read(*var_1_9_Pointer)=2147483647, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L103] EXPR (*(var_1_2_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer)))))) - last_1_var_1_10))) : ((*(var_1_8_Pointer)) == ((unsigned long int) ((((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer))))))) VAL [(((*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))) ? (((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer)))))) - last_1_var_1_10))) : ((*(var_1_8_Pointer)) == ((unsigned long int) ((((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer))))))))=1, ((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))=1, ((*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))) ? (((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))=1, ((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer)))=-10, (*(var_1_2_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer)))))) - last_1_var_1_10))) : ((*(var_1_8_Pointer)) == ((unsigned long int) ((((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer)))))))=1, (*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))=1, \read(*var_1_10_Pointer)=-10, \read(*var_1_10_Pointer)=-10, \read(*var_1_10_Pointer)=-10, \read(*var_1_1_Pointer)=2, \read(*var_1_2_Pointer)=256, \read(*var_1_2_Pointer)=256, \read(*var_1_8_Pointer)=-10, \read(*var_1_8_Pointer)=-10, \read(*var_1_9_Pointer)=2147483647, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L103] EXPR (((*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))) ? (((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer)))))) - last_1_var_1_10))) : ((*(var_1_8_Pointer)) == ((unsigned long int) ((((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer)))))))) VAL [(((*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))) ? (((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer)))))) - last_1_var_1_10))) : ((*(var_1_8_Pointer)) == ((unsigned long int) ((((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer))))))))=1, ((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))=1, ((*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))) ? (((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))=1, ((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer)))=-10, (*(var_1_2_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer)))))) - last_1_var_1_10))) : ((*(var_1_8_Pointer)) == ((unsigned long int) ((((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer)))))))=1, (*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))=1, \read(*var_1_10_Pointer)=-10, \read(*var_1_10_Pointer)=-10, \read(*var_1_10_Pointer)=-10, \read(*var_1_1_Pointer)=2, \read(*var_1_2_Pointer)=256, \read(*var_1_2_Pointer)=256, \read(*var_1_8_Pointer)=-10, \read(*var_1_8_Pointer)=-10, \read(*var_1_9_Pointer)=2147483647, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L103] EXPR ((((*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))) ? (((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer)))))) - last_1_var_1_10))) : ((*(var_1_8_Pointer)) == ((unsigned long int) ((((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer))))))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed long int) ((*(var_1_8_Pointer)) + (((((*(var_1_7_Pointer))) < 0 ) ? -((*(var_1_7_Pointer))) : ((*(var_1_7_Pointer)))))))) : 1) [L103] EXPR \read(*var_1_2_Pointer) VAL [((((*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))) ? (((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer)))))) - last_1_var_1_10))) : ((*(var_1_8_Pointer)) == ((unsigned long int) ((((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer))))))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed long int) ((*(var_1_8_Pointer)) + (((((*(var_1_7_Pointer))) < 0 ) ? -((*(var_1_7_Pointer))) : ((*(var_1_7_Pointer)))))))) : 1)=1, (((*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))) ? (((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer)))))) - last_1_var_1_10))) : ((*(var_1_8_Pointer)) == ((unsigned long int) ((((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer))))))))=1, ((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))=1, ((*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))) ? (((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))=1, ((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer)))=-10, (*(var_1_2_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer)))))) - last_1_var_1_10))) : ((*(var_1_8_Pointer)) == ((unsigned long int) ((((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer)))))))=1, (*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))=1, \read(*var_1_10_Pointer)=-10, \read(*var_1_10_Pointer)=-10, \read(*var_1_10_Pointer)=-10, \read(*var_1_1_Pointer)=2, \read(*var_1_2_Pointer)=256, \read(*var_1_2_Pointer)=256, \read(*var_1_2_Pointer)=256, \read(*var_1_8_Pointer)=-10, \read(*var_1_8_Pointer)=-10, \read(*var_1_9_Pointer)=2147483647, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L103] EXPR (*(var_1_2_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed long int) ((*(var_1_8_Pointer)) + (((((*(var_1_7_Pointer))) < 0 ) ? -((*(var_1_7_Pointer))) : ((*(var_1_7_Pointer)))))))) : 1 VAL [((((*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))) ? (((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer)))))) - last_1_var_1_10))) : ((*(var_1_8_Pointer)) == ((unsigned long int) ((((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer))))))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed long int) ((*(var_1_8_Pointer)) + (((((*(var_1_7_Pointer))) < 0 ) ? -((*(var_1_7_Pointer))) : ((*(var_1_7_Pointer)))))))) : 1)=1, (((*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))) ? (((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer)))))) - last_1_var_1_10))) : ((*(var_1_8_Pointer)) == ((unsigned long int) ((((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer))))))))=1, ((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))=1, ((*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))) ? (((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))=1, ((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer)))=-10, (*(var_1_2_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed long int) ((*(var_1_8_Pointer)) + (((((*(var_1_7_Pointer))) < 0 ) ? -((*(var_1_7_Pointer))) : ((*(var_1_7_Pointer)))))))) : 1=1, (*(var_1_2_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer)))))) - last_1_var_1_10))) : ((*(var_1_8_Pointer)) == ((unsigned long int) ((((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer)))))))=1, (*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))=1, \read(*var_1_10_Pointer)=-10, \read(*var_1_10_Pointer)=-10, \read(*var_1_10_Pointer)=-10, \read(*var_1_1_Pointer)=2, \read(*var_1_2_Pointer)=256, \read(*var_1_2_Pointer)=256, \read(*var_1_2_Pointer)=256, \read(*var_1_8_Pointer)=-10, \read(*var_1_8_Pointer)=-10, \read(*var_1_9_Pointer)=2147483647, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L103] EXPR ((((*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))) ? (((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer)))))) - last_1_var_1_10))) : ((*(var_1_8_Pointer)) == ((unsigned long int) ((((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer))))))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed long int) ((*(var_1_8_Pointer)) + (((((*(var_1_7_Pointer))) < 0 ) ? -((*(var_1_7_Pointer))) : ((*(var_1_7_Pointer)))))))) : 1) VAL [((((*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))) ? (((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer)))))) - last_1_var_1_10))) : ((*(var_1_8_Pointer)) == ((unsigned long int) ((((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer))))))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed long int) ((*(var_1_8_Pointer)) + (((((*(var_1_7_Pointer))) < 0 ) ? -((*(var_1_7_Pointer))) : ((*(var_1_7_Pointer)))))))) : 1)=1, (((*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))) ? (((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer)))))) - last_1_var_1_10))) : ((*(var_1_8_Pointer)) == ((unsigned long int) ((((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer))))))))=1, ((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))=1, ((*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))) ? (((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))=1, ((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer)))=-10, (*(var_1_2_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed long int) ((*(var_1_8_Pointer)) + (((((*(var_1_7_Pointer))) < 0 ) ? -((*(var_1_7_Pointer))) : ((*(var_1_7_Pointer)))))))) : 1=1, (*(var_1_2_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer)))))) - last_1_var_1_10))) : ((*(var_1_8_Pointer)) == ((unsigned long int) ((((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer)))))))=1, (*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))=1, \read(*var_1_10_Pointer)=-10, \read(*var_1_10_Pointer)=-10, \read(*var_1_10_Pointer)=-10, \read(*var_1_1_Pointer)=2, \read(*var_1_2_Pointer)=256, \read(*var_1_2_Pointer)=256, \read(*var_1_2_Pointer)=256, \read(*var_1_8_Pointer)=-10, \read(*var_1_8_Pointer)=-10, \read(*var_1_9_Pointer)=2147483647, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L103] EXPR (((((*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))) ? (((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer)))))) - last_1_var_1_10))) : ((*(var_1_8_Pointer)) == ((unsigned long int) ((((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer))))))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed long int) ((*(var_1_8_Pointer)) + (((((*(var_1_7_Pointer))) < 0 ) ? -((*(var_1_7_Pointer))) : ((*(var_1_7_Pointer)))))))) : 1)) && (((*(var_1_1_Pointer)) >= (*(var_1_1_Pointer))) ? ((*(var_1_11_Pointer)) == ((double) ((*(var_1_12_Pointer)) - ((((((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) : ((*(var_1_15_Pointer)))))))) : ((*(var_1_11_Pointer)) == ((double) (((((*(var_1_14_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_13_Pointer)))))))) [L103] EXPR \read(*var_1_1_Pointer) [L103] EXPR \read(*var_1_1_Pointer) VAL [(((((*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))) ? (((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer)))))) - last_1_var_1_10))) : ((*(var_1_8_Pointer)) == ((unsigned long int) ((((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer))))))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed long int) ((*(var_1_8_Pointer)) + (((((*(var_1_7_Pointer))) < 0 ) ? -((*(var_1_7_Pointer))) : ((*(var_1_7_Pointer)))))))) : 1)) && (((*(var_1_1_Pointer)) >= (*(var_1_1_Pointer))) ? ((*(var_1_11_Pointer)) == ((double) ((*(var_1_12_Pointer)) - ((((((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) : ((*(var_1_15_Pointer)))))))) : ((*(var_1_11_Pointer)) == ((double) (((((*(var_1_14_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_13_Pointer))))))))=1, ((((*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))) ? (((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer)))))) - last_1_var_1_10))) : ((*(var_1_8_Pointer)) == ((unsigned long int) ((((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer))))))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed long int) ((*(var_1_8_Pointer)) + (((((*(var_1_7_Pointer))) < 0 ) ? -((*(var_1_7_Pointer))) : ((*(var_1_7_Pointer)))))))) : 1)=1, (((*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))) ? (((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer)))))) - last_1_var_1_10))) : ((*(var_1_8_Pointer)) == ((unsigned long int) ((((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer))))))))=1, ((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))=1, ((*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))) ? (((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))=1, ((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer)))=-10, (*(var_1_2_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed long int) ((*(var_1_8_Pointer)) + (((((*(var_1_7_Pointer))) < 0 ) ? -((*(var_1_7_Pointer))) : ((*(var_1_7_Pointer)))))))) : 1=1, (*(var_1_2_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer)))))) - last_1_var_1_10))) : ((*(var_1_8_Pointer)) == ((unsigned long int) ((((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer)))))))=1, (*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))=1, \read(*var_1_10_Pointer)=-10, \read(*var_1_10_Pointer)=-10, \read(*var_1_10_Pointer)=-10, \read(*var_1_1_Pointer)=2, \read(*var_1_1_Pointer)=2, \read(*var_1_1_Pointer)=2, \read(*var_1_2_Pointer)=256, \read(*var_1_2_Pointer)=256, \read(*var_1_2_Pointer)=256, \read(*var_1_8_Pointer)=-10, \read(*var_1_8_Pointer)=-10, \read(*var_1_9_Pointer)=2147483647, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L103] EXPR ((*(var_1_1_Pointer)) >= (*(var_1_1_Pointer))) ? ((*(var_1_11_Pointer)) == ((double) ((*(var_1_12_Pointer)) - ((((((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) : ((*(var_1_15_Pointer)))))))) : ((*(var_1_11_Pointer)) == ((double) (((((*(var_1_14_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_13_Pointer))))))) [L103] EXPR \read(*var_1_11_Pointer) [L103] EXPR \read(*var_1_12_Pointer) [L103] EXPR \read(*var_1_13_Pointer) [L103] EXPR \read(*var_1_14_Pointer) [L103] EXPR \read(*var_1_15_Pointer) VAL [(((((*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))) ? (((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer)))))) - last_1_var_1_10))) : ((*(var_1_8_Pointer)) == ((unsigned long int) ((((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer))))))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed long int) ((*(var_1_8_Pointer)) + (((((*(var_1_7_Pointer))) < 0 ) ? -((*(var_1_7_Pointer))) : ((*(var_1_7_Pointer)))))))) : 1)) && (((*(var_1_1_Pointer)) >= (*(var_1_1_Pointer))) ? ((*(var_1_11_Pointer)) == ((double) ((*(var_1_12_Pointer)) - ((((((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) : ((*(var_1_15_Pointer)))))))) : ((*(var_1_11_Pointer)) == ((double) (((((*(var_1_14_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_13_Pointer))))))))=1, ((((*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))) ? (((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer)))))) - last_1_var_1_10))) : ((*(var_1_8_Pointer)) == ((unsigned long int) ((((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer))))))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed long int) ((*(var_1_8_Pointer)) + (((((*(var_1_7_Pointer))) < 0 ) ? -((*(var_1_7_Pointer))) : ((*(var_1_7_Pointer)))))))) : 1)=1, (((*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))) ? (((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer)))))) - last_1_var_1_10))) : ((*(var_1_8_Pointer)) == ((unsigned long int) ((((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer))))))))=1, ((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))=1, ((*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))) ? (((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))=1, ((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer)))=-10, (*(var_1_2_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed long int) ((*(var_1_8_Pointer)) + (((((*(var_1_7_Pointer))) < 0 ) ? -((*(var_1_7_Pointer))) : ((*(var_1_7_Pointer)))))))) : 1=1, (*(var_1_2_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer)))))) - last_1_var_1_10))) : ((*(var_1_8_Pointer)) == ((unsigned long int) ((((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer)))))))=1, (*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))=1, \read(*var_1_10_Pointer)=-10, \read(*var_1_10_Pointer)=-10, \read(*var_1_10_Pointer)=-10, \read(*var_1_11_Pointer)=2147483678, \read(*var_1_12_Pointer)=2147483674, \read(*var_1_13_Pointer)=2147483677, \read(*var_1_14_Pointer)=2147483682, \read(*var_1_15_Pointer)=2147483673, \read(*var_1_1_Pointer)=2, \read(*var_1_1_Pointer)=2, \read(*var_1_1_Pointer)=2, \read(*var_1_2_Pointer)=256, \read(*var_1_2_Pointer)=256, \read(*var_1_2_Pointer)=256, \read(*var_1_8_Pointer)=-10, \read(*var_1_8_Pointer)=-10, \read(*var_1_9_Pointer)=2147483647, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L103] EXPR ((((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) : ((*(var_1_15_Pointer))) [L103] EXPR \read(*var_1_15_Pointer) [L103] EXPR ((((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) : ((*(var_1_15_Pointer))) VAL [(((((*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))) ? (((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer)))))) - last_1_var_1_10))) : ((*(var_1_8_Pointer)) == ((unsigned long int) ((((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer))))))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed long int) ((*(var_1_8_Pointer)) + (((((*(var_1_7_Pointer))) < 0 ) ? -((*(var_1_7_Pointer))) : ((*(var_1_7_Pointer)))))))) : 1)) && (((*(var_1_1_Pointer)) >= (*(var_1_1_Pointer))) ? ((*(var_1_11_Pointer)) == ((double) ((*(var_1_12_Pointer)) - ((((((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) : ((*(var_1_15_Pointer)))))))) : ((*(var_1_11_Pointer)) == ((double) (((((*(var_1_14_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_13_Pointer))))))))=1, ((((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) : ((*(var_1_15_Pointer)))=2147483673, ((((*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))) ? (((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer)))))) - last_1_var_1_10))) : ((*(var_1_8_Pointer)) == ((unsigned long int) ((((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer))))))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed long int) ((*(var_1_8_Pointer)) + (((((*(var_1_7_Pointer))) < 0 ) ? -((*(var_1_7_Pointer))) : ((*(var_1_7_Pointer)))))))) : 1)=1, (((*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))) ? (((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer)))))) - last_1_var_1_10))) : ((*(var_1_8_Pointer)) == ((unsigned long int) ((((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer))))))))=1, ((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))=1, ((*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))) ? (((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))=1, ((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer)))=-10, (*(var_1_2_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed long int) ((*(var_1_8_Pointer)) + (((((*(var_1_7_Pointer))) < 0 ) ? -((*(var_1_7_Pointer))) : ((*(var_1_7_Pointer)))))))) : 1=1, (*(var_1_2_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer)))))) - last_1_var_1_10))) : ((*(var_1_8_Pointer)) == ((unsigned long int) ((((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer)))))))=1, (*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))=1, \read(*var_1_10_Pointer)=-10, \read(*var_1_10_Pointer)=-10, \read(*var_1_10_Pointer)=-10, \read(*var_1_11_Pointer)=2147483678, \read(*var_1_12_Pointer)=2147483674, \read(*var_1_13_Pointer)=2147483677, \read(*var_1_14_Pointer)=2147483682, \read(*var_1_15_Pointer)=2147483673, \read(*var_1_15_Pointer)=2147483673, \read(*var_1_1_Pointer)=2, \read(*var_1_1_Pointer)=2, \read(*var_1_1_Pointer)=2, \read(*var_1_2_Pointer)=256, \read(*var_1_2_Pointer)=256, \read(*var_1_2_Pointer)=256, \read(*var_1_8_Pointer)=-10, \read(*var_1_8_Pointer)=-10, \read(*var_1_9_Pointer)=2147483647, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L103] EXPR ((*(var_1_1_Pointer)) >= (*(var_1_1_Pointer))) ? ((*(var_1_11_Pointer)) == ((double) ((*(var_1_12_Pointer)) - ((((((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) : ((*(var_1_15_Pointer)))))))) : ((*(var_1_11_Pointer)) == ((double) (((((*(var_1_14_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_13_Pointer))))))) VAL [(((((*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))) ? (((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer)))))) - last_1_var_1_10))) : ((*(var_1_8_Pointer)) == ((unsigned long int) ((((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer))))))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed long int) ((*(var_1_8_Pointer)) + (((((*(var_1_7_Pointer))) < 0 ) ? -((*(var_1_7_Pointer))) : ((*(var_1_7_Pointer)))))))) : 1)) && (((*(var_1_1_Pointer)) >= (*(var_1_1_Pointer))) ? ((*(var_1_11_Pointer)) == ((double) ((*(var_1_12_Pointer)) - ((((((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) : ((*(var_1_15_Pointer)))))))) : ((*(var_1_11_Pointer)) == ((double) (((((*(var_1_14_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_13_Pointer))))))))=1, ((((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) : ((*(var_1_15_Pointer)))=2147483673, ((((*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))) ? (((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer)))))) - last_1_var_1_10))) : ((*(var_1_8_Pointer)) == ((unsigned long int) ((((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer))))))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed long int) ((*(var_1_8_Pointer)) + (((((*(var_1_7_Pointer))) < 0 ) ? -((*(var_1_7_Pointer))) : ((*(var_1_7_Pointer)))))))) : 1)=1, (((*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))) ? (((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer)))))) - last_1_var_1_10))) : ((*(var_1_8_Pointer)) == ((unsigned long int) ((((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer))))))))=1, ((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))=1, ((*(var_1_1_Pointer)) >= (*(var_1_1_Pointer))) ? ((*(var_1_11_Pointer)) == ((double) ((*(var_1_12_Pointer)) - ((((((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) : ((*(var_1_15_Pointer)))))))) : ((*(var_1_11_Pointer)) == ((double) (((((*(var_1_14_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_13_Pointer)))))))=0, ((*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))) ? (((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))=1, ((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer)))=-10, (*(var_1_2_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed long int) ((*(var_1_8_Pointer)) + (((((*(var_1_7_Pointer))) < 0 ) ? -((*(var_1_7_Pointer))) : ((*(var_1_7_Pointer)))))))) : 1=1, (*(var_1_2_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer)))))) - last_1_var_1_10))) : ((*(var_1_8_Pointer)) == ((unsigned long int) ((((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer)))))))=1, (*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))=1, \read(*var_1_10_Pointer)=-10, \read(*var_1_10_Pointer)=-10, \read(*var_1_10_Pointer)=-10, \read(*var_1_11_Pointer)=2147483678, \read(*var_1_12_Pointer)=2147483674, \read(*var_1_13_Pointer)=2147483677, \read(*var_1_14_Pointer)=2147483682, \read(*var_1_15_Pointer)=2147483673, \read(*var_1_15_Pointer)=2147483673, \read(*var_1_1_Pointer)=2, \read(*var_1_1_Pointer)=2, \read(*var_1_1_Pointer)=2, \read(*var_1_2_Pointer)=256, \read(*var_1_2_Pointer)=256, \read(*var_1_2_Pointer)=256, \read(*var_1_8_Pointer)=-10, \read(*var_1_8_Pointer)=-10, \read(*var_1_9_Pointer)=2147483647, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L103] EXPR (((((*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))) ? (((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer)))))) - last_1_var_1_10))) : ((*(var_1_8_Pointer)) == ((unsigned long int) ((((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer))))))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed long int) ((*(var_1_8_Pointer)) + (((((*(var_1_7_Pointer))) < 0 ) ? -((*(var_1_7_Pointer))) : ((*(var_1_7_Pointer)))))))) : 1)) && (((*(var_1_1_Pointer)) >= (*(var_1_1_Pointer))) ? ((*(var_1_11_Pointer)) == ((double) ((*(var_1_12_Pointer)) - ((((((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) : ((*(var_1_15_Pointer)))))))) : ((*(var_1_11_Pointer)) == ((double) (((((*(var_1_14_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_13_Pointer)))))))) VAL [(((((*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))) ? (((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer)))))) - last_1_var_1_10))) : ((*(var_1_8_Pointer)) == ((unsigned long int) ((((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer))))))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed long int) ((*(var_1_8_Pointer)) + (((((*(var_1_7_Pointer))) < 0 ) ? -((*(var_1_7_Pointer))) : ((*(var_1_7_Pointer)))))))) : 1)) && (((*(var_1_1_Pointer)) >= (*(var_1_1_Pointer))) ? ((*(var_1_11_Pointer)) == ((double) ((*(var_1_12_Pointer)) - ((((((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) : ((*(var_1_15_Pointer)))))))) : ((*(var_1_11_Pointer)) == ((double) (((((*(var_1_14_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_13_Pointer))))))))=0, ((((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) : ((*(var_1_15_Pointer)))=2147483673, ((((*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))) ? (((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer)))))) - last_1_var_1_10))) : ((*(var_1_8_Pointer)) == ((unsigned long int) ((((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer))))))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed long int) ((*(var_1_8_Pointer)) + (((((*(var_1_7_Pointer))) < 0 ) ? -((*(var_1_7_Pointer))) : ((*(var_1_7_Pointer)))))))) : 1)=1, (((*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))) ? (((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer)))))) - last_1_var_1_10))) : ((*(var_1_8_Pointer)) == ((unsigned long int) ((((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer))))))))=1, ((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))=1, ((*(var_1_1_Pointer)) >= (*(var_1_1_Pointer))) ? ((*(var_1_11_Pointer)) == ((double) ((*(var_1_12_Pointer)) - ((((((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) : ((*(var_1_15_Pointer)))))))) : ((*(var_1_11_Pointer)) == ((double) (((((*(var_1_14_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_13_Pointer)))))))=0, ((*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))) ? (((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))=1, ((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer)))=-10, (*(var_1_2_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed long int) ((*(var_1_8_Pointer)) + (((((*(var_1_7_Pointer))) < 0 ) ? -((*(var_1_7_Pointer))) : ((*(var_1_7_Pointer)))))))) : 1=1, (*(var_1_2_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer)))))) - last_1_var_1_10))) : ((*(var_1_8_Pointer)) == ((unsigned long int) ((((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer)))))))=1, (*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))=1, \read(*var_1_10_Pointer)=-10, \read(*var_1_10_Pointer)=-10, \read(*var_1_10_Pointer)=-10, \read(*var_1_11_Pointer)=2147483678, \read(*var_1_12_Pointer)=2147483674, \read(*var_1_13_Pointer)=2147483677, \read(*var_1_14_Pointer)=2147483682, \read(*var_1_15_Pointer)=2147483673, \read(*var_1_15_Pointer)=2147483673, \read(*var_1_1_Pointer)=2, \read(*var_1_1_Pointer)=2, \read(*var_1_1_Pointer)=2, \read(*var_1_2_Pointer)=256, \read(*var_1_2_Pointer)=256, \read(*var_1_2_Pointer)=256, \read(*var_1_8_Pointer)=-10, \read(*var_1_8_Pointer)=-10, \read(*var_1_9_Pointer)=2147483647, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L103-L104] return (((((*(var_1_2_Pointer)) || ((~ (*(var_1_10_Pointer))) >= (*(var_1_10_Pointer)))) ? (((*(var_1_10_Pointer)) < (*(var_1_8_Pointer))) ? ((! (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_1_Pointer)) == ((signed char) 2))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(var_1_9_Pointer))) < 0 ) ? -((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer)))))) - last_1_var_1_10))) : ((*(var_1_8_Pointer)) == ((unsigned long int) ((((last_1_var_1_10) > ((*(var_1_9_Pointer)))) ? (last_1_var_1_10) : ((*(var_1_9_Pointer))))))))) && ((*(var_1_2_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed long int) ((*(var_1_8_Pointer)) + (((((*(var_1_7_Pointer))) < 0 ) ? -((*(var_1_7_Pointer))) : ((*(var_1_7_Pointer)))))))) : 1)) && (((*(var_1_1_Pointer)) >= (*(var_1_1_Pointer))) ? ((*(var_1_11_Pointer)) == ((double) ((*(var_1_12_Pointer)) - ((((((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_13_Pointer)) + (*(var_1_14_Pointer)))) : ((*(var_1_15_Pointer)))))))) : ((*(var_1_11_Pointer)) == ((double) (((((*(var_1_14_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_13_Pointer)))))))) ; [L113] RET, EXPR property() [L113] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_10=-10, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 113 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 111.5s, OverallIterations: 37, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 46.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10259 SdHoareTripleChecker+Valid, 25.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10257 mSDsluCounter, 26808 SdHoareTripleChecker+Invalid, 22.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21390 mSDsCounter, 995 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17430 IncrementalHoareTripleChecker+Invalid, 18425 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 995 mSolverCounterUnsat, 5418 mSDtfsCounter, 17430 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1588 GetRequests, 1080 SyntacticMatches, 1 SemanticMatches, 507 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1604 ImplicationChecksByTransitivity, 27.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=469occurred in iteration=33, InterpolantAutomatonStates: 330, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.9s AutomataMinimizationTime, 36 MinimizatonAttempts, 3022 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 6.1s SatisfiabilityAnalysisTime, 53.3s InterpolantComputationTime, 4570 NumberOfCodeBlocks, 4570 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 4405 ConstructedInterpolants, 0 QuantifiedInterpolants, 52001 SizeOfPredicates, 14 NumberOfNonLiveVariables, 537 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 37 InterpolantComputations, 36 PerfectInterpolantSequences, 9750/9768 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-06 23:07:38,065 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7031353f-c601-4568-a0c7-5b1cf75b2004/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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_7031353f-c601-4568-a0c7-5b1cf75b2004/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7031353f-c601-4568-a0c7-5b1cf75b2004/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7031353f-c601-4568-a0c7-5b1cf75b2004/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7031353f-c601-4568-a0c7-5b1cf75b2004/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-15.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7031353f-c601-4568-a0c7-5b1cf75b2004/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7031353f-c601-4568-a0c7-5b1cf75b2004/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 944d6be29b18a7b057c10d85533dd285a58675394c7ffcf3e8926ec3db51ce25 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 23:07:41,056 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 23:07:41,227 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7031353f-c601-4568-a0c7-5b1cf75b2004/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-06 23:07:41,236 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 23:07:41,237 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 23:07:41,294 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 23:07:41,295 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 23:07:41,295 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 23:07:41,297 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 23:07:41,303 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 23:07:41,304 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 23:07:41,305 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 23:07:41,305 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 23:07:41,308 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 23:07:41,309 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 23:07:41,309 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 23:07:41,310 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 23:07:41,310 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 23:07:41,311 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 23:07:41,312 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 23:07:41,313 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 23:07:41,313 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 23:07:41,314 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 23:07:41,314 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 23:07:41,315 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 23:07:41,315 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 23:07:41,316 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 23:07:41,317 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 23:07:41,317 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 23:07:41,318 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 23:07:41,319 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:07:41,320 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 23:07:41,320 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 23:07:41,321 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 23:07:41,321 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 23:07:41,321 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 23:07:41,322 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 23:07:41,322 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 23:07:41,322 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 23:07:41,323 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 23:07:41,324 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 23:07:41,324 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 23:07:41,325 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_7031353f-c601-4568-a0c7-5b1cf75b2004/bin/uautomizer-verify-WvqO1wxjHP/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_7031353f-c601-4568-a0c7-5b1cf75b2004/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 944d6be29b18a7b057c10d85533dd285a58675394c7ffcf3e8926ec3db51ce25 [2023-11-06 23:07:41,795 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 23:07:41,823 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 23:07:41,826 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 23:07:41,828 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 23:07:41,832 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 23:07:41,834 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7031353f-c601-4568-a0c7-5b1cf75b2004/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-15.i [2023-11-06 23:07:45,731 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 23:07:46,161 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 23:07:46,171 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7031353f-c601-4568-a0c7-5b1cf75b2004/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-15.i [2023-11-06 23:07:46,191 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7031353f-c601-4568-a0c7-5b1cf75b2004/bin/uautomizer-verify-WvqO1wxjHP/data/a1f266927/dae41030c3434c7e847119280575e8df/FLAGc51400163 [2023-11-06 23:07:46,219 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7031353f-c601-4568-a0c7-5b1cf75b2004/bin/uautomizer-verify-WvqO1wxjHP/data/a1f266927/dae41030c3434c7e847119280575e8df [2023-11-06 23:07:46,225 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 23:07:46,227 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 23:07:46,234 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 23:07:46,234 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 23:07:46,240 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 23:07:46,241 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:07:46" (1/1) ... [2023-11-06 23:07:46,243 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c40ef9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:46, skipping insertion in model container [2023-11-06 23:07:46,243 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:07:46" (1/1) ... [2023-11-06 23:07:46,295 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 23:07:46,545 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_7031353f-c601-4568-a0c7-5b1cf75b2004/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-15.i[916,929] [2023-11-06 23:07:46,610 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:07:46,634 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 23:07:46,650 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_7031353f-c601-4568-a0c7-5b1cf75b2004/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-15.i[916,929] [2023-11-06 23:07:46,693 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:07:46,721 INFO L206 MainTranslator]: Completed translation [2023-11-06 23:07:46,721 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:46 WrapperNode [2023-11-06 23:07:46,722 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 23:07:46,723 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 23:07:46,723 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 23:07:46,724 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 23:07:46,734 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:46" (1/1) ... [2023-11-06 23:07:46,756 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:46" (1/1) ... [2023-11-06 23:07:46,829 INFO L138 Inliner]: procedures = 33, calls = 162, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 471 [2023-11-06 23:07:46,830 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 23:07:46,831 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 23:07:46,831 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 23:07:46,831 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 23:07:46,845 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:46" (1/1) ... [2023-11-06 23:07:46,846 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:46" (1/1) ... [2023-11-06 23:07:46,863 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:46" (1/1) ... [2023-11-06 23:07:46,867 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:46" (1/1) ... [2023-11-06 23:07:46,905 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:46" (1/1) ... [2023-11-06 23:07:46,921 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:46" (1/1) ... [2023-11-06 23:07:46,927 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:46" (1/1) ... [2023-11-06 23:07:46,931 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:46" (1/1) ... [2023-11-06 23:07:46,941 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 23:07:46,959 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 23:07:46,959 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 23:07:46,959 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 23:07:46,961 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:46" (1/1) ... [2023-11-06 23:07:46,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:07:46,994 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7031353f-c601-4568-a0c7-5b1cf75b2004/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:07:47,010 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7031353f-c601-4568-a0c7-5b1cf75b2004/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 23:07:47,046 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7031353f-c601-4568-a0c7-5b1cf75b2004/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 23:07:47,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 23:07:47,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2023-11-06 23:07:47,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2023-11-06 23:07:47,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-11-06 23:07:47,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 23:07:47,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-11-06 23:07:47,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2023-11-06 23:07:47,067 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-11-06 23:07:47,067 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 23:07:47,069 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 23:07:47,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 23:07:47,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 23:07:47,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2023-11-06 23:07:47,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-06 23:07:47,310 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 23:07:47,313 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 23:07:50,714 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 23:07:50,729 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 23:07:50,729 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 23:07:50,734 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:07:50 BoogieIcfgContainer [2023-11-06 23:07:50,734 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 23:07:50,738 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 23:07:50,739 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 23:07:50,743 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 23:07:50,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:07:46" (1/3) ... [2023-11-06 23:07:50,745 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4813d475 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:07:50, skipping insertion in model container [2023-11-06 23:07:50,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:46" (2/3) ... [2023-11-06 23:07:50,749 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4813d475 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:07:50, skipping insertion in model container [2023-11-06 23:07:50,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:07:50" (3/3) ... [2023-11-06 23:07:50,751 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-15.i [2023-11-06 23:07:50,777 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 23:07:50,778 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 23:07:50,863 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 23:07:50,872 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=LoopsAndPotentialCycles, 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;@5d6eddd0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 23:07:50,872 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 23:07:50,879 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 98 states have (on average 1.4489795918367347) internal successors, (142), 99 states have internal predecessors, (142), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-06 23:07:50,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-11-06 23:07:50,902 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:07:50,904 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 23:07:50,904 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:07:50,912 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:07:50,913 INFO L85 PathProgramCache]: Analyzing trace with hash 2035840874, now seen corresponding path program 1 times [2023-11-06 23:07:50,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:07:50,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1630044251] [2023-11-06 23:07:50,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:07:50,935 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-06 23:07:50,935 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7031353f-c601-4568-a0c7-5b1cf75b2004/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:07:50,945 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7031353f-c601-4568-a0c7-5b1cf75b2004/bin/uautomizer-verify-WvqO1wxjHP/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-06 23:07:50,964 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7031353f-c601-4568-a0c7-5b1cf75b2004/bin/uautomizer-verify-WvqO1wxjHP/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-06 23:07:51,412 ERROR L418 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7031353f-c601-4568-a0c7-5b1cf75b2004/bin/uautomizer-verify-WvqO1wxjHP/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)] Exception during sending of exit command (exit): Broken pipe [2023-11-06 23:07:51,419 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7031353f-c601-4568-a0c7-5b1cf75b2004/bin/uautomizer-verify-WvqO1wxjHP/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 139 [2023-11-06 23:07:51,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7031353f-c601-4568-a0c7-5b1cf75b2004/bin/uautomizer-verify-WvqO1wxjHP/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-06 23:07:51,613 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7031353f-c601-4568-a0c7-5b1cf75b2004/bin/uautomizer-verify-WvqO1wxjHP/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) with exit command (exit)) Received EOF on stdin. No stderr output. at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:236) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:91) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:131) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7031353f-c601-4568-a0c7-5b1cf75b2004/bin/uautomizer-verify-WvqO1wxjHP/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) with exit command (exit)) Received EOF on stdin. No stderr output. at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.AnnotateAndAsserter.buildAnnotatedSsaAndAssertTerms(AnnotateAndAsserter.java:130) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.checkTrace(TraceCheck.java:317) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:215) ... 30 more Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 37 more [2023-11-06 23:07:51,618 INFO L158 Benchmark]: Toolchain (without parser) took 5390.27ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 53.9MB in the beginning and 54.9MB in the end (delta: -1.1MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. [2023-11-06 23:07:51,618 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 77.6MB. Free memory is still 53.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:07:51,619 INFO L158 Benchmark]: CACSL2BoogieTranslator took 488.37ms. Allocated memory is still 77.6MB. Free memory was 53.7MB in the beginning and 39.1MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-06 23:07:51,620 INFO L158 Benchmark]: Boogie Procedure Inliner took 106.96ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 39.1MB in the beginning and 72.2MB in the end (delta: -33.1MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. [2023-11-06 23:07:51,621 INFO L158 Benchmark]: Boogie Preprocessor took 110.91ms. Allocated memory is still 94.4MB. Free memory was 72.2MB in the beginning and 68.9MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 23:07:51,623 INFO L158 Benchmark]: RCFGBuilder took 3775.56ms. Allocated memory is still 94.4MB. Free memory was 68.9MB in the beginning and 54.5MB in the end (delta: 14.4MB). Peak memory consumption was 23.6MB. Max. memory is 16.1GB. [2023-11-06 23:07:51,623 INFO L158 Benchmark]: TraceAbstraction took 878.22ms. Allocated memory is still 94.4MB. Free memory was 54.1MB in the beginning and 54.9MB in the end (delta: -868.6kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:07:51,630 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.39ms. Allocated memory is still 77.6MB. Free memory is still 53.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 488.37ms. Allocated memory is still 77.6MB. Free memory was 53.7MB in the beginning and 39.1MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 106.96ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 39.1MB in the beginning and 72.2MB in the end (delta: -33.1MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 110.91ms. Allocated memory is still 94.4MB. Free memory was 72.2MB in the beginning and 68.9MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 3775.56ms. Allocated memory is still 94.4MB. Free memory was 68.9MB in the beginning and 54.5MB in the end (delta: 14.4MB). Peak memory consumption was 23.6MB. Max. memory is 16.1GB. * TraceAbstraction took 878.22ms. Allocated memory is still 94.4MB. Free memory was 54.1MB in the beginning and 54.9MB in the end (delta: -868.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7031353f-c601-4568-a0c7-5b1cf75b2004/bin/uautomizer-verify-WvqO1wxjHP/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) with exit command (exit)) Received EOF on stdin. No stderr output. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7031353f-c601-4568-a0c7-5b1cf75b2004/bin/uautomizer-verify-WvqO1wxjHP/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) with exit command (exit)) Received EOF on stdin. No stderr output.: de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:236) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-11-06 23:07:51,666 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7031353f-c601-4568-a0c7-5b1cf75b2004/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7031353f-c601-4568-a0c7-5b1cf75b2004/bin/uautomizer-verify-WvqO1wxjHP/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) with exit command (exit)) Received EOF on stdin. No stderr output.