./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-34.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-34.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b7d4f9d78490f5290f13c8883d00adc73ba1976bc9e9ac925a881a19aea54245 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:30:08,676 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:30:08,745 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 00:30:08,750 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:30:08,751 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:30:08,776 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:30:08,777 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:30:08,778 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:30:08,778 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 00:30:08,779 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 00:30:08,779 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:30:08,780 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:30:08,781 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:30:08,781 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:30:08,782 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:30:08,782 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:30:08,783 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 00:30:08,783 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 00:30:08,784 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 00:30:08,784 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 00:30:08,785 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:30:08,786 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 00:30:08,786 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:30:08,786 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 00:30:08,787 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 00:30:08,787 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 00:30:08,788 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:30:08,788 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:30:08,789 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:30:08,789 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 00:30:08,789 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:30:08,790 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:30:08,790 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:30:08,790 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:30:08,791 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 00:30:08,791 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 00:30:08,791 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 00:30:08,791 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:30:08,791 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:30:08,792 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 00:30:08,792 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:30:08,792 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:30:08,792 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_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b7d4f9d78490f5290f13c8883d00adc73ba1976bc9e9ac925a881a19aea54245 [2023-11-29 00:30:09,007 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:30:09,028 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:30:09,031 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:30:09,032 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:30:09,032 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:30:09,034 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-34.i [2023-11-29 00:30:11,821 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:30:11,988 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:30:11,989 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-34.i [2023-11-29 00:30:11,997 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/data/a5da50f9a/eb71b0315a3949c69747e26363ab2119/FLAG08742a02f [2023-11-29 00:30:12,010 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/data/a5da50f9a/eb71b0315a3949c69747e26363ab2119 [2023-11-29 00:30:12,012 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:30:12,014 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:30:12,015 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:30:12,015 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:30:12,020 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:30:12,020 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:30:12" (1/1) ... [2023-11-29 00:30:12,021 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ef6fe8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:30:12, skipping insertion in model container [2023-11-29 00:30:12,021 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:30:12" (1/1) ... [2023-11-29 00:30:12,048 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:30:12,163 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_c1ee620e-1e99-4575-8051-7b00d678fb60/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-34.i[917,930] [2023-11-29 00:30:12,220 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:30:12,233 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 00:30:12,243 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_c1ee620e-1e99-4575-8051-7b00d678fb60/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-34.i[917,930] [2023-11-29 00:30:12,278 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:30:12,297 INFO L206 MainTranslator]: Completed translation [2023-11-29 00:30:12,298 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:30:12 WrapperNode [2023-11-29 00:30:12,298 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:30:12,299 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 00:30:12,299 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 00:30:12,299 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 00:30:12,305 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:30:12" (1/1) ... [2023-11-29 00:30:12,318 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:30:12" (1/1) ... [2023-11-29 00:30:12,358 INFO L138 Inliner]: procedures = 29, calls = 150, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 407 [2023-11-29 00:30:12,358 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 00:30:12,359 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 00:30:12,359 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 00:30:12,359 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 00:30:12,369 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:30:12" (1/1) ... [2023-11-29 00:30:12,369 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:30:12" (1/1) ... [2023-11-29 00:30:12,375 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:30:12" (1/1) ... [2023-11-29 00:30:12,397 INFO L175 MemorySlicer]: Split 115 memory accesses to 2 slices as follows [2, 113]. 98 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 16]. The 18 writes are split as follows [0, 18]. [2023-11-29 00:30:12,398 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:30:12" (1/1) ... [2023-11-29 00:30:12,398 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:30:12" (1/1) ... [2023-11-29 00:30:12,415 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:30:12" (1/1) ... [2023-11-29 00:30:12,420 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:30:12" (1/1) ... [2023-11-29 00:30:12,423 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:30:12" (1/1) ... [2023-11-29 00:30:12,426 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:30:12" (1/1) ... [2023-11-29 00:30:12,431 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 00:30:12,432 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 00:30:12,432 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 00:30:12,433 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 00:30:12,433 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:30:12" (1/1) ... [2023-11-29 00:30:12,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:30:12,450 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:30:12,469 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 00:30:12,471 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 00:30:12,500 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 00:30:12,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 00:30:12,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 00:30:12,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-11-29 00:30:12,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-11-29 00:30:12,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-11-29 00:30:12,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-11-29 00:30:12,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 00:30:12,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 00:30:12,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-11-29 00:30:12,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-11-29 00:30:12,502 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 00:30:12,502 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 00:30:12,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 00:30:12,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 00:30:12,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 00:30:12,503 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 00:30:12,615 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 00:30:12,617 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 00:30:13,024 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 00:30:13,062 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 00:30:13,062 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 00:30:13,063 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:30:13 BoogieIcfgContainer [2023-11-29 00:30:13,063 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 00:30:13,089 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 00:30:13,089 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 00:30:13,092 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 00:30:13,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:30:12" (1/3) ... [2023-11-29 00:30:13,093 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@652fbd86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:30:13, skipping insertion in model container [2023-11-29 00:30:13,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:30:12" (2/3) ... [2023-11-29 00:30:13,094 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@652fbd86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:30:13, skipping insertion in model container [2023-11-29 00:30:13,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:30:13" (3/3) ... [2023-11-29 00:30:13,095 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-34.i [2023-11-29 00:30:13,112 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 00:30:13,119 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 00:30:13,167 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:30:13,173 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7f968084, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:30:13,173 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 00:30:13,176 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 87 states have (on average 1.4022988505747127) internal successors, (122), 88 states have internal predecessors, (122), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-29 00:30:13,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2023-11-29 00:30:13,191 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:30:13,192 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:30:13,192 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:30:13,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:30:13,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1982887210, now seen corresponding path program 1 times [2023-11-29 00:30:13,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:30:13,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777562186] [2023-11-29 00:30:13,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:30:13,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:30:13,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:13,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:30:13,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:13,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:30:13,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:13,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:30:13,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:13,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:30:13,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:13,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:30:13,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:13,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:30:13,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:13,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 00:30:13,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:13,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 00:30:13,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:13,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 00:30:13,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:13,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 00:30:13,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:13,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 00:30:13,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:13,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 00:30:13,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:13,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 00:30:13,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:13,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 00:30:13,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:13,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 00:30:13,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:13,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 00:30:13,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:13,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:30:13,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:13,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 00:30:13,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:13,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 00:30:13,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:13,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 00:30:13,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:13,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 00:30:13,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:13,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 00:30:13,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:13,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 00:30:13,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:13,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 00:30:13,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:30:13,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777562186] [2023-11-29 00:30:13,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777562186] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:30:13,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:30:13,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:30:13,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134142984] [2023-11-29 00:30:13,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:30:13,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 00:30:13,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:30:13,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 00:30:13,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 00:30:13,661 INFO L87 Difference]: Start difference. First operand has 113 states, 87 states have (on average 1.4022988505747127) internal successors, (122), 88 states have internal predecessors, (122), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2023-11-29 00:30:13,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:30:13,708 INFO L93 Difference]: Finished difference Result 223 states and 357 transitions. [2023-11-29 00:30:13,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 00:30:13,710 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 166 [2023-11-29 00:30:13,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:30:13,719 INFO L225 Difference]: With dead ends: 223 [2023-11-29 00:30:13,719 INFO L226 Difference]: Without dead ends: 111 [2023-11-29 00:30:13,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 00:30:13,727 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 159 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-29 00:30:13,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:30:13,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-11-29 00:30:13,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2023-11-29 00:30:13,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 86 states have (on average 1.3604651162790697) internal successors, (117), 86 states have internal predecessors, (117), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-29 00:30:13,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 163 transitions. [2023-11-29 00:30:13,781 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 163 transitions. Word has length 166 [2023-11-29 00:30:13,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:30:13,782 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 163 transitions. [2023-11-29 00:30:13,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2023-11-29 00:30:13,783 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 163 transitions. [2023-11-29 00:30:13,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2023-11-29 00:30:13,787 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:30:13,788 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:30:13,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 00:30:13,788 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:30:13,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:30:13,789 INFO L85 PathProgramCache]: Analyzing trace with hash 799028980, now seen corresponding path program 1 times [2023-11-29 00:30:13,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:30:13,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914495289] [2023-11-29 00:30:13,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:30:13,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:30:13,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:13,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:30:13,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:13,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:30:13,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:13,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:30:13,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:13,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:30:13,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:30:14,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:30:14,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 00:30:14,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 00:30:14,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 00:30:14,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 00:30:14,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 00:30:14,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 00:30:14,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 00:30:14,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 00:30:14,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 00:30:14,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 00:30:14,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:30:14,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 00:30:14,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 00:30:14,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 00:30:14,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 00:30:14,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 00:30:14,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 00:30:14,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 00:30:14,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:30:14,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914495289] [2023-11-29 00:30:14,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914495289] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:30:14,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:30:14,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:30:14,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326119682] [2023-11-29 00:30:14,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:30:14,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:30:14,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:30:14,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:30:14,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:30:14,068 INFO L87 Difference]: Start difference. First operand 111 states and 163 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:30:14,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:30:14,108 INFO L93 Difference]: Finished difference Result 222 states and 327 transitions. [2023-11-29 00:30:14,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:30:14,109 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 166 [2023-11-29 00:30:14,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:30:14,112 INFO L225 Difference]: With dead ends: 222 [2023-11-29 00:30:14,112 INFO L226 Difference]: Without dead ends: 112 [2023-11-29 00:30:14,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:30:14,115 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 0 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:30:14,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 311 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:30:14,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-11-29 00:30:14,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2023-11-29 00:30:14,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 87 states have (on average 1.3563218390804597) internal successors, (118), 87 states have internal predecessors, (118), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-29 00:30:14,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 164 transitions. [2023-11-29 00:30:14,131 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 164 transitions. Word has length 166 [2023-11-29 00:30:14,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:30:14,133 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 164 transitions. [2023-11-29 00:30:14,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:30:14,134 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 164 transitions. [2023-11-29 00:30:14,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2023-11-29 00:30:14,137 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:30:14,137 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:30:14,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 00:30:14,138 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:30:14,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:30:14,138 INFO L85 PathProgramCache]: Analyzing trace with hash -889914762, now seen corresponding path program 1 times [2023-11-29 00:30:14,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:30:14,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417848553] [2023-11-29 00:30:14,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:30:14,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:30:14,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:30:14,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:30:14,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:30:14,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:30:14,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:30:14,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:30:14,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 00:30:14,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 00:30:14,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 00:30:14,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 00:30:14,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 00:30:14,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 00:30:14,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 00:30:14,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 00:30:14,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 00:30:14,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 00:30:14,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:30:14,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 00:30:14,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 00:30:14,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 00:30:14,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 00:30:14,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 00:30:14,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 00:30:14,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 00:30:14,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:30:14,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417848553] [2023-11-29 00:30:14,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417848553] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:30:14,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:30:14,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:30:14,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894756765] [2023-11-29 00:30:14,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:30:14,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:30:14,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:30:14,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:30:14,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:30:14,473 INFO L87 Difference]: Start difference. First operand 112 states and 164 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:30:14,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:30:14,528 INFO L93 Difference]: Finished difference Result 247 states and 363 transitions. [2023-11-29 00:30:14,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:30:14,529 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 166 [2023-11-29 00:30:14,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:30:14,531 INFO L225 Difference]: With dead ends: 247 [2023-11-29 00:30:14,531 INFO L226 Difference]: Without dead ends: 136 [2023-11-29 00:30:14,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:30:14,533 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 61 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:30:14,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 487 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:30:14,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-11-29 00:30:14,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 114. [2023-11-29 00:30:14,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 89 states have (on average 1.348314606741573) internal successors, (120), 89 states have internal predecessors, (120), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-29 00:30:14,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 166 transitions. [2023-11-29 00:30:14,546 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 166 transitions. Word has length 166 [2023-11-29 00:30:14,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:30:14,546 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 166 transitions. [2023-11-29 00:30:14,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:30:14,547 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 166 transitions. [2023-11-29 00:30:14,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2023-11-29 00:30:14,549 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:30:14,550 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:30:14,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 00:30:14,550 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:30:14,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:30:14,550 INFO L85 PathProgramCache]: Analyzing trace with hash -543757980, now seen corresponding path program 1 times [2023-11-29 00:30:14,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:30:14,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353980810] [2023-11-29 00:30:14,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:30:14,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:30:14,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:30:14,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:30:14,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:30:14,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:30:14,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:30:14,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:30:14,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 00:30:14,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 00:30:14,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 00:30:14,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 00:30:14,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 00:30:14,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 00:30:14,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 00:30:14,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 00:30:14,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 00:30:14,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 00:30:14,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:30:14,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 00:30:14,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 00:30:14,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 00:30:14,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 00:30:14,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 00:30:14,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 00:30:14,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 00:30:14,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:30:14,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353980810] [2023-11-29 00:30:14,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353980810] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:30:14,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:30:14,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:30:14,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069411522] [2023-11-29 00:30:14,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:30:14,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:30:14,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:30:14,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:30:14,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:30:14,747 INFO L87 Difference]: Start difference. First operand 114 states and 166 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:30:14,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:30:14,780 INFO L93 Difference]: Finished difference Result 276 states and 402 transitions. [2023-11-29 00:30:14,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:30:14,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 168 [2023-11-29 00:30:14,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:30:14,783 INFO L225 Difference]: With dead ends: 276 [2023-11-29 00:30:14,783 INFO L226 Difference]: Without dead ends: 163 [2023-11-29 00:30:14,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:30:14,785 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 56 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:30:14,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 309 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:30:14,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2023-11-29 00:30:14,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 133. [2023-11-29 00:30:14,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 108 states have (on average 1.3703703703703705) internal successors, (148), 108 states have internal predecessors, (148), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-29 00:30:14,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 194 transitions. [2023-11-29 00:30:14,798 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 194 transitions. Word has length 168 [2023-11-29 00:30:14,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:30:14,798 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 194 transitions. [2023-11-29 00:30:14,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:30:14,799 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 194 transitions. [2023-11-29 00:30:14,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2023-11-29 00:30:14,801 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:30:14,801 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:30:14,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 00:30:14,802 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:30:14,802 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:30:14,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1410011260, now seen corresponding path program 1 times [2023-11-29 00:30:14,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:30:14,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777420345] [2023-11-29 00:30:14,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:30:14,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:30:14,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:30:14,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:30:14,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:30:14,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:30:14,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:30:14,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:30:14,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 00:30:14,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 00:30:14,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 00:30:14,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 00:30:14,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 00:30:14,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 00:30:14,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 00:30:14,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 00:30:14,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 00:30:14,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 00:30:14,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:30:14,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 00:30:14,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 00:30:14,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 00:30:14,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 00:30:14,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 00:30:14,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 00:30:14,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:14,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 00:30:14,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:30:14,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777420345] [2023-11-29 00:30:14,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777420345] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:30:14,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:30:14,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:30:14,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311753116] [2023-11-29 00:30:15,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:30:15,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:30:15,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:30:15,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:30:15,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:30:15,002 INFO L87 Difference]: Start difference. First operand 133 states and 194 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:30:15,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:30:15,030 INFO L93 Difference]: Finished difference Result 280 states and 409 transitions. [2023-11-29 00:30:15,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:30:15,031 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 171 [2023-11-29 00:30:15,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:30:15,033 INFO L225 Difference]: With dead ends: 280 [2023-11-29 00:30:15,033 INFO L226 Difference]: Without dead ends: 148 [2023-11-29 00:30:15,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:30:15,035 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 26 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:30:15,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 324 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:30:15,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2023-11-29 00:30:15,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 134. [2023-11-29 00:30:15,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 109 states have (on average 1.3669724770642202) internal successors, (149), 109 states have internal predecessors, (149), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-29 00:30:15,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 195 transitions. [2023-11-29 00:30:15,046 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 195 transitions. Word has length 171 [2023-11-29 00:30:15,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:30:15,047 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 195 transitions. [2023-11-29 00:30:15,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:30:15,048 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 195 transitions. [2023-11-29 00:30:15,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2023-11-29 00:30:15,050 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:30:15,051 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:30:15,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 00:30:15,051 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:30:15,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:30:15,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1151845822, now seen corresponding path program 1 times [2023-11-29 00:30:15,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:30:15,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428442684] [2023-11-29 00:30:15,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:30:15,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:30:15,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:16,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:30:16,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:16,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:30:16,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:16,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:30:16,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:16,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:30:16,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:16,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:30:16,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:16,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:30:16,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:16,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 00:30:16,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:16,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 00:30:16,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:16,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 00:30:16,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:16,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 00:30:16,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:16,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 00:30:16,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:16,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 00:30:16,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:16,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 00:30:16,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:16,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 00:30:16,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:16,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 00:30:16,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:16,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 00:30:16,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:16,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:30:16,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:16,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 00:30:16,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:16,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 00:30:16,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:16,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 00:30:16,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:16,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 00:30:16,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:16,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 00:30:16,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:16,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 00:30:16,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:16,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 00:30:16,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:30:16,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428442684] [2023-11-29 00:30:16,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428442684] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:30:16,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:30:16,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 00:30:16,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495485458] [2023-11-29 00:30:16,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:30:16,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 00:30:16,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:30:16,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 00:30:16,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:30:16,218 INFO L87 Difference]: Start difference. First operand 134 states and 195 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:30:16,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:30:16,612 INFO L93 Difference]: Finished difference Result 334 states and 483 transitions. [2023-11-29 00:30:16,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 00:30:16,613 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 171 [2023-11-29 00:30:16,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:30:16,616 INFO L225 Difference]: With dead ends: 334 [2023-11-29 00:30:16,616 INFO L226 Difference]: Without dead ends: 201 [2023-11-29 00:30:16,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2023-11-29 00:30:16,618 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 165 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 00:30:16,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 1040 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 00:30:16,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2023-11-29 00:30:16,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 163. [2023-11-29 00:30:16,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 138 states have (on average 1.3695652173913044) internal successors, (189), 138 states have internal predecessors, (189), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-29 00:30:16,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 235 transitions. [2023-11-29 00:30:16,630 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 235 transitions. Word has length 171 [2023-11-29 00:30:16,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:30:16,631 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 235 transitions. [2023-11-29 00:30:16,631 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:30:16,631 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 235 transitions. [2023-11-29 00:30:16,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2023-11-29 00:30:16,633 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:30:16,633 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:30:16,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 00:30:16,634 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:30:16,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:30:16,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1544872832, now seen corresponding path program 1 times [2023-11-29 00:30:16,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:30:16,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044722994] [2023-11-29 00:30:16,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:30:16,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:30:16,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:17,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:30:17,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:17,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:30:17,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:17,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:30:17,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:17,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:30:17,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:17,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:30:17,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:17,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:30:17,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:17,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 00:30:17,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:17,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 00:30:17,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:17,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 00:30:17,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:17,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 00:30:17,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:17,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 00:30:17,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:17,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 00:30:17,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:17,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 00:30:17,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:17,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 00:30:17,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:17,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 00:30:17,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:17,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 00:30:17,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:17,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:30:17,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:17,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 00:30:17,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:17,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 00:30:17,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:17,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 00:30:17,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:17,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 00:30:17,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:17,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 00:30:17,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:17,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 00:30:17,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:17,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 00:30:17,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:30:17,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044722994] [2023-11-29 00:30:17,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044722994] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:30:17,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:30:17,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 00:30:17,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540446264] [2023-11-29 00:30:17,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:30:17,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 00:30:17,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:30:17,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 00:30:17,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-29 00:30:17,580 INFO L87 Difference]: Start difference. First operand 163 states and 235 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2023-11-29 00:30:18,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:30:18,189 INFO L93 Difference]: Finished difference Result 377 states and 542 transitions. [2023-11-29 00:30:18,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 00:30:18,190 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 171 [2023-11-29 00:30:18,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:30:18,192 INFO L225 Difference]: With dead ends: 377 [2023-11-29 00:30:18,192 INFO L226 Difference]: Without dead ends: 215 [2023-11-29 00:30:18,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2023-11-29 00:30:18,194 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 281 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 00:30:18,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 417 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 00:30:18,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2023-11-29 00:30:18,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 163. [2023-11-29 00:30:18,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 138 states have (on average 1.3623188405797102) internal successors, (188), 138 states have internal predecessors, (188), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-29 00:30:18,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 234 transitions. [2023-11-29 00:30:18,209 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 234 transitions. Word has length 171 [2023-11-29 00:30:18,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:30:18,210 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 234 transitions. [2023-11-29 00:30:18,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2023-11-29 00:30:18,210 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 234 transitions. [2023-11-29 00:30:18,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2023-11-29 00:30:18,213 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:30:18,213 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:30:18,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 00:30:18,213 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:30:18,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:30:18,214 INFO L85 PathProgramCache]: Analyzing trace with hash -932991104, now seen corresponding path program 1 times [2023-11-29 00:30:18,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:30:18,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354008296] [2023-11-29 00:30:18,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:30:18,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:30:18,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:18,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:30:18,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:18,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:30:18,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:18,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:30:18,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:18,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:30:18,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:18,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:30:18,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:18,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:30:18,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:18,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 00:30:18,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:18,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 00:30:18,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:18,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 00:30:18,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:18,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 00:30:18,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:18,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 00:30:18,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:18,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 00:30:18,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:18,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 00:30:18,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:18,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 00:30:18,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:19,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 00:30:19,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:19,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 00:30:19,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:19,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:30:19,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:19,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 00:30:19,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:19,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 00:30:19,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:19,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 00:30:19,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:19,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 00:30:19,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:19,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 00:30:19,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:19,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 00:30:19,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:19,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 00:30:19,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:30:19,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354008296] [2023-11-29 00:30:19,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354008296] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:30:19,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:30:19,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 00:30:19,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728084862] [2023-11-29 00:30:19,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:30:19,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 00:30:19,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:30:19,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 00:30:19,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-29 00:30:19,060 INFO L87 Difference]: Start difference. First operand 163 states and 234 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2023-11-29 00:30:19,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:30:19,606 INFO L93 Difference]: Finished difference Result 375 states and 538 transitions. [2023-11-29 00:30:19,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:30:19,607 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 171 [2023-11-29 00:30:19,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:30:19,609 INFO L225 Difference]: With dead ends: 375 [2023-11-29 00:30:19,610 INFO L226 Difference]: Without dead ends: 213 [2023-11-29 00:30:19,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2023-11-29 00:30:19,611 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 183 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 00:30:19,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 462 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 00:30:19,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2023-11-29 00:30:19,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 186. [2023-11-29 00:30:19,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 161 states have (on average 1.3726708074534162) internal successors, (221), 161 states have internal predecessors, (221), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-29 00:30:19,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 267 transitions. [2023-11-29 00:30:19,630 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 267 transitions. Word has length 171 [2023-11-29 00:30:19,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:30:19,630 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 267 transitions. [2023-11-29 00:30:19,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2023-11-29 00:30:19,631 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 267 transitions. [2023-11-29 00:30:19,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2023-11-29 00:30:19,633 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:30:19,634 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:30:19,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 00:30:19,634 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:30:19,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:30:19,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1326018114, now seen corresponding path program 1 times [2023-11-29 00:30:19,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:30:19,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142240275] [2023-11-29 00:30:19,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:30:19,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:30:19,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:20,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:30:20,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:20,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:30:20,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:20,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:30:20,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:20,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:30:20,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:20,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:30:20,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:20,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:30:20,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:20,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 00:30:20,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:20,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 00:30:20,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:20,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 00:30:20,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:20,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 00:30:20,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:20,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 00:30:20,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:20,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 00:30:20,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:20,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 00:30:20,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:20,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 00:30:20,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:20,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 00:30:20,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:20,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 00:30:20,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:21,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:30:21,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:21,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 00:30:21,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:21,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 00:30:21,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:21,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 00:30:21,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:21,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 00:30:21,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:21,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 00:30:21,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:21,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 00:30:21,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:21,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 00:30:21,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:30:21,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142240275] [2023-11-29 00:30:21,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142240275] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:30:21,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:30:21,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 00:30:21,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345700744] [2023-11-29 00:30:21,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:30:21,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 00:30:21,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:30:21,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 00:30:21,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-11-29 00:30:21,030 INFO L87 Difference]: Start difference. First operand 186 states and 267 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:30:22,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:30:22,142 INFO L93 Difference]: Finished difference Result 412 states and 590 transitions. [2023-11-29 00:30:22,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 00:30:22,143 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 171 [2023-11-29 00:30:22,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:30:22,145 INFO L225 Difference]: With dead ends: 412 [2023-11-29 00:30:22,145 INFO L226 Difference]: Without dead ends: 227 [2023-11-29 00:30:22,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2023-11-29 00:30:22,147 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 259 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 1127 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 00:30:22,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 1127 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 00:30:22,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2023-11-29 00:30:22,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 186. [2023-11-29 00:30:22,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 161 states have (on average 1.3726708074534162) internal successors, (221), 161 states have internal predecessors, (221), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-29 00:30:22,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 267 transitions. [2023-11-29 00:30:22,166 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 267 transitions. Word has length 171 [2023-11-29 00:30:22,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:30:22,167 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 267 transitions. [2023-11-29 00:30:22,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:30:22,167 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 267 transitions. [2023-11-29 00:30:22,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2023-11-29 00:30:22,169 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:30:22,170 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:30:22,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 00:30:22,170 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:30:22,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:30:22,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1450268400, now seen corresponding path program 1 times [2023-11-29 00:30:22,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:30:22,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990965340] [2023-11-29 00:30:22,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:30:22,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:30:22,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:22,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:30:22,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:22,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:30:22,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:22,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:30:22,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:22,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:30:22,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:22,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:30:22,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:22,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:30:22,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:22,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 00:30:22,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:22,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 00:30:22,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:22,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 00:30:22,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:22,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 00:30:22,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:22,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 00:30:22,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:22,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 00:30:22,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:22,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 00:30:22,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:22,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 00:30:22,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:22,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 00:30:22,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:22,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 00:30:22,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:22,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:30:22,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:22,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 00:30:22,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:22,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 00:30:22,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:22,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 00:30:22,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:22,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 00:30:22,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:22,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 00:30:22,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:22,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 00:30:22,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:22,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 00:30:22,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:30:22,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990965340] [2023-11-29 00:30:22,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990965340] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:30:22,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:30:22,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:30:22,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617916591] [2023-11-29 00:30:22,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:30:22,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:30:22,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:30:22,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:30:22,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:30:22,330 INFO L87 Difference]: Start difference. First operand 186 states and 267 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:30:22,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:30:22,373 INFO L93 Difference]: Finished difference Result 409 states and 586 transitions. [2023-11-29 00:30:22,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:30:22,373 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 171 [2023-11-29 00:30:22,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:30:22,375 INFO L225 Difference]: With dead ends: 409 [2023-11-29 00:30:22,376 INFO L226 Difference]: Without dead ends: 224 [2023-11-29 00:30:22,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:30:22,377 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 60 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:30:22,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 361 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:30:22,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2023-11-29 00:30:22,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 186. [2023-11-29 00:30:22,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 161 states have (on average 1.329192546583851) internal successors, (214), 161 states have internal predecessors, (214), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-29 00:30:22,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 260 transitions. [2023-11-29 00:30:22,395 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 260 transitions. Word has length 171 [2023-11-29 00:30:22,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:30:22,395 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 260 transitions. [2023-11-29 00:30:22,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:30:22,396 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 260 transitions. [2023-11-29 00:30:22,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2023-11-29 00:30:22,398 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:30:22,398 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:30:22,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 00:30:22,398 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:30:22,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:30:22,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1097966277, now seen corresponding path program 1 times [2023-11-29 00:30:22,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:30:22,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017070164] [2023-11-29 00:30:22,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:30:22,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:30:22,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:22,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:30:22,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:22,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:30:22,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:22,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:30:22,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:22,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:30:22,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:22,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:30:22,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:22,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:30:22,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:22,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 00:30:22,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:22,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 00:30:22,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:22,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 00:30:22,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:22,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 00:30:22,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:22,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 00:30:22,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:23,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 00:30:23,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:23,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 00:30:23,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:23,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 00:30:23,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:23,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 00:30:23,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:23,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 00:30:23,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:23,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:30:23,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:23,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 00:30:23,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:23,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 00:30:23,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:23,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 00:30:23,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:23,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 00:30:23,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:23,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 00:30:23,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:23,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 00:30:23,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:23,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 00:30:23,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:30:23,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017070164] [2023-11-29 00:30:23,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017070164] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:30:23,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:30:23,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 00:30:23,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058666118] [2023-11-29 00:30:23,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:30:23,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 00:30:23,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:30:23,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 00:30:23,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:30:23,051 INFO L87 Difference]: Start difference. First operand 186 states and 260 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:30:23,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:30:23,483 INFO L93 Difference]: Finished difference Result 436 states and 608 transitions. [2023-11-29 00:30:23,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 00:30:23,484 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 172 [2023-11-29 00:30:23,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:30:23,486 INFO L225 Difference]: With dead ends: 436 [2023-11-29 00:30:23,487 INFO L226 Difference]: Without dead ends: 251 [2023-11-29 00:30:23,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2023-11-29 00:30:23,488 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 190 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 00:30:23,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 581 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 00:30:23,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2023-11-29 00:30:23,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 199. [2023-11-29 00:30:23,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 174 states have (on average 1.3218390804597702) internal successors, (230), 174 states have internal predecessors, (230), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-29 00:30:23,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 276 transitions. [2023-11-29 00:30:23,509 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 276 transitions. Word has length 172 [2023-11-29 00:30:23,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:30:23,510 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 276 transitions. [2023-11-29 00:30:23,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:30:23,510 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 276 transitions. [2023-11-29 00:30:23,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2023-11-29 00:30:23,513 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:30:23,513 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:30:23,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 00:30:23,513 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:30:23,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:30:23,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1774683992, now seen corresponding path program 1 times [2023-11-29 00:30:23,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:30:23,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211855638] [2023-11-29 00:30:23,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:30:23,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:30:23,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:24,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:30:24,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:24,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:30:24,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:24,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:30:24,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:24,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:30:24,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:24,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:30:24,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:24,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:30:24,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:24,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 00:30:24,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:24,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 00:30:24,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:24,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 00:30:24,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:24,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 00:30:24,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:24,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 00:30:24,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:24,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 00:30:24,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:24,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 00:30:24,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:24,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 00:30:24,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:24,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 00:30:24,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:24,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 00:30:24,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:24,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:30:24,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:24,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 00:30:24,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:24,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 00:30:24,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:24,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 00:30:24,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:24,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 00:30:24,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:24,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 00:30:24,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:24,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 00:30:24,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:24,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 00:30:24,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:30:24,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211855638] [2023-11-29 00:30:24,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211855638] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:30:24,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:30:24,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 00:30:24,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511247385] [2023-11-29 00:30:24,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:30:24,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 00:30:24,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:30:24,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 00:30:24,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:30:24,199 INFO L87 Difference]: Start difference. First operand 199 states and 276 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:30:24,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:30:24,683 INFO L93 Difference]: Finished difference Result 480 states and 667 transitions. [2023-11-29 00:30:24,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 00:30:24,684 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), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 173 [2023-11-29 00:30:24,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:30:24,686 INFO L225 Difference]: With dead ends: 480 [2023-11-29 00:30:24,686 INFO L226 Difference]: Without dead ends: 282 [2023-11-29 00:30:24,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 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-29 00:30:24,688 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 203 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 00:30:24,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 565 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 00:30:24,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2023-11-29 00:30:24,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 228. [2023-11-29 00:30:24,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 203 states have (on average 1.3251231527093597) internal successors, (269), 203 states have internal predecessors, (269), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-29 00:30:24,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 315 transitions. [2023-11-29 00:30:24,709 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 315 transitions. Word has length 173 [2023-11-29 00:30:24,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:30:24,709 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 315 transitions. [2023-11-29 00:30:24,710 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), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:30:24,710 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 315 transitions. [2023-11-29 00:30:24,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2023-11-29 00:30:24,712 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:30:24,712 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:30:24,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 00:30:24,713 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:30:24,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:30:24,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1836723606, now seen corresponding path program 1 times [2023-11-29 00:30:24,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:30:24,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047405782] [2023-11-29 00:30:24,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:30:24,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:30:24,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:25,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:30:25,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:25,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:30:25,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:25,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:30:25,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:25,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:30:25,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:25,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:30:25,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:25,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:30:25,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:25,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 00:30:25,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:25,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 00:30:25,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:25,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 00:30:25,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:25,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 00:30:25,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:25,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 00:30:25,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:25,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 00:30:25,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:25,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 00:30:25,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:25,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 00:30:25,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:25,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 00:30:25,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:25,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 00:30:25,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:25,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:30:25,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:25,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 00:30:25,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:25,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 00:30:25,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:25,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 00:30:25,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:25,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 00:30:25,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:25,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 00:30:25,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:25,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 00:30:25,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:25,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 00:30:25,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:30:25,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047405782] [2023-11-29 00:30:25,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047405782] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:30:25,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:30:25,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 00:30:25,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904803899] [2023-11-29 00:30:25,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:30:25,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 00:30:25,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:30:25,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 00:30:25,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-29 00:30:25,402 INFO L87 Difference]: Start difference. First operand 228 states and 315 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:30:25,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:30:25,821 INFO L93 Difference]: Finished difference Result 519 states and 717 transitions. [2023-11-29 00:30:25,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 00:30:25,821 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 173 [2023-11-29 00:30:25,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:30:25,824 INFO L225 Difference]: With dead ends: 519 [2023-11-29 00:30:25,824 INFO L226 Difference]: Without dead ends: 292 [2023-11-29 00:30:25,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-11-29 00:30:25,825 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 276 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 00:30:25,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 574 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 00:30:25,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2023-11-29 00:30:25,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 212. [2023-11-29 00:30:25,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 187 states have (on average 1.3262032085561497) internal successors, (248), 187 states have internal predecessors, (248), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-29 00:30:25,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 294 transitions. [2023-11-29 00:30:25,845 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 294 transitions. Word has length 173 [2023-11-29 00:30:25,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:30:25,845 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 294 transitions. [2023-11-29 00:30:25,846 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:30:25,846 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 294 transitions. [2023-11-29 00:30:25,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2023-11-29 00:30:25,848 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:30:25,848 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:30:25,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 00:30:25,849 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:30:25,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:30:25,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1098401000, now seen corresponding path program 1 times [2023-11-29 00:30:25,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:30:25,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630980895] [2023-11-29 00:30:25,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:30:25,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:30:25,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:26,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:30:26,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:26,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:30:26,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:26,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:30:26,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:26,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:30:26,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:26,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:30:26,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:26,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:30:26,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:26,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 00:30:26,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:26,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 00:30:26,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:26,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 00:30:26,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:26,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 00:30:26,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:26,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 00:30:26,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:26,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 00:30:26,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:26,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 00:30:26,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:26,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 00:30:26,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:26,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 00:30:26,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:26,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 00:30:26,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:26,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:30:26,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:26,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 00:30:26,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:26,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 00:30:26,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:26,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 00:30:26,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:26,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 00:30:26,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:26,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 00:30:26,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:26,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 00:30:26,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:26,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 00:30:26,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:30:26,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630980895] [2023-11-29 00:30:26,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630980895] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:30:26,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:30:26,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 00:30:26,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655246444] [2023-11-29 00:30:26,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:30:26,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 00:30:26,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:30:26,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 00:30:26,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:30:26,357 INFO L87 Difference]: Start difference. First operand 212 states and 294 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:30:26,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:30:26,778 INFO L93 Difference]: Finished difference Result 473 states and 655 transitions. [2023-11-29 00:30:26,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:30:26,779 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), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 173 [2023-11-29 00:30:26,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:30:26,781 INFO L225 Difference]: With dead ends: 473 [2023-11-29 00:30:26,781 INFO L226 Difference]: Without dead ends: 262 [2023-11-29 00:30:26,782 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:30:26,782 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 261 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 00:30:26,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 424 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 00:30:26,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2023-11-29 00:30:26,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 225. [2023-11-29 00:30:26,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 200 states have (on average 1.305) internal successors, (261), 200 states have internal predecessors, (261), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-29 00:30:26,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 307 transitions. [2023-11-29 00:30:26,802 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 307 transitions. Word has length 173 [2023-11-29 00:30:26,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:30:26,803 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 307 transitions. [2023-11-29 00:30:26,803 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), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:30:26,803 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 307 transitions. [2023-11-29 00:30:26,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2023-11-29 00:30:26,805 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:30:26,805 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:30:26,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 00:30:26,806 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:30:26,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:30:26,806 INFO L85 PathProgramCache]: Analyzing trace with hash -2109518250, now seen corresponding path program 1 times [2023-11-29 00:30:26,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:30:26,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665560494] [2023-11-29 00:30:26,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:30:26,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:30:26,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:27,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:30:27,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:27,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:30:27,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:27,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:30:27,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:27,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:30:27,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:27,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:30:27,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:27,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:30:27,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:27,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 00:30:27,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:27,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 00:30:27,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:27,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 00:30:27,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:27,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 00:30:27,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:27,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 00:30:27,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:27,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 00:30:27,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:27,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 00:30:27,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:27,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 00:30:27,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:27,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 00:30:27,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:27,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 00:30:27,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:27,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:30:27,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:27,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 00:30:27,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:27,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 00:30:27,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:27,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 00:30:27,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:27,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 00:30:27,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:27,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 00:30:27,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:27,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 00:30:27,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:27,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 00:30:27,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:30:27,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665560494] [2023-11-29 00:30:27,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665560494] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:30:27,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:30:27,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 00:30:27,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31285150] [2023-11-29 00:30:27,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:30:27,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 00:30:27,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:30:27,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 00:30:27,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-29 00:30:27,349 INFO L87 Difference]: Start difference. First operand 225 states and 307 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:30:27,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:30:27,704 INFO L93 Difference]: Finished difference Result 478 states and 653 transitions. [2023-11-29 00:30:27,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 00:30:27,705 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 173 [2023-11-29 00:30:27,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:30:27,707 INFO L225 Difference]: With dead ends: 478 [2023-11-29 00:30:27,707 INFO L226 Difference]: Without dead ends: 254 [2023-11-29 00:30:27,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-11-29 00:30:27,709 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 246 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 00:30:27,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 427 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 00:30:27,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2023-11-29 00:30:27,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 225. [2023-11-29 00:30:27,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 200 states have (on average 1.275) internal successors, (255), 200 states have internal predecessors, (255), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-29 00:30:27,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 301 transitions. [2023-11-29 00:30:27,726 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 301 transitions. Word has length 173 [2023-11-29 00:30:27,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:30:27,727 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 301 transitions. [2023-11-29 00:30:27,727 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:30:27,727 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 301 transitions. [2023-11-29 00:30:27,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2023-11-29 00:30:27,729 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:30:27,729 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:30:27,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 00:30:27,730 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:30:27,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:30:27,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1817118025, now seen corresponding path program 1 times [2023-11-29 00:30:27,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:30:27,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980977756] [2023-11-29 00:30:27,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:30:27,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:30:27,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:27,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:30:27,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:27,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:30:27,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:27,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:30:27,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:27,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:30:27,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:27,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:30:27,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:27,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:30:27,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:27,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 00:30:27,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:27,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 00:30:27,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:27,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 00:30:27,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:27,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 00:30:27,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:27,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 00:30:27,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:27,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 00:30:27,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:27,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 00:30:27,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:27,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 00:30:27,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:27,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 00:30:27,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:27,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 00:30:27,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:27,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:30:27,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:27,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 00:30:27,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:27,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 00:30:27,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:27,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 00:30:27,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:27,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 00:30:27,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:27,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 00:30:27,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:27,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 00:30:27,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:27,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 00:30:27,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:30:27,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980977756] [2023-11-29 00:30:27,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980977756] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:30:27,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:30:27,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:30:27,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683353945] [2023-11-29 00:30:27,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:30:27,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:30:27,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:30:27,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:30:27,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:30:27,948 INFO L87 Difference]: Start difference. First operand 225 states and 301 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:30:27,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:30:28,000 INFO L93 Difference]: Finished difference Result 455 states and 609 transitions. [2023-11-29 00:30:28,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:30:28,000 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 173 [2023-11-29 00:30:28,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:30:28,002 INFO L225 Difference]: With dead ends: 455 [2023-11-29 00:30:28,002 INFO L226 Difference]: Without dead ends: 231 [2023-11-29 00:30:28,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 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-29 00:30:28,003 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 24 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:30:28,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 599 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:30:28,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2023-11-29 00:30:28,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 228. [2023-11-29 00:30:28,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 203 states have (on average 1.270935960591133) internal successors, (258), 203 states have internal predecessors, (258), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-29 00:30:28,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 304 transitions. [2023-11-29 00:30:28,017 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 304 transitions. Word has length 173 [2023-11-29 00:30:28,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:30:28,018 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 304 transitions. [2023-11-29 00:30:28,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:30:28,018 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 304 transitions. [2023-11-29 00:30:28,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2023-11-29 00:30:28,019 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:30:28,019 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:30:28,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 00:30:28,020 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:30:28,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:30:28,020 INFO L85 PathProgramCache]: Analyzing trace with hash 799532139, now seen corresponding path program 1 times [2023-11-29 00:30:28,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:30:28,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102676879] [2023-11-29 00:30:28,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:30:28,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:30:28,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:28,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:30:28,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:28,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:30:28,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:28,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:30:28,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:28,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:30:28,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:28,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:30:28,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:28,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:30:28,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:28,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 00:30:28,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:28,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 00:30:28,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:28,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 00:30:28,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:28,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 00:30:28,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:28,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 00:30:28,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:28,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 00:30:28,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:28,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 00:30:28,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:28,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 00:30:28,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:28,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 00:30:28,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:28,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 00:30:28,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:28,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:30:28,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:28,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 00:30:28,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:28,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 00:30:28,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:28,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 00:30:28,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:28,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 00:30:28,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:28,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 00:30:28,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:28,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 00:30:28,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:28,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 00:30:28,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:30:28,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102676879] [2023-11-29 00:30:28,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102676879] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:30:28,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:30:28,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:30:28,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042266215] [2023-11-29 00:30:28,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:30:28,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:30:28,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:30:28,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:30:28,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:30:28,217 INFO L87 Difference]: Start difference. First operand 228 states and 304 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:30:28,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:30:28,465 INFO L93 Difference]: Finished difference Result 621 states and 830 transitions. [2023-11-29 00:30:28,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:30:28,466 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 173 [2023-11-29 00:30:28,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:30:28,469 INFO L225 Difference]: With dead ends: 621 [2023-11-29 00:30:28,469 INFO L226 Difference]: Without dead ends: 394 [2023-11-29 00:30:28,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:30:28,470 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 113 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:30:28,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 385 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 00:30:28,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2023-11-29 00:30:28,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 285. [2023-11-29 00:30:28,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 236 states have (on average 1.2457627118644068) internal successors, (294), 236 states have internal predecessors, (294), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-11-29 00:30:28,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 386 transitions. [2023-11-29 00:30:28,505 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 386 transitions. Word has length 173 [2023-11-29 00:30:28,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:30:28,506 INFO L495 AbstractCegarLoop]: Abstraction has 285 states and 386 transitions. [2023-11-29 00:30:28,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:30:28,506 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 386 transitions. [2023-11-29 00:30:28,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-29 00:30:28,508 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:30:28,508 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:30:28,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 00:30:28,508 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:30:28,508 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:30:28,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1906828626, now seen corresponding path program 1 times [2023-11-29 00:30:28,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:30:28,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253342621] [2023-11-29 00:30:28,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:30:28,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:30:28,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:29,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:30:29,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:29,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:30:29,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:29,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:30:29,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:29,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:30:29,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:29,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:30:29,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:29,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:30:29,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:29,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 00:30:29,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:29,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 00:30:29,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:29,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 00:30:29,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:29,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 00:30:29,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:29,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 00:30:29,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:29,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 00:30:29,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:29,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 00:30:29,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:29,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 00:30:29,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:29,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 00:30:29,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:29,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 00:30:29,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:29,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:30:29,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:29,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 00:30:29,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:29,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 00:30:29,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:29,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 00:30:29,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:29,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 00:30:29,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:29,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 00:30:29,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:29,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 00:30:29,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:29,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 00:30:29,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:30:29,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253342621] [2023-11-29 00:30:29,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253342621] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:30:29,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:30:29,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 00:30:29,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772620333] [2023-11-29 00:30:29,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:30:29,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 00:30:29,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:30:29,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 00:30:29,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-29 00:30:29,259 INFO L87 Difference]: Start difference. First operand 285 states and 386 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:30:29,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:30:29,593 INFO L93 Difference]: Finished difference Result 621 states and 832 transitions. [2023-11-29 00:30:29,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 00:30:29,594 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2023-11-29 00:30:29,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:30:29,596 INFO L225 Difference]: With dead ends: 621 [2023-11-29 00:30:29,596 INFO L226 Difference]: Without dead ends: 394 [2023-11-29 00:30:29,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2023-11-29 00:30:29,598 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 194 mSDsluCounter, 1251 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 1425 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:30:29,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 1425 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 00:30:29,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2023-11-29 00:30:29,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 336. [2023-11-29 00:30:29,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 287 states have (on average 1.2508710801393728) internal successors, (359), 287 states have internal predecessors, (359), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-11-29 00:30:29,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 451 transitions. [2023-11-29 00:30:29,634 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 451 transitions. Word has length 175 [2023-11-29 00:30:29,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:30:29,634 INFO L495 AbstractCegarLoop]: Abstraction has 336 states and 451 transitions. [2023-11-29 00:30:29,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:30:29,635 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 451 transitions. [2023-11-29 00:30:29,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-29 00:30:29,636 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:30:29,636 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:30:29,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 00:30:29,636 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:30:29,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:30:29,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1995111660, now seen corresponding path program 1 times [2023-11-29 00:30:29,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:30:29,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847414202] [2023-11-29 00:30:29,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:30:29,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:30:29,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:29,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:30:29,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:29,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:30:29,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:29,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:30:29,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:29,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:30:29,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:29,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:30:29,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:29,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:30:29,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:29,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 00:30:29,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:29,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 00:30:29,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:29,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 00:30:29,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:29,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 00:30:29,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:29,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 00:30:29,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:29,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 00:30:29,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:29,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 00:30:29,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:29,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 00:30:29,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:29,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 00:30:29,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:29,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 00:30:29,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:29,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:30:29,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:29,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 00:30:29,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:29,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 00:30:29,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:29,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 00:30:29,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:29,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 00:30:29,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:29,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 00:30:29,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:29,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 00:30:29,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:29,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 00:30:29,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:30:29,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847414202] [2023-11-29 00:30:29,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847414202] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:30:29,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:30:29,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:30:29,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434195216] [2023-11-29 00:30:29,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:30:29,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:30:29,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:30:29,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:30:29,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:30:29,794 INFO L87 Difference]: Start difference. First operand 336 states and 451 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:30:29,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:30:29,850 INFO L93 Difference]: Finished difference Result 661 states and 880 transitions. [2023-11-29 00:30:29,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:30:29,851 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2023-11-29 00:30:29,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:30:29,853 INFO L225 Difference]: With dead ends: 661 [2023-11-29 00:30:29,854 INFO L226 Difference]: Without dead ends: 383 [2023-11-29 00:30:29,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:30:29,855 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 63 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:30:29,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 495 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:30:29,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2023-11-29 00:30:29,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 340. [2023-11-29 00:30:29,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 291 states have (on average 1.2474226804123711) internal successors, (363), 291 states have internal predecessors, (363), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-11-29 00:30:29,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 455 transitions. [2023-11-29 00:30:29,887 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 455 transitions. Word has length 175 [2023-11-29 00:30:29,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:30:29,888 INFO L495 AbstractCegarLoop]: Abstraction has 340 states and 455 transitions. [2023-11-29 00:30:29,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:30:29,888 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 455 transitions. [2023-11-29 00:30:29,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-29 00:30:29,889 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:30:29,889 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:30:29,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 00:30:29,889 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:30:29,890 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:30:29,890 INFO L85 PathProgramCache]: Analyzing trace with hash -2041690198, now seen corresponding path program 1 times [2023-11-29 00:30:29,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:30:29,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758120300] [2023-11-29 00:30:29,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:30:29,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:30:29,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:30,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:30:30,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:30,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:30:30,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:30,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:30:30,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:30,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:30:30,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:30,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:30:30,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:30,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:30:30,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:30,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 00:30:30,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:30,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 00:30:30,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:30,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 00:30:30,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:30,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 00:30:30,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:30,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 00:30:30,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:30,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 00:30:30,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:30,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 00:30:30,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:30,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 00:30:30,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:30,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 00:30:30,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:30,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 00:30:30,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:30,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:30:30,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:30,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 00:30:30,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:30,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 00:30:30,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:30,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 00:30:30,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:30,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 00:30:30,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:30,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 00:30:30,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:30,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 00:30:30,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:30,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 00:30:30,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:30:30,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758120300] [2023-11-29 00:30:30,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758120300] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:30:30,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:30:30,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 00:30:30,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647406927] [2023-11-29 00:30:30,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:30:30,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:30:30,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:30:30,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:30:30,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:30:30,273 INFO L87 Difference]: Start difference. First operand 340 states and 455 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:30:30,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:30:30,476 INFO L93 Difference]: Finished difference Result 718 states and 950 transitions. [2023-11-29 00:30:30,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 00:30:30,476 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2023-11-29 00:30:30,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:30:30,479 INFO L225 Difference]: With dead ends: 718 [2023-11-29 00:30:30,480 INFO L226 Difference]: Without dead ends: 436 [2023-11-29 00:30:30,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:30:30,481 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 167 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:30:30,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 570 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:30:30,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2023-11-29 00:30:30,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 344. [2023-11-29 00:30:30,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 295 states have (on average 1.2508474576271187) internal successors, (369), 295 states have internal predecessors, (369), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-11-29 00:30:30,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 461 transitions. [2023-11-29 00:30:30,516 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 461 transitions. Word has length 175 [2023-11-29 00:30:30,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:30:30,516 INFO L495 AbstractCegarLoop]: Abstraction has 344 states and 461 transitions. [2023-11-29 00:30:30,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:30:30,517 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 461 transitions. [2023-11-29 00:30:30,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-29 00:30:30,518 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:30:30,518 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:30:30,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 00:30:30,519 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:30:30,519 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:30:30,519 INFO L85 PathProgramCache]: Analyzing trace with hash -2040842132, now seen corresponding path program 1 times [2023-11-29 00:30:30,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:30:30,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012380213] [2023-11-29 00:30:30,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:30:30,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:30:30,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:30,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:30:30,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:30,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:30:30,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:30,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:30:30,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:30,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:30:30,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:30,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:30:30,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:30,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:30:30,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:30,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 00:30:30,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:30,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 00:30:30,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:30,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 00:30:30,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:30,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 00:30:30,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:30,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 00:30:30,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:30,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 00:30:30,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:30,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 00:30:30,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:30,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 00:30:30,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:30,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 00:30:30,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:30,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 00:30:30,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:30,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:30:30,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:30,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 00:30:30,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:30,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 00:30:30,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:30,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 00:30:30,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:30,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 00:30:30,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:30,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 00:30:30,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:30,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 00:30:30,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:30,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 00:30:30,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:30:30,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012380213] [2023-11-29 00:30:30,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012380213] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:30:30,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:30:30,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:30:30,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451320147] [2023-11-29 00:30:30,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:30:30,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:30:30,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:30:30,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:30:30,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:30:30,673 INFO L87 Difference]: Start difference. First operand 344 states and 461 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:30:30,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:30:30,726 INFO L93 Difference]: Finished difference Result 642 states and 855 transitions. [2023-11-29 00:30:30,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:30:30,726 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2023-11-29 00:30:30,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:30:30,729 INFO L225 Difference]: With dead ends: 642 [2023-11-29 00:30:30,729 INFO L226 Difference]: Without dead ends: 356 [2023-11-29 00:30:30,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:30:30,731 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 3 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:30:30,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 457 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:30:30,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2023-11-29 00:30:30,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 352. [2023-11-29 00:30:30,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 303 states have (on average 1.2442244224422443) internal successors, (377), 303 states have internal predecessors, (377), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-11-29 00:30:30,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 469 transitions. [2023-11-29 00:30:30,758 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 469 transitions. Word has length 175 [2023-11-29 00:30:30,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:30:30,759 INFO L495 AbstractCegarLoop]: Abstraction has 352 states and 469 transitions. [2023-11-29 00:30:30,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:30:30,759 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 469 transitions. [2023-11-29 00:30:30,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-29 00:30:30,761 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:30:30,761 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:30:30,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-29 00:30:30,761 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:30:30,762 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:30:30,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1978802518, now seen corresponding path program 1 times [2023-11-29 00:30:30,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:30:30,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340544649] [2023-11-29 00:30:30,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:30:30,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:30:30,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:31,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:30:31,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:31,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:30:31,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:31,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:30:31,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:31,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:30:31,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:31,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:30:31,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:31,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:30:31,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:31,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 00:30:31,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:31,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 00:30:31,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:31,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 00:30:31,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:31,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 00:30:31,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:31,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 00:30:31,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:31,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 00:30:31,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:31,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 00:30:31,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:31,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 00:30:31,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:31,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 00:30:31,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:31,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 00:30:31,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:31,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:30:31,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:31,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 00:30:31,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:31,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 00:30:31,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:31,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 00:30:31,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:31,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 00:30:31,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:31,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 00:30:31,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:31,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 00:30:31,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:31,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 00:30:31,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:30:31,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340544649] [2023-11-29 00:30:31,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340544649] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:30:31,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:30:31,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 00:30:31,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025846638] [2023-11-29 00:30:31,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:30:31,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:30:31,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:30:31,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:30:31,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:30:31,136 INFO L87 Difference]: Start difference. First operand 352 states and 469 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:30:31,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:30:31,308 INFO L93 Difference]: Finished difference Result 654 states and 865 transitions. [2023-11-29 00:30:31,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 00:30:31,311 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2023-11-29 00:30:31,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:30:31,313 INFO L225 Difference]: With dead ends: 654 [2023-11-29 00:30:31,313 INFO L226 Difference]: Without dead ends: 360 [2023-11-29 00:30:31,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:30:31,315 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 110 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:30:31,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 614 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:30:31,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2023-11-29 00:30:31,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 325. [2023-11-29 00:30:31,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 276 states have (on average 1.2391304347826086) internal successors, (342), 276 states have internal predecessors, (342), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-11-29 00:30:31,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 434 transitions. [2023-11-29 00:30:31,338 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 434 transitions. Word has length 175 [2023-11-29 00:30:31,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:30:31,338 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 434 transitions. [2023-11-29 00:30:31,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:30:31,339 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 434 transitions. [2023-11-29 00:30:31,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-29 00:30:31,340 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:30:31,340 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:30:31,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-29 00:30:31,341 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:30:31,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:30:31,341 INFO L85 PathProgramCache]: Analyzing trace with hash 732686758, now seen corresponding path program 1 times [2023-11-29 00:30:31,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:30:31,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592142461] [2023-11-29 00:30:31,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:30:31,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:30:31,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:31,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:30:31,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:31,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:30:31,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:31,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:30:31,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:31,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:30:31,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:31,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:30:31,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:31,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:30:31,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:31,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 00:30:31,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:31,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 00:30:31,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:31,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 00:30:31,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:31,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 00:30:31,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:31,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 00:30:31,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:31,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 00:30:31,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:31,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 00:30:31,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:31,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 00:30:31,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:31,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 00:30:31,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:31,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 00:30:31,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:31,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:30:31,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:31,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 00:30:31,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:31,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 00:30:31,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:31,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 00:30:31,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:31,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 00:30:31,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:31,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 00:30:31,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:31,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 00:30:31,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:31,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 00:30:31,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:30:31,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592142461] [2023-11-29 00:30:31,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592142461] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:30:31,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:30:31,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 00:30:31,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069723555] [2023-11-29 00:30:31,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:30:31,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 00:30:31,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:30:31,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 00:30:31,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:30:31,813 INFO L87 Difference]: Start difference. First operand 325 states and 434 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:30:32,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:30:32,245 INFO L93 Difference]: Finished difference Result 715 states and 941 transitions. [2023-11-29 00:30:32,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 00:30:32,246 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2023-11-29 00:30:32,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:30:32,249 INFO L225 Difference]: With dead ends: 715 [2023-11-29 00:30:32,249 INFO L226 Difference]: Without dead ends: 448 [2023-11-29 00:30:32,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-11-29 00:30:32,251 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 213 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 00:30:32,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 551 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 00:30:32,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2023-11-29 00:30:32,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 377. [2023-11-29 00:30:32,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 328 states have (on average 1.2378048780487805) internal successors, (406), 328 states have internal predecessors, (406), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-11-29 00:30:32,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 498 transitions. [2023-11-29 00:30:32,282 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 498 transitions. Word has length 175 [2023-11-29 00:30:32,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:30:32,283 INFO L495 AbstractCegarLoop]: Abstraction has 377 states and 498 transitions. [2023-11-29 00:30:32,283 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:30:32,283 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 498 transitions. [2023-11-29 00:30:32,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-29 00:30:32,285 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:30:32,285 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:30:32,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-29 00:30:32,285 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:30:32,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:30:32,286 INFO L85 PathProgramCache]: Analyzing trace with hash 794726372, now seen corresponding path program 1 times [2023-11-29 00:30:32,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:30:32,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348711917] [2023-11-29 00:30:32,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:30:32,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:30:32,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:32,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:30:32,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:32,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:30:32,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:32,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:30:32,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:32,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:30:32,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:32,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:30:32,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:32,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:30:32,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:32,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 00:30:32,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:32,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 00:30:32,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:32,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 00:30:32,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:32,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 00:30:32,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:32,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 00:30:32,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:32,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 00:30:32,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:32,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 00:30:32,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:32,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 00:30:32,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:32,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 00:30:32,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:32,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 00:30:32,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:32,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:30:32,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:32,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 00:30:32,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:32,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 00:30:32,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:32,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 00:30:32,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:32,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 00:30:32,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:32,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 00:30:32,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:32,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 00:30:32,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:32,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 00:30:32,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:30:32,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348711917] [2023-11-29 00:30:32,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348711917] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:30:32,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:30:32,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 00:30:32,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295581362] [2023-11-29 00:30:32,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:30:32,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:30:32,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:30:32,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:30:32,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:30:32,533 INFO L87 Difference]: Start difference. First operand 377 states and 498 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:30:32,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:30:32,682 INFO L93 Difference]: Finished difference Result 669 states and 878 transitions. [2023-11-29 00:30:32,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:30:32,682 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2023-11-29 00:30:32,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:30:32,685 INFO L225 Difference]: With dead ends: 669 [2023-11-29 00:30:32,685 INFO L226 Difference]: Without dead ends: 350 [2023-11-29 00:30:32,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 00:30:32,686 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 19 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:30:32,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 547 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:30:32,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2023-11-29 00:30:32,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 350. [2023-11-29 00:30:32,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 301 states have (on average 1.2259136212624584) internal successors, (369), 301 states have internal predecessors, (369), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-11-29 00:30:32,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 461 transitions. [2023-11-29 00:30:32,720 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 461 transitions. Word has length 175 [2023-11-29 00:30:32,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:30:32,720 INFO L495 AbstractCegarLoop]: Abstraction has 350 states and 461 transitions. [2023-11-29 00:30:32,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:30:32,721 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 461 transitions. [2023-11-29 00:30:32,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-29 00:30:32,722 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:30:32,722 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:30:32,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-29 00:30:32,723 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:30:32,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:30:32,723 INFO L85 PathProgramCache]: Analyzing trace with hash 795574438, now seen corresponding path program 1 times [2023-11-29 00:30:32,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:30:32,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305756779] [2023-11-29 00:30:32,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:30:32,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:30:32,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:33,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:30:33,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:33,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:30:33,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:33,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:30:33,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:33,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:30:33,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:33,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:30:33,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:33,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:30:33,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:33,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 00:30:33,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:33,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 00:30:33,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:33,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 00:30:33,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:33,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 00:30:33,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:33,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 00:30:33,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:33,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 00:30:33,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:33,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 00:30:33,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:33,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 00:30:33,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:33,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 00:30:33,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:33,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 00:30:33,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:33,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:30:33,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:33,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 00:30:33,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:33,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 00:30:33,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:33,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 00:30:33,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:33,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 00:30:33,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:33,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 00:30:33,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:33,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 00:30:33,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:33,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 00:30:33,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:30:33,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305756779] [2023-11-29 00:30:33,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305756779] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:30:33,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:30:33,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 00:30:33,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968554055] [2023-11-29 00:30:33,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:30:33,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 00:30:33,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:30:33,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 00:30:33,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-29 00:30:33,307 INFO L87 Difference]: Start difference. First operand 350 states and 461 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2023-11-29 00:30:33,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:30:33,721 INFO L93 Difference]: Finished difference Result 677 states and 884 transitions. [2023-11-29 00:30:33,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:30:33,722 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 175 [2023-11-29 00:30:33,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:30:33,725 INFO L225 Difference]: With dead ends: 677 [2023-11-29 00:30:33,725 INFO L226 Difference]: Without dead ends: 385 [2023-11-29 00:30:33,726 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2023-11-29 00:30:33,726 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 265 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 00:30:33,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 397 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 00:30:33,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2023-11-29 00:30:33,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 352. [2023-11-29 00:30:33,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 303 states have (on average 1.221122112211221) internal successors, (370), 303 states have internal predecessors, (370), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-11-29 00:30:33,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 462 transitions. [2023-11-29 00:30:33,762 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 462 transitions. Word has length 175 [2023-11-29 00:30:33,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:30:33,763 INFO L495 AbstractCegarLoop]: Abstraction has 352 states and 462 transitions. [2023-11-29 00:30:33,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2023-11-29 00:30:33,763 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 462 transitions. [2023-11-29 00:30:33,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-29 00:30:33,764 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:30:33,765 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:30:33,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-29 00:30:33,765 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:30:33,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:30:33,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1053739876, now seen corresponding path program 1 times [2023-11-29 00:30:33,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:30:33,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985407022] [2023-11-29 00:30:33,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:30:33,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:30:33,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:34,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:30:34,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:34,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:30:34,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:34,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:30:34,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:34,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:30:34,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:34,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:30:34,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:34,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:30:34,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:34,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 00:30:34,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:34,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 00:30:34,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:34,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 00:30:34,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:34,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 00:30:34,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:34,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 00:30:34,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:34,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 00:30:34,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:34,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 00:30:34,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:34,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 00:30:34,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:34,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 00:30:34,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:34,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 00:30:34,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:34,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:30:34,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:34,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 00:30:34,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:34,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 00:30:34,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:34,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 00:30:34,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:34,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 00:30:34,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:34,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 00:30:34,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:34,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 00:30:34,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:34,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 00:30:34,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:30:34,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985407022] [2023-11-29 00:30:34,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985407022] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:30:34,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:30:34,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 00:30:34,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774764900] [2023-11-29 00:30:34,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:30:34,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:30:34,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:30:34,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:30:34,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:30:34,112 INFO L87 Difference]: Start difference. First operand 352 states and 462 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:30:34,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:30:34,300 INFO L93 Difference]: Finished difference Result 713 states and 926 transitions. [2023-11-29 00:30:34,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:30:34,301 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2023-11-29 00:30:34,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:30:34,303 INFO L225 Difference]: With dead ends: 713 [2023-11-29 00:30:34,303 INFO L226 Difference]: Without dead ends: 419 [2023-11-29 00:30:34,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 00:30:34,304 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 114 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:30:34,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 563 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:30:34,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2023-11-29 00:30:34,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 352. [2023-11-29 00:30:34,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 303 states have (on average 1.2178217821782178) internal successors, (369), 303 states have internal predecessors, (369), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-11-29 00:30:34,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 461 transitions. [2023-11-29 00:30:34,329 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 461 transitions. Word has length 175 [2023-11-29 00:30:34,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:30:34,330 INFO L495 AbstractCegarLoop]: Abstraction has 352 states and 461 transitions. [2023-11-29 00:30:34,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:30:34,330 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 461 transitions. [2023-11-29 00:30:34,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-29 00:30:34,331 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:30:34,331 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:30:34,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-29 00:30:34,331 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:30:34,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:30:34,331 INFO L85 PathProgramCache]: Analyzing trace with hash 660712866, now seen corresponding path program 1 times [2023-11-29 00:30:34,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:30:34,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334272683] [2023-11-29 00:30:34,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:30:34,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:30:34,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:36,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:30:36,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:36,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:30:36,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:36,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:30:36,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:36,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:30:36,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:36,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:30:36,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:36,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:30:36,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:36,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 00:30:36,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:36,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 00:30:36,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:36,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 00:30:36,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:36,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 00:30:36,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:36,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 00:30:36,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:36,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 00:30:36,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:36,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 00:30:36,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:36,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 00:30:36,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:36,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 00:30:36,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:36,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 00:30:36,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:36,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:30:36,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:36,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 00:30:36,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:36,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 00:30:36,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:36,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 00:30:36,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:36,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 00:30:36,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:36,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 00:30:36,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:36,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 00:30:36,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:36,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 00:30:36,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:30:36,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334272683] [2023-11-29 00:30:36,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334272683] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:30:36,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:30:36,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-29 00:30:36,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235177665] [2023-11-29 00:30:36,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:30:36,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 00:30:36,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:30:36,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 00:30:36,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2023-11-29 00:30:36,667 INFO L87 Difference]: Start difference. First operand 352 states and 461 transitions. Second operand has 15 states, 13 states have (on average 4.846153846153846) internal successors, (63), 15 states have internal predecessors, (63), 5 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 5 states have call successors, (23) [2023-11-29 00:30:38,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:30:38,305 INFO L93 Difference]: Finished difference Result 689 states and 896 transitions. [2023-11-29 00:30:38,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 00:30:38,306 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.846153846153846) internal successors, (63), 15 states have internal predecessors, (63), 5 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 5 states have call successors, (23) Word has length 175 [2023-11-29 00:30:38,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:30:38,308 INFO L225 Difference]: With dead ends: 689 [2023-11-29 00:30:38,309 INFO L226 Difference]: Without dead ends: 395 [2023-11-29 00:30:38,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=152, Invalid=448, Unknown=0, NotChecked=0, Total=600 [2023-11-29 00:30:38,310 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 356 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 966 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 1044 SdHoareTripleChecker+Invalid, 994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 00:30:38,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 1044 Invalid, 994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 966 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 00:30:38,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2023-11-29 00:30:38,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 354. [2023-11-29 00:30:38,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 305 states have (on average 1.2163934426229508) internal successors, (371), 305 states have internal predecessors, (371), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-11-29 00:30:38,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 463 transitions. [2023-11-29 00:30:38,356 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 463 transitions. Word has length 175 [2023-11-29 00:30:38,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:30:38,356 INFO L495 AbstractCegarLoop]: Abstraction has 354 states and 463 transitions. [2023-11-29 00:30:38,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.846153846153846) internal successors, (63), 15 states have internal predecessors, (63), 5 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 5 states have call successors, (23) [2023-11-29 00:30:38,357 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 463 transitions. [2023-11-29 00:30:38,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-29 00:30:38,358 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:30:38,358 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:30:38,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-29 00:30:38,358 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:30:38,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:30:38,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1472294428, now seen corresponding path program 1 times [2023-11-29 00:30:38,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:30:38,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266854465] [2023-11-29 00:30:38,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:30:38,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:30:38,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:38,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:30:38,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:38,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:30:38,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:38,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:30:38,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:38,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:30:38,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:38,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:30:38,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:38,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:30:38,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:38,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 00:30:38,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:38,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 00:30:38,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:38,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 00:30:38,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:38,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 00:30:38,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:38,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 00:30:38,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:38,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 00:30:38,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:38,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 00:30:38,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:38,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 00:30:38,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:38,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 00:30:38,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:39,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 00:30:39,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:39,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:30:39,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:39,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 00:30:39,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:39,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 00:30:39,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:39,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 00:30:39,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:39,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 00:30:39,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:39,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 00:30:39,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:39,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 00:30:39,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:39,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 00:30:39,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:30:39,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266854465] [2023-11-29 00:30:39,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266854465] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:30:39,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:30:39,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 00:30:39,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418192107] [2023-11-29 00:30:39,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:30:39,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 00:30:39,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:30:39,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 00:30:39,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 00:30:39,034 INFO L87 Difference]: Start difference. First operand 354 states and 463 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:30:39,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:30:39,423 INFO L93 Difference]: Finished difference Result 571 states and 731 transitions. [2023-11-29 00:30:39,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 00:30:39,423 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2023-11-29 00:30:39,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:30:39,427 INFO L225 Difference]: With dead ends: 571 [2023-11-29 00:30:39,427 INFO L226 Difference]: Without dead ends: 569 [2023-11-29 00:30:39,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2023-11-29 00:30:39,428 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 285 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 00:30:39,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 563 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 00:30:39,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2023-11-29 00:30:39,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 558. [2023-11-29 00:30:39,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 509 states have (on average 1.223968565815324) internal successors, (623), 509 states have internal predecessors, (623), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-11-29 00:30:39,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 715 transitions. [2023-11-29 00:30:39,480 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 715 transitions. Word has length 175 [2023-11-29 00:30:39,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:30:39,481 INFO L495 AbstractCegarLoop]: Abstraction has 558 states and 715 transitions. [2023-11-29 00:30:39,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:30:39,481 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 715 transitions. [2023-11-29 00:30:39,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-29 00:30:39,482 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:30:39,483 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:30:39,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-11-29 00:30:39,483 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:30:39,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:30:39,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1494926682, now seen corresponding path program 1 times [2023-11-29 00:30:39,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:30:39,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608644224] [2023-11-29 00:30:39,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:30:39,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:30:39,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:40,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:30:40,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:40,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:30:40,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:40,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:30:40,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:40,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:30:40,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:40,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:30:40,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:40,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:30:40,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:40,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 00:30:40,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:40,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 00:30:40,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:40,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 00:30:40,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:40,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 00:30:40,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:40,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 00:30:40,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:40,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 00:30:40,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:40,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 00:30:40,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:40,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 00:30:40,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:40,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 00:30:40,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:40,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 00:30:40,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:40,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:30:40,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:40,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 00:30:40,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:40,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 00:30:40,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:40,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 00:30:40,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:40,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 00:30:40,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:40,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 00:30:40,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:40,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 00:30:40,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:40,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 00:30:40,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:30:40,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608644224] [2023-11-29 00:30:40,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608644224] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:30:40,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:30:40,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:30:40,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766489440] [2023-11-29 00:30:40,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:30:40,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:30:40,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:30:40,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:30:40,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:30:40,310 INFO L87 Difference]: Start difference. First operand 558 states and 715 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2023-11-29 00:30:40,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:30:40,491 INFO L93 Difference]: Finished difference Result 1078 states and 1372 transitions. [2023-11-29 00:30:40,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:30:40,491 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 175 [2023-11-29 00:30:40,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:30:40,495 INFO L225 Difference]: With dead ends: 1078 [2023-11-29 00:30:40,495 INFO L226 Difference]: Without dead ends: 578 [2023-11-29 00:30:40,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 58 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-29 00:30:40,496 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 63 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:30:40,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 366 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:30:40,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2023-11-29 00:30:40,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 563. [2023-11-29 00:30:40,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 514 states have (on average 1.2256809338521402) internal successors, (630), 514 states have internal predecessors, (630), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-11-29 00:30:40,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 722 transitions. [2023-11-29 00:30:40,545 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 722 transitions. Word has length 175 [2023-11-29 00:30:40,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:30:40,545 INFO L495 AbstractCegarLoop]: Abstraction has 563 states and 722 transitions. [2023-11-29 00:30:40,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2023-11-29 00:30:40,545 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 722 transitions. [2023-11-29 00:30:40,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2023-11-29 00:30:40,546 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:30:40,547 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:30:40,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-11-29 00:30:40,547 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:30:40,547 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:30:40,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1311023621, now seen corresponding path program 1 times [2023-11-29 00:30:40,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:30:40,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997286332] [2023-11-29 00:30:40,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:30:40,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:30:40,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:41,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:30:41,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:41,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:30:41,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:41,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:30:41,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:41,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:30:41,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:41,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:30:41,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:41,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:30:41,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:41,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 00:30:41,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:41,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 00:30:41,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:41,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 00:30:41,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:41,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 00:30:41,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:41,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 00:30:41,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:41,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 00:30:41,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:41,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 00:30:41,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:41,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 00:30:41,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:41,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 00:30:41,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:41,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 00:30:41,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:41,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:30:41,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:41,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 00:30:41,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:41,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 00:30:41,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:41,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 00:30:41,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:41,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 00:30:41,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:41,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 00:30:41,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:41,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 00:30:41,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:41,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 00:30:41,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:30:41,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997286332] [2023-11-29 00:30:41,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997286332] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:30:41,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:30:41,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-29 00:30:41,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027352949] [2023-11-29 00:30:41,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:30:41,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 00:30:41,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:30:41,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 00:30:41,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2023-11-29 00:30:41,260 INFO L87 Difference]: Start difference. First operand 563 states and 722 transitions. Second operand has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:30:41,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:30:41,856 INFO L93 Difference]: Finished difference Result 1184 states and 1511 transitions. [2023-11-29 00:30:41,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 00:30:41,860 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 176 [2023-11-29 00:30:41,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:30:41,864 INFO L225 Difference]: With dead ends: 1184 [2023-11-29 00:30:41,864 INFO L226 Difference]: Without dead ends: 684 [2023-11-29 00:30:41,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=337, Unknown=0, NotChecked=0, Total=462 [2023-11-29 00:30:41,866 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 406 mSDsluCounter, 829 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 00:30:41,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 1002 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 00:30:41,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2023-11-29 00:30:41,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 582. [2023-11-29 00:30:41,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 533 states have (on average 1.2307692307692308) internal successors, (656), 533 states have internal predecessors, (656), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-11-29 00:30:41,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 748 transitions. [2023-11-29 00:30:41,910 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 748 transitions. Word has length 176 [2023-11-29 00:30:41,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:30:41,910 INFO L495 AbstractCegarLoop]: Abstraction has 582 states and 748 transitions. [2023-11-29 00:30:41,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:30:41,910 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 748 transitions. [2023-11-29 00:30:41,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2023-11-29 00:30:41,912 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:30:41,912 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:30:41,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-11-29 00:30:41,912 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:30:41,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:30:41,913 INFO L85 PathProgramCache]: Analyzing trace with hash 165044799, now seen corresponding path program 1 times [2023-11-29 00:30:41,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:30:41,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645656420] [2023-11-29 00:30:41,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:30:41,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:30:41,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:42,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:30:42,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:42,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:30:42,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:42,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:30:42,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:42,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:30:42,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:42,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:30:42,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:42,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:30:42,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:42,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 00:30:42,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:42,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 00:30:42,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:42,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 00:30:42,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:42,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 00:30:42,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:42,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 00:30:42,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:42,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 00:30:42,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:42,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 00:30:42,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:42,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 00:30:42,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:42,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 00:30:42,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:42,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 00:30:42,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:42,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:30:42,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:42,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 00:30:42,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:42,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 00:30:42,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:42,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 00:30:42,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:42,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 00:30:42,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:42,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 00:30:42,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:42,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 00:30:42,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:42,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 00:30:42,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:30:42,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645656420] [2023-11-29 00:30:42,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645656420] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:30:42,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:30:42,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 00:30:42,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44887892] [2023-11-29 00:30:42,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:30:42,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 00:30:42,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:30:42,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 00:30:42,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-29 00:30:42,562 INFO L87 Difference]: Start difference. First operand 582 states and 748 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2023-11-29 00:30:42,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:30:42,982 INFO L93 Difference]: Finished difference Result 1226 states and 1566 transitions. [2023-11-29 00:30:42,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 00:30:42,983 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 176 [2023-11-29 00:30:42,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:30:42,986 INFO L225 Difference]: With dead ends: 1226 [2023-11-29 00:30:42,986 INFO L226 Difference]: Without dead ends: 707 [2023-11-29 00:30:42,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2023-11-29 00:30:42,987 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 287 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 00:30:42,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 429 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 00:30:42,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2023-11-29 00:30:43,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 597. [2023-11-29 00:30:43,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 548 states have (on average 1.2335766423357664) internal successors, (676), 548 states have internal predecessors, (676), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-11-29 00:30:43,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 768 transitions. [2023-11-29 00:30:43,024 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 768 transitions. Word has length 176 [2023-11-29 00:30:43,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:30:43,024 INFO L495 AbstractCegarLoop]: Abstraction has 597 states and 768 transitions. [2023-11-29 00:30:43,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2023-11-29 00:30:43,025 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 768 transitions. [2023-11-29 00:30:43,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2023-11-29 00:30:43,026 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:30:43,026 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:30:43,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-11-29 00:30:43,026 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:30:43,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:30:43,027 INFO L85 PathProgramCache]: Analyzing trace with hash 2088272833, now seen corresponding path program 1 times [2023-11-29 00:30:43,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:30:43,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913455585] [2023-11-29 00:30:43,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:30:43,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:30:43,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:43,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:30:43,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:43,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:30:43,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:43,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:30:43,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:43,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:30:43,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:43,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:30:43,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:43,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:30:43,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:43,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 00:30:43,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:43,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 00:30:43,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:43,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 00:30:43,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:43,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 00:30:43,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:43,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 00:30:43,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:43,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 00:30:43,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:43,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 00:30:43,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:43,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 00:30:43,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:43,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 00:30:43,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:43,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 00:30:43,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:43,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:30:43,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:43,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 00:30:43,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:43,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 00:30:43,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:43,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 00:30:43,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:43,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 00:30:43,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:43,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 00:30:43,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:43,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 00:30:43,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:43,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 00:30:43,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:30:43,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913455585] [2023-11-29 00:30:43,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913455585] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:30:43,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:30:43,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 00:30:43,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278708134] [2023-11-29 00:30:43,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:30:43,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 00:30:43,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:30:43,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 00:30:43,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:30:43,674 INFO L87 Difference]: Start difference. First operand 597 states and 768 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:30:44,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:30:44,173 INFO L93 Difference]: Finished difference Result 1263 states and 1615 transitions. [2023-11-29 00:30:44,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 00:30:44,174 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 176 [2023-11-29 00:30:44,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:30:44,178 INFO L225 Difference]: With dead ends: 1263 [2023-11-29 00:30:44,178 INFO L226 Difference]: Without dead ends: 729 [2023-11-29 00:30:44,179 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:30:44,180 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 214 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 00:30:44,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 532 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 00:30:44,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2023-11-29 00:30:44,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 597. [2023-11-29 00:30:44,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 548 states have (on average 1.2335766423357664) internal successors, (676), 548 states have internal predecessors, (676), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-11-29 00:30:44,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 768 transitions. [2023-11-29 00:30:44,240 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 768 transitions. Word has length 176 [2023-11-29 00:30:44,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:30:44,240 INFO L495 AbstractCegarLoop]: Abstraction has 597 states and 768 transitions. [2023-11-29 00:30:44,241 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:30:44,241 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 768 transitions. [2023-11-29 00:30:44,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2023-11-29 00:30:44,242 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:30:44,242 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:30:44,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-11-29 00:30:44,243 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:30:44,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:30:44,243 INFO L85 PathProgramCache]: Analyzing trace with hash 466036363, now seen corresponding path program 1 times [2023-11-29 00:30:44,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:30:44,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202756821] [2023-11-29 00:30:44,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:30:44,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:30:44,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:44,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:30:44,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:44,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:30:44,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:44,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:30:44,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:44,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:30:44,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:44,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:30:44,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:44,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:30:44,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:44,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 00:30:44,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:44,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 00:30:44,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:44,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 00:30:44,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:44,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 00:30:44,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:44,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 00:30:44,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:44,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 00:30:44,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:44,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 00:30:44,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:44,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 00:30:44,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:44,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 00:30:44,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:44,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 00:30:44,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:44,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:30:44,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:44,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 00:30:44,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:44,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 00:30:44,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:44,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 00:30:44,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:44,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 00:30:44,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:44,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 00:30:44,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:44,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 00:30:44,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:44,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 00:30:44,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:30:44,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202756821] [2023-11-29 00:30:44,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202756821] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:30:44,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:30:44,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 00:30:44,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174357178] [2023-11-29 00:30:44,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:30:44,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 00:30:44,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:30:44,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 00:30:44,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:30:44,949 INFO L87 Difference]: Start difference. First operand 597 states and 768 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:30:45,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:30:45,279 INFO L93 Difference]: Finished difference Result 1181 states and 1508 transitions. [2023-11-29 00:30:45,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:30:45,280 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 176 [2023-11-29 00:30:45,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:30:45,283 INFO L225 Difference]: With dead ends: 1181 [2023-11-29 00:30:45,283 INFO L226 Difference]: Without dead ends: 647 [2023-11-29 00:30:45,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 00:30:45,285 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 191 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 00:30:45,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 450 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 00:30:45,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2023-11-29 00:30:45,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 582. [2023-11-29 00:30:45,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 533 states have (on average 1.2307692307692308) internal successors, (656), 533 states have internal predecessors, (656), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-11-29 00:30:45,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 748 transitions. [2023-11-29 00:30:45,322 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 748 transitions. Word has length 176 [2023-11-29 00:30:45,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:30:45,322 INFO L495 AbstractCegarLoop]: Abstraction has 582 states and 748 transitions. [2023-11-29 00:30:45,322 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:30:45,322 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 748 transitions. [2023-11-29 00:30:45,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2023-11-29 00:30:45,323 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:30:45,323 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:30:45,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-11-29 00:30:45,324 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:30:45,324 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:30:45,324 INFO L85 PathProgramCache]: Analyzing trace with hash 724201801, now seen corresponding path program 1 times [2023-11-29 00:30:45,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:30:45,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381665325] [2023-11-29 00:30:45,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:30:45,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:30:45,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:45,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:30:45,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:45,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:30:45,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:45,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:30:45,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:45,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:30:45,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:45,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:30:45,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:45,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:30:45,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:45,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 00:30:45,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:45,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 00:30:45,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:45,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 00:30:45,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:45,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 00:30:45,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:45,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 00:30:45,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:45,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 00:30:45,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:45,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 00:30:45,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:45,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 00:30:45,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:45,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 00:30:45,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:45,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 00:30:45,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:45,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:30:45,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:45,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 00:30:45,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:45,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 00:30:45,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:45,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 00:30:45,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:45,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 00:30:45,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:45,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 00:30:45,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:45,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 00:30:45,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:45,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 00:30:45,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:30:45,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381665325] [2023-11-29 00:30:45,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381665325] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:30:45,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:30:45,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 00:30:45,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844786173] [2023-11-29 00:30:45,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:30:45,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 00:30:45,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:30:45,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 00:30:45,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:30:45,952 INFO L87 Difference]: Start difference. First operand 582 states and 748 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:30:46,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:30:46,389 INFO L93 Difference]: Finished difference Result 1185 states and 1512 transitions. [2023-11-29 00:30:46,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:30:46,389 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 176 [2023-11-29 00:30:46,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:30:46,392 INFO L225 Difference]: With dead ends: 1185 [2023-11-29 00:30:46,393 INFO L226 Difference]: Without dead ends: 666 [2023-11-29 00:30:46,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:30:46,394 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 189 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 00:30:46,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 438 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 00:30:46,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2023-11-29 00:30:46,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 565. [2023-11-29 00:30:46,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 516 states have (on average 1.2306201550387597) internal successors, (635), 516 states have internal predecessors, (635), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-11-29 00:30:46,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 727 transitions. [2023-11-29 00:30:46,431 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 727 transitions. Word has length 176 [2023-11-29 00:30:46,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:30:46,431 INFO L495 AbstractCegarLoop]: Abstraction has 565 states and 727 transitions. [2023-11-29 00:30:46,432 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:30:46,432 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 727 transitions. [2023-11-29 00:30:46,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2023-11-29 00:30:46,433 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:30:46,433 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:30:46,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-11-29 00:30:46,434 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:30:46,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:30:46,434 INFO L85 PathProgramCache]: Analyzing trace with hash -679942459, now seen corresponding path program 1 times [2023-11-29 00:30:46,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:30:46,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883542548] [2023-11-29 00:30:46,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:30:46,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:30:46,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:47,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:30:47,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:47,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:30:47,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:47,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:30:47,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:47,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:30:47,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:47,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:30:47,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:47,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:30:47,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:47,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 00:30:47,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:47,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 00:30:47,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:47,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 00:30:47,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:47,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 00:30:47,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:47,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 00:30:47,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:47,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 00:30:47,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:47,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 00:30:47,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:47,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 00:30:47,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:47,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 00:30:47,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:47,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 00:30:47,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:47,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:30:47,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:47,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 00:30:47,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:47,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 00:30:47,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:47,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 00:30:47,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:47,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 00:30:47,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:47,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 00:30:47,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:47,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 00:30:47,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:48,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 00:30:48,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:30:48,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883542548] [2023-11-29 00:30:48,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883542548] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:30:48,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:30:48,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 00:30:48,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081973289] [2023-11-29 00:30:48,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:30:48,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 00:30:48,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:30:48,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 00:30:48,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-11-29 00:30:48,003 INFO L87 Difference]: Start difference. First operand 565 states and 727 transitions. Second operand has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:30:49,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:30:49,305 INFO L93 Difference]: Finished difference Result 1143 states and 1463 transitions. [2023-11-29 00:30:49,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 00:30:49,306 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 176 [2023-11-29 00:30:49,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:30:49,309 INFO L225 Difference]: With dead ends: 1143 [2023-11-29 00:30:49,309 INFO L226 Difference]: Without dead ends: 641 [2023-11-29 00:30:49,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2023-11-29 00:30:49,310 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 257 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 00:30:49,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 1101 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 647 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 00:30:49,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2023-11-29 00:30:49,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 546. [2023-11-29 00:30:49,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 497 states have (on average 1.2354124748490947) internal successors, (614), 497 states have internal predecessors, (614), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-11-29 00:30:49,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 706 transitions. [2023-11-29 00:30:49,347 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 706 transitions. Word has length 176 [2023-11-29 00:30:49,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:30:49,347 INFO L495 AbstractCegarLoop]: Abstraction has 546 states and 706 transitions. [2023-11-29 00:30:49,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:30:49,347 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 706 transitions. [2023-11-29 00:30:49,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2023-11-29 00:30:49,349 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:30:49,349 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:30:49,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-11-29 00:30:49,349 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:30:49,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:30:49,349 INFO L85 PathProgramCache]: Analyzing trace with hash 121802831, now seen corresponding path program 1 times [2023-11-29 00:30:49,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:30:49,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451626818] [2023-11-29 00:30:49,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:30:49,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:30:49,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:49,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:30:49,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:49,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:30:49,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:49,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:30:49,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:49,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:30:49,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:49,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:30:49,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:49,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:30:49,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:49,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 00:30:49,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:49,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 00:30:49,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:49,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 00:30:49,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:49,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 00:30:49,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:49,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 00:30:49,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:49,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 00:30:49,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:49,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 00:30:49,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:49,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 00:30:49,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:49,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 00:30:49,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:49,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 00:30:49,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:49,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:30:49,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:49,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 00:30:49,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:49,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 00:30:49,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:49,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 00:30:49,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:49,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 00:30:49,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:49,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 00:30:49,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:49,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 00:30:49,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:49,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 00:30:49,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:30:49,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451626818] [2023-11-29 00:30:49,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451626818] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:30:49,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:30:49,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:30:49,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442127951] [2023-11-29 00:30:49,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:30:49,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:30:49,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:30:49,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:30:49,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:30:49,497 INFO L87 Difference]: Start difference. First operand 546 states and 706 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:30:49,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:30:49,671 INFO L93 Difference]: Finished difference Result 1120 states and 1426 transitions. [2023-11-29 00:30:49,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 00:30:49,672 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 177 [2023-11-29 00:30:49,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:30:49,676 INFO L225 Difference]: With dead ends: 1120 [2023-11-29 00:30:49,676 INFO L226 Difference]: Without dead ends: 637 [2023-11-29 00:30:49,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:30:49,677 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 52 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:30:49,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 494 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:30:49,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2023-11-29 00:30:49,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 610. [2023-11-29 00:30:49,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 561 states have (on average 1.2192513368983957) internal successors, (684), 561 states have internal predecessors, (684), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-11-29 00:30:49,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 776 transitions. [2023-11-29 00:30:49,738 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 776 transitions. Word has length 177 [2023-11-29 00:30:49,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:30:49,738 INFO L495 AbstractCegarLoop]: Abstraction has 610 states and 776 transitions. [2023-11-29 00:30:49,739 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:30:49,739 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 776 transitions. [2023-11-29 00:30:49,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2023-11-29 00:30:49,740 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:30:49,740 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:30:49,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-11-29 00:30:49,741 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:30:49,741 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:30:49,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1745010886, now seen corresponding path program 1 times [2023-11-29 00:30:49,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:30:49,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125489237] [2023-11-29 00:30:49,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:30:49,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:30:49,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:30:49,833 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:30:49,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:30:50,014 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:30:50,014 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 00:30:50,015 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 00:30:50,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-11-29 00:30:50,019 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-29 00:30:50,022 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 00:30:50,122 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem34 could not be translated [2023-11-29 00:30:50,125 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem35 could not be translated [2023-11-29 00:30:50,127 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem37 could not be translated [2023-11-29 00:30:50,130 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem38 could not be translated [2023-11-29 00:30:50,130 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem40 could not be translated [2023-11-29 00:30:50,131 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem40 could not be translated [2023-11-29 00:30:50,131 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem41 could not be translated [2023-11-29 00:30:50,132 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short46 could not be translated [2023-11-29 00:30:50,132 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem40 could not be translated [2023-11-29 00:30:50,132 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short42 could not be translated [2023-11-29 00:30:50,133 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem41 could not be translated [2023-11-29 00:30:50,135 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem40 could not be translated [2023-11-29 00:30:50,135 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem41 could not be translated [2023-11-29 00:30:50,135 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short42 could not be translated [2023-11-29 00:30:50,135 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short46 could not be translated [2023-11-29 00:30:50,137 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem48 could not be translated [2023-11-29 00:30:50,139 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem49 could not be translated [2023-11-29 00:30:50,140 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem51 could not be translated [2023-11-29 00:30:50,142 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem52 could not be translated [2023-11-29 00:30:50,143 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem54 could not be translated [2023-11-29 00:30:50,144 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem55 could not be translated [2023-11-29 00:30:50,146 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem57 could not be translated [2023-11-29 00:30:50,147 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem58 could not be translated [2023-11-29 00:30:50,148 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem60 could not be translated [2023-11-29 00:30:50,149 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem61 could not be translated [2023-11-29 00:30:50,150 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem63 could not be translated [2023-11-29 00:30:50,151 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem64 could not be translated [2023-11-29 00:30:50,152 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem66 could not be translated [2023-11-29 00:30:50,153 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem67 could not be translated [2023-11-29 00:30:50,154 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem69 could not be translated [2023-11-29 00:30:50,155 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem70 could not be translated [2023-11-29 00:30:50,156 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem72 could not be translated [2023-11-29 00:30:50,157 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem73 could not be translated [2023-11-29 00:30:50,158 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short14 could not be translated [2023-11-29 00:30:50,158 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem13 could not be translated [2023-11-29 00:30:50,158 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem15 could not be translated [2023-11-29 00:30:50,159 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short17 could not be translated [2023-11-29 00:30:50,159 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short19 could not be translated [2023-11-29 00:30:50,159 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem15 could not be translated [2023-11-29 00:30:50,159 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short17 could not be translated [2023-11-29 00:30:50,160 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem26 could not be translated [2023-11-29 00:30:50,160 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite27 could not be translated [2023-11-29 00:30:50,160 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem23 could not be translated [2023-11-29 00:30:50,160 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem25 could not be translated [2023-11-29 00:30:50,160 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem24 could not be translated [2023-11-29 00:30:50,161 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated [2023-11-29 00:30:50,161 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated [2023-11-29 00:30:50,161 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated [2023-11-29 00:30:50,162 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated [2023-11-29 00:30:50,162 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated [2023-11-29 00:30:50,162 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated [2023-11-29 00:30:50,162 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short84 could not be translated [2023-11-29 00:30:50,162 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated [2023-11-29 00:30:50,162 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated [2023-11-29 00:30:50,163 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated [2023-11-29 00:30:50,163 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated [2023-11-29 00:30:50,163 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated [2023-11-29 00:30:50,163 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short87 could not be translated [2023-11-29 00:30:50,163 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short84 could not be translated [2023-11-29 00:30:50,163 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated [2023-11-29 00:30:50,164 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short84 could not be translated [2023-11-29 00:30:50,164 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short89 could not be translated [2023-11-29 00:30:50,164 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short87 could not be translated [2023-11-29 00:30:50,164 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated [2023-11-29 00:30:50,164 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated [2023-11-29 00:30:50,164 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated [2023-11-29 00:30:50,165 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated [2023-11-29 00:30:50,165 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated [2023-11-29 00:30:50,165 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short87 could not be translated [2023-11-29 00:30:50,165 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short89 could not be translated [2023-11-29 00:30:50,165 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated [2023-11-29 00:30:50,166 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated [2023-11-29 00:30:50,166 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated [2023-11-29 00:30:50,166 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short84 could not be translated [2023-11-29 00:30:50,166 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated [2023-11-29 00:30:50,166 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite95 could not be translated [2023-11-29 00:30:50,166 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated [2023-11-29 00:30:50,166 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated [2023-11-29 00:30:50,166 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short89 could not be translated [2023-11-29 00:30:50,166 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated [2023-11-29 00:30:50,167 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short84 could not be translated [2023-11-29 00:30:50,167 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite95 could not be translated [2023-11-29 00:30:50,167 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short87 could not be translated [2023-11-29 00:30:50,167 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated [2023-11-29 00:30:50,167 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated [2023-11-29 00:30:50,167 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated [2023-11-29 00:30:50,167 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short111 could not be translated [2023-11-29 00:30:50,167 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated [2023-11-29 00:30:50,168 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated [2023-11-29 00:30:50,168 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated [2023-11-29 00:30:50,168 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated [2023-11-29 00:30:50,168 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short84 could not be translated [2023-11-29 00:30:50,168 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite95 could not be translated [2023-11-29 00:30:50,168 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short89 could not be translated [2023-11-29 00:30:50,168 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short87 could not be translated [2023-11-29 00:30:50,168 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short89 could not be translated [2023-11-29 00:30:50,169 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short87 could not be translated [2023-11-29 00:30:50,169 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated [2023-11-29 00:30:50,169 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short84 could not be translated [2023-11-29 00:30:50,169 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated [2023-11-29 00:30:50,169 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated [2023-11-29 00:30:50,169 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short111 could not be translated [2023-11-29 00:30:50,169 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated [2023-11-29 00:30:50,169 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem97 could not be translated [2023-11-29 00:30:50,169 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated [2023-11-29 00:30:50,169 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite110 could not be translated [2023-11-29 00:30:50,170 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite95 could not be translated [2023-11-29 00:30:50,170 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated [2023-11-29 00:30:50,170 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated [2023-11-29 00:30:50,170 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite95 could not be translated [2023-11-29 00:30:50,170 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated [2023-11-29 00:30:50,170 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem97 could not be translated [2023-11-29 00:30:50,170 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short84 could not be translated [2023-11-29 00:30:50,170 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated [2023-11-29 00:30:50,170 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite110 could not be translated [2023-11-29 00:30:50,171 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short87 could not be translated [2023-11-29 00:30:50,171 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated [2023-11-29 00:30:50,171 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short111 could not be translated [2023-11-29 00:30:50,171 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short89 could not be translated [2023-11-29 00:30:50,171 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short118 could not be translated [2023-11-29 00:30:50,171 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short111 could not be translated [2023-11-29 00:30:50,171 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated [2023-11-29 00:30:50,171 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated [2023-11-29 00:30:50,171 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated [2023-11-29 00:30:50,172 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite95 could not be translated [2023-11-29 00:30:50,172 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short84 could not be translated [2023-11-29 00:30:50,172 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated [2023-11-29 00:30:50,172 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite110 could not be translated [2023-11-29 00:30:50,172 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short89 could not be translated [2023-11-29 00:30:50,172 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short87 could not be translated [2023-11-29 00:30:50,172 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated [2023-11-29 00:30:50,172 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem97 could not be translated [2023-11-29 00:30:50,173 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short87 could not be translated [2023-11-29 00:30:50,173 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem116 could not be translated [2023-11-29 00:30:50,173 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem112 could not be translated [2023-11-29 00:30:50,173 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem115 could not be translated [2023-11-29 00:30:50,173 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short89 could not be translated [2023-11-29 00:30:50,173 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated [2023-11-29 00:30:50,173 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated [2023-11-29 00:30:50,173 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated [2023-11-29 00:30:50,174 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem113 could not be translated [2023-11-29 00:30:50,174 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short118 could not be translated [2023-11-29 00:30:50,174 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite117 could not be translated [2023-11-29 00:30:50,174 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short84 could not be translated [2023-11-29 00:30:50,174 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite95 could not be translated [2023-11-29 00:30:50,174 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated [2023-11-29 00:30:50,174 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated [2023-11-29 00:30:50,174 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem114 could not be translated [2023-11-29 00:30:50,174 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite110 could not be translated [2023-11-29 00:30:50,174 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short111 could not be translated [2023-11-29 00:30:50,175 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem97 could not be translated [2023-11-29 00:30:50,175 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short84 could not be translated [2023-11-29 00:30:50,175 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem115 could not be translated [2023-11-29 00:30:50,175 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem97 could not be translated [2023-11-29 00:30:50,175 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated [2023-11-29 00:30:50,175 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short111 could not be translated [2023-11-29 00:30:50,175 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short118 could not be translated [2023-11-29 00:30:50,175 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short87 could not be translated [2023-11-29 00:30:50,175 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite117 could not be translated [2023-11-29 00:30:50,176 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated [2023-11-29 00:30:50,176 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem112 could not be translated [2023-11-29 00:30:50,176 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated [2023-11-29 00:30:50,176 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem116 could not be translated [2023-11-29 00:30:50,176 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem114 could not be translated [2023-11-29 00:30:50,176 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated [2023-11-29 00:30:50,176 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite110 could not be translated [2023-11-29 00:30:50,176 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem113 could not be translated [2023-11-29 00:30:50,176 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated [2023-11-29 00:30:50,176 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite95 could not be translated [2023-11-29 00:30:50,177 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short89 could not be translated [2023-11-29 00:30:50,202 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 12:30:50 BoogieIcfgContainer [2023-11-29 00:30:50,202 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 00:30:50,203 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 00:30:50,203 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 00:30:50,203 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 00:30:50,203 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:30:13" (3/4) ... [2023-11-29 00:30:50,205 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 00:30:50,206 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 00:30:50,207 INFO L158 Benchmark]: Toolchain (without parser) took 38193.44ms. Allocated memory was 161.5MB in the beginning and 685.8MB in the end (delta: 524.3MB). Free memory was 122.5MB in the beginning and 486.7MB in the end (delta: -364.2MB). Peak memory consumption was 163.3MB. Max. memory is 16.1GB. [2023-11-29 00:30:50,207 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 161.5MB. Free memory was 104.5MB in the beginning and 104.4MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 00:30:50,207 INFO L158 Benchmark]: CACSL2BoogieTranslator took 283.42ms. Allocated memory is still 161.5MB. Free memory was 121.9MB in the beginning and 106.3MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-29 00:30:50,208 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.64ms. Allocated memory is still 161.5MB. Free memory was 106.3MB in the beginning and 102.6MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 00:30:50,208 INFO L158 Benchmark]: Boogie Preprocessor took 72.43ms. Allocated memory is still 161.5MB. Free memory was 102.6MB in the beginning and 98.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 00:30:50,208 INFO L158 Benchmark]: RCFGBuilder took 630.98ms. Allocated memory is still 161.5MB. Free memory was 98.4MB in the beginning and 65.3MB in the end (delta: 33.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2023-11-29 00:30:50,209 INFO L158 Benchmark]: TraceAbstraction took 37113.73ms. Allocated memory was 226.5MB in the beginning and 685.8MB in the end (delta: 459.3MB). Free memory was 193.5MB in the beginning and 486.7MB in the end (delta: -293.1MB). Peak memory consumption was 164.2MB. Max. memory is 16.1GB. [2023-11-29 00:30:50,209 INFO L158 Benchmark]: Witness Printer took 3.63ms. Allocated memory is still 685.8MB. Free memory is still 486.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 00:30:50,210 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.20ms. Allocated memory is still 161.5MB. Free memory was 104.5MB in the beginning and 104.4MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 283.42ms. Allocated memory is still 161.5MB. Free memory was 121.9MB in the beginning and 106.3MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.64ms. Allocated memory is still 161.5MB. Free memory was 106.3MB in the beginning and 102.6MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.43ms. Allocated memory is still 161.5MB. Free memory was 102.6MB in the beginning and 98.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 630.98ms. Allocated memory is still 161.5MB. Free memory was 98.4MB in the beginning and 65.3MB in the end (delta: 33.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 37113.73ms. Allocated memory was 226.5MB in the beginning and 685.8MB in the end (delta: 459.3MB). Free memory was 193.5MB in the beginning and 486.7MB in the end (delta: -293.1MB). Peak memory consumption was 164.2MB. Max. memory is 16.1GB. * Witness Printer took 3.63ms. Allocated memory is still 685.8MB. Free memory is still 486.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem34 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem35 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem37 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem38 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem40 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem40 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem41 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short46 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem40 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short42 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem41 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem40 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem41 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short42 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short46 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem48 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem49 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem51 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem52 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem54 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem55 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem57 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem58 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem60 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem61 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem63 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem64 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem66 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem67 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem69 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem70 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem72 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem73 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short14 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem13 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem15 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short19 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem15 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem26 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite27 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem23 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem25 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem24 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short84 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short87 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short84 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short84 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short89 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short87 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short87 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short89 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short84 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite95 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short89 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short84 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite95 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short87 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short111 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short84 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite95 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short89 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short87 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short89 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short87 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short84 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short111 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem97 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite110 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite95 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite95 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem97 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short84 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite110 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short87 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short111 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short89 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short118 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short111 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite95 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short84 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite110 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short89 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short87 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem97 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short87 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem116 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem112 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem115 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short89 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem113 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short118 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite117 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short84 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite95 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem114 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite110 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short111 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem97 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short84 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem115 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem97 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short111 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short118 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short87 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite117 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem112 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem116 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem114 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite110 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem113 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite95 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short89 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 143. Possible FailurePath: [L40] unsigned char isInitial = 0; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L59] double* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L60] unsigned char* WrapperStruct00_var_1_2_Pointer = &(WrapperStruct00.var_1_2); [L61] unsigned char* WrapperStruct00_var_1_3_Pointer = &(WrapperStruct00.var_1_3); [L62] double* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L63] unsigned char* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L64] unsigned char* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L65] unsigned char* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L66] unsigned char* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L67] signed char* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L68] unsigned char* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L69] unsigned char* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L70] unsigned char* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L71] signed char* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L72] signed char* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L73] signed char* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L74] signed char* WrapperStruct00_var_1_17_Pointer = &(WrapperStruct00.var_1_17); [L75] unsigned char last_1_WrapperStruct00_var_1_5 = 0; [L147] isInitial = 1 [L148] FCALL initially() [L149] COND TRUE 1 [L150] CALL updateLastVariables() [L140] EXPR WrapperStruct00.var_1_5 [L140] last_1_WrapperStruct00_var_1_5 = WrapperStruct00.var_1_5 [L150] RET updateLastVariables() [L151] CALL updateVariables() [L103] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L104] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L105] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L106] WrapperStruct00.var_1_3 = __VERIFIER_nondet_uchar() [L107] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L108] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L109] WrapperStruct00.var_1_4 = __VERIFIER_nondet_double() [L110] EXPR WrapperStruct00.var_1_4 [L110] EXPR WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L110] EXPR WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F [L110] EXPR WrapperStruct00.var_1_4 [L110] EXPR WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L110] EXPR (WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L110] EXPR (WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L110] CALL assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L110] RET assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L111] WrapperStruct00.var_1_7 = __VERIFIER_nondet_uchar() [L112] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L113] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L114] WrapperStruct00.var_1_8 = __VERIFIER_nondet_uchar() [L115] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L116] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L117] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L118] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L118] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L118] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L119] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L120] WrapperStruct00.var_1_11 = __VERIFIER_nondet_uchar() [L121] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L121] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L121] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L122] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L122] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 128) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L122] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 128) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L123] WrapperStruct00.var_1_12 = __VERIFIER_nondet_uchar() [L124] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L124] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= 64) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L124] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= 64) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L125] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L125] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L125] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L126] WrapperStruct00.var_1_13 = __VERIFIER_nondet_uchar() [L127] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L128] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L128] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L128] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L129] WrapperStruct00.var_1_14 = __VERIFIER_nondet_char() [L130] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L130] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= -63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L130] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= -63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L131] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L131] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L131] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L132] WrapperStruct00.var_1_15 = __VERIFIER_nondet_char() [L133] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L133] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= -63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L133] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= -63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L134] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L134] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L134] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L135] WrapperStruct00.var_1_16 = __VERIFIER_nondet_char() [L136] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L136] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L136] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L137] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L137] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L137] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L151] RET updateVariables() [L152] CALL step() [L79] COND FALSE !(\read(last_1_WrapperStruct00_var_1_5)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L84] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L84] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L84] EXPR \read(*WrapperStruct00_var_1_1_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L84] COND FALSE !((*(WrapperStruct00_var_1_1_Pointer)) >= (- ((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_1_Pointer))))) [L87] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L87] (*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L87] (*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L87] COND TRUE (*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4)) [L88] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L88] EXPR (*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L88] EXPR (*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L88] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L88] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L88] (*(WrapperStruct00_var_1_5_Pointer)) = (((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer))) [L92] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L92] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L92] EXPR \read(*WrapperStruct00_var_1_13_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L92] EXPR (((*(WrapperStruct00_var_1_13_Pointer))) < (1)) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (1) [L92] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L92] EXPR (((*(WrapperStruct00_var_1_13_Pointer))) < (1)) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L92] signed long int stepLocal_1 = ((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (((((*(WrapperStruct00_var_1_13_Pointer))) < (1)) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (1))); [L93] EXPR \read(*WrapperStruct00_var_1_17_Pointer) [L93] signed char stepLocal_0 = (*(WrapperStruct00_var_1_17_Pointer)); [L94] COND FALSE !(-10 >= stepLocal_0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L152] RET step() [L153] CALL, EXPR property() [L143] EXPR last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1 [L143] EXPR last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L143] EXPR (last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (! (! ((*(WrapperStruct00_var_1_8_Pointer)) || (*(WrapperStruct00_var_1_9_Pointer)))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L143] EXPR (last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (! (! ((*(WrapperStruct00_var_1_8_Pointer)) || (*(WrapperStruct00_var_1_9_Pointer)))))))) [L143] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L143] EXPR (*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L143] EXPR (*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L143] EXPR ((*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (! (! ((*(WrapperStruct00_var_1_8_Pointer)) || (*(WrapperStruct00_var_1_9_Pointer))))))) [L143] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L143] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L143] EXPR (*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L143] EXPR (*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L143] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L143] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L143] EXPR ((*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (! (! ((*(WrapperStruct00_var_1_8_Pointer)) || (*(WrapperStruct00_var_1_9_Pointer))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L143] EXPR (last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (! (! ((*(WrapperStruct00_var_1_8_Pointer)) || (*(WrapperStruct00_var_1_9_Pointer)))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L143] EXPR ((last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (! (! ((*(WrapperStruct00_var_1_8_Pointer)) || (*(WrapperStruct00_var_1_9_Pointer))))))))) && ((-10 >= (*(WrapperStruct00_var_1_17_Pointer))) ? (((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (((((*(WrapperStruct00_var_1_13_Pointer))) < (1)) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (1)))) > (~ (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_16_Pointer))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L143] EXPR ((last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (! (! ((*(WrapperStruct00_var_1_8_Pointer)) || (*(WrapperStruct00_var_1_9_Pointer))))))))) && ((-10 >= (*(WrapperStruct00_var_1_17_Pointer))) ? (((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (((((*(WrapperStruct00_var_1_13_Pointer))) < (1)) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (1)))) > (~ (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_16_Pointer))))) : 1) [L143] EXPR \read(*WrapperStruct00_var_1_17_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L143] EXPR (-10 >= (*(WrapperStruct00_var_1_17_Pointer))) ? (((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (((((*(WrapperStruct00_var_1_13_Pointer))) < (1)) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (1)))) > (~ (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_16_Pointer))))) : 1 [L143] EXPR (-10 >= (*(WrapperStruct00_var_1_17_Pointer))) ? (((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (((((*(WrapperStruct00_var_1_13_Pointer))) < (1)) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (1)))) > (~ (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_16_Pointer))))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L143] EXPR ((last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (! (! ((*(WrapperStruct00_var_1_8_Pointer)) || (*(WrapperStruct00_var_1_9_Pointer))))))))) && ((-10 >= (*(WrapperStruct00_var_1_17_Pointer))) ? (((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (((((*(WrapperStruct00_var_1_13_Pointer))) < (1)) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (1)))) > (~ (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_16_Pointer))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L143] EXPR (((last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (! (! ((*(WrapperStruct00_var_1_8_Pointer)) || (*(WrapperStruct00_var_1_9_Pointer))))))))) && ((-10 >= (*(WrapperStruct00_var_1_17_Pointer))) ? (((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (((((*(WrapperStruct00_var_1_13_Pointer))) < (1)) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (1)))) > (~ (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_16_Pointer))))) : 1)) && (((*(WrapperStruct00_var_1_1_Pointer)) >= (- ((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_1_Pointer))))) ? ((*(WrapperStruct00_var_1_17_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_15_Pointer)))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L143] EXPR (((last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (! (! ((*(WrapperStruct00_var_1_8_Pointer)) || (*(WrapperStruct00_var_1_9_Pointer))))))))) && ((-10 >= (*(WrapperStruct00_var_1_17_Pointer))) ? (((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (((((*(WrapperStruct00_var_1_13_Pointer))) < (1)) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (1)))) > (~ (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_16_Pointer))))) : 1)) && (((*(WrapperStruct00_var_1_1_Pointer)) >= (- ((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_1_Pointer))))) ? ((*(WrapperStruct00_var_1_17_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_15_Pointer)))) : 1) [L143] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L143] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L143] EXPR \read(*WrapperStruct00_var_1_1_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L143] EXPR ((*(WrapperStruct00_var_1_1_Pointer)) >= (- ((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_1_Pointer))))) ? ((*(WrapperStruct00_var_1_17_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_15_Pointer)))) : 1 [L143] EXPR \read(*WrapperStruct00_var_1_17_Pointer) [L143] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L143] EXPR ((*(WrapperStruct00_var_1_1_Pointer)) >= (- ((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_1_Pointer))))) ? ((*(WrapperStruct00_var_1_17_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_15_Pointer)))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L143] EXPR (((last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (! (! ((*(WrapperStruct00_var_1_8_Pointer)) || (*(WrapperStruct00_var_1_9_Pointer))))))))) && ((-10 >= (*(WrapperStruct00_var_1_17_Pointer))) ? (((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (((((*(WrapperStruct00_var_1_13_Pointer))) < (1)) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (1)))) > (~ (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_16_Pointer))))) : 1)) && (((*(WrapperStruct00_var_1_1_Pointer)) >= (- ((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_1_Pointer))))) ? ((*(WrapperStruct00_var_1_17_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_15_Pointer)))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L143-L144] return (((last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (! (! ((*(WrapperStruct00_var_1_8_Pointer)) || (*(WrapperStruct00_var_1_9_Pointer))))))))) && ((-10 >= (*(WrapperStruct00_var_1_17_Pointer))) ? (((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (((((*(WrapperStruct00_var_1_13_Pointer))) < (1)) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (1)))) > (~ (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_16_Pointer))))) : 1)) && (((*(WrapperStruct00_var_1_1_Pointer)) >= (- ((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_1_Pointer))))) ? ((*(WrapperStruct00_var_1_17_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_15_Pointer)))) : 1) ; [L153] RET, EXPR property() [L153] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=0, cond=0, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=0, cond=0, isInitial=1, last_1_WrapperStruct00_var_1_5=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 113 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 36.9s, OverallIterations: 37, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 13.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5854 SdHoareTripleChecker+Valid, 9.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5852 mSDsluCounter, 20590 SdHoareTripleChecker+Invalid, 8.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14815 mSDsCounter, 244 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9485 IncrementalHoareTripleChecker+Invalid, 9729 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 244 mSolverCounterUnsat, 5775 mSDtfsCounter, 9485 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2054 GetRequests, 1768 SyntacticMatches, 6 SemanticMatches, 280 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=610occurred in iteration=36, InterpolantAutomatonStates: 261, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 36 MinimizatonAttempts, 1728 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 19.7s InterpolantComputationTime, 6414 NumberOfCodeBlocks, 6414 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 6199 ConstructedInterpolants, 0 QuantifiedInterpolants, 27686 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 36 InterpolantComputations, 36 PerfectInterpolantSequences, 36432/36432 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-29 00:30:50,247 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-34.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b7d4f9d78490f5290f13c8883d00adc73ba1976bc9e9ac925a881a19aea54245 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:30:52,167 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:30:52,234 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-29 00:30:52,252 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:30:52,252 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:30:52,280 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:30:52,281 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:30:52,281 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:30:52,282 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 00:30:52,283 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 00:30:52,283 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:30:52,284 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:30:52,285 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:30:52,285 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:30:52,286 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:30:52,286 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:30:52,287 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 00:30:52,288 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 00:30:52,288 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 00:30:52,289 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:30:52,289 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 00:30:52,290 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:30:52,290 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 00:30:52,291 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 00:30:52,291 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 00:30:52,292 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 00:30:52,292 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 00:30:52,293 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 00:30:52,293 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:30:52,293 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:30:52,294 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:30:52,294 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 00:30:52,295 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:30:52,295 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:30:52,295 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:30:52,295 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:30:52,296 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 00:30:52,296 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 00:30:52,296 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 00:30:52,296 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:30:52,296 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:30:52,297 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 00:30:52,297 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:30:52,297 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:30:52,297 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 00:30:52,297 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_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b7d4f9d78490f5290f13c8883d00adc73ba1976bc9e9ac925a881a19aea54245 [2023-11-29 00:30:52,606 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:30:52,625 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:30:52,628 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:30:52,629 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:30:52,630 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:30:52,631 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-34.i [2023-11-29 00:30:55,442 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:30:55,648 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:30:55,648 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-34.i [2023-11-29 00:30:55,659 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/data/1350c1018/8249899a3a4f4a3097c395f328b82cd5/FLAGf81230548 [2023-11-29 00:30:55,672 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/data/1350c1018/8249899a3a4f4a3097c395f328b82cd5 [2023-11-29 00:30:55,674 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:30:55,675 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:30:55,676 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:30:55,677 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:30:55,681 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:30:55,681 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:30:55" (1/1) ... [2023-11-29 00:30:55,682 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@601d3ef9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:30:55, skipping insertion in model container [2023-11-29 00:30:55,683 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:30:55" (1/1) ... [2023-11-29 00:30:55,710 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:30:55,836 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_c1ee620e-1e99-4575-8051-7b00d678fb60/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-34.i[917,930] [2023-11-29 00:30:55,898 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:30:55,917 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 00:30:55,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_c1ee620e-1e99-4575-8051-7b00d678fb60/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-34.i[917,930] [2023-11-29 00:30:55,966 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:30:55,990 INFO L206 MainTranslator]: Completed translation [2023-11-29 00:30:55,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:30:55 WrapperNode [2023-11-29 00:30:55,991 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:30:55,992 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 00:30:55,992 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 00:30:55,992 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 00:30:55,998 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:30:55" (1/1) ... [2023-11-29 00:30:56,015 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:30:55" (1/1) ... [2023-11-29 00:30:56,053 INFO L138 Inliner]: procedures = 30, calls = 150, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 404 [2023-11-29 00:30:56,054 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 00:30:56,055 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 00:30:56,055 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 00:30:56,055 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 00:30:56,065 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:30:55" (1/1) ... [2023-11-29 00:30:56,066 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:30:55" (1/1) ... [2023-11-29 00:30:56,075 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:30:55" (1/1) ... [2023-11-29 00:30:56,099 INFO L175 MemorySlicer]: Split 115 memory accesses to 2 slices as follows [2, 113]. 98 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 16]. The 18 writes are split as follows [0, 18]. [2023-11-29 00:30:56,099 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:30:55" (1/1) ... [2023-11-29 00:30:56,099 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:30:55" (1/1) ... [2023-11-29 00:30:56,122 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:30:55" (1/1) ... [2023-11-29 00:30:56,153 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:30:55" (1/1) ... [2023-11-29 00:30:56,157 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:30:55" (1/1) ... [2023-11-29 00:30:56,162 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:30:55" (1/1) ... [2023-11-29 00:30:56,168 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 00:30:56,186 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 00:30:56,186 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 00:30:56,186 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 00:30:56,187 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:30:55" (1/1) ... [2023-11-29 00:30:56,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:30:56,207 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:30:56,219 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 00:30:56,224 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 00:30:56,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 00:30:56,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2023-11-29 00:30:56,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2023-11-29 00:30:56,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2023-11-29 00:30:56,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2023-11-29 00:30:56,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-11-29 00:30:56,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-11-29 00:30:56,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 00:30:56,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 00:30:56,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2023-11-29 00:30:56,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2023-11-29 00:30:56,256 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 00:30:56,256 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 00:30:56,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 00:30:56,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 00:30:56,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2023-11-29 00:30:56,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2023-11-29 00:30:56,379 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 00:30:56,381 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 00:31:08,910 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 00:31:08,969 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 00:31:08,969 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 00:31:08,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:31:08 BoogieIcfgContainer [2023-11-29 00:31:08,970 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 00:31:08,972 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 00:31:08,972 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 00:31:08,975 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 00:31:08,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:30:55" (1/3) ... [2023-11-29 00:31:08,975 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3371ab8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:31:08, skipping insertion in model container [2023-11-29 00:31:08,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:30:55" (2/3) ... [2023-11-29 00:31:08,976 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3371ab8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:31:08, skipping insertion in model container [2023-11-29 00:31:08,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:31:08" (3/3) ... [2023-11-29 00:31:08,977 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-34.i [2023-11-29 00:31:08,991 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 00:31:08,991 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 00:31:09,033 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:31:09,038 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@53d772ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:31:09,038 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 00:31:09,042 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 87 states have (on average 1.4022988505747127) internal successors, (122), 88 states have internal predecessors, (122), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-29 00:31:09,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2023-11-29 00:31:09,057 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:31:09,057 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:31:09,058 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:31:09,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:31:09,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1982887210, now seen corresponding path program 1 times [2023-11-29 00:31:09,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:31:09,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1026427266] [2023-11-29 00:31:09,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:31:09,075 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:31:09,075 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:31:09,077 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:31:09,084 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-29 00:31:09,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:09,591 INFO L262 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 00:31:09,602 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:31:09,649 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 492 proven. 0 refuted. 0 times theorem prover too weak. 520 trivial. 0 not checked. [2023-11-29 00:31:09,650 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:31:09,650 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:31:09,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1026427266] [2023-11-29 00:31:09,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1026427266] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:31:09,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:31:09,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:31:09,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501379493] [2023-11-29 00:31:09,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:31:09,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 00:31:09,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:31:09,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 00:31:09,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 00:31:09,701 INFO L87 Difference]: Start difference. First operand has 113 states, 87 states have (on average 1.4022988505747127) internal successors, (122), 88 states have internal predecessors, (122), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) 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, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2023-11-29 00:31:09,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:31:09,761 INFO L93 Difference]: Finished difference Result 223 states and 357 transitions. [2023-11-29 00:31:09,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 00:31:09,763 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, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 166 [2023-11-29 00:31:09,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:31:09,772 INFO L225 Difference]: With dead ends: 223 [2023-11-29 00:31:09,772 INFO L226 Difference]: Without dead ends: 111 [2023-11-29 00:31:09,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 00:31:09,781 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 159 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-29 00:31:09,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:31:09,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-11-29 00:31:09,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2023-11-29 00:31:09,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 86 states have (on average 1.3604651162790697) internal successors, (117), 86 states have internal predecessors, (117), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-29 00:31:09,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 163 transitions. [2023-11-29 00:31:09,834 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 163 transitions. Word has length 166 [2023-11-29 00:31:09,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:31:09,834 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 163 transitions. [2023-11-29 00:31:09,835 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, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2023-11-29 00:31:09,835 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 163 transitions. [2023-11-29 00:31:09,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2023-11-29 00:31:09,840 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:31:09,840 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:31:09,852 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-29 00:31:10,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:31:10,042 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:31:10,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:31:10,043 INFO L85 PathProgramCache]: Analyzing trace with hash 799028980, now seen corresponding path program 1 times [2023-11-29 00:31:10,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:31:10,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [223090498] [2023-11-29 00:31:10,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:31:10,044 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:31:10,044 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:31:10,045 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:31:10,046 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-29 00:31:10,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:10,525 INFO L262 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 00:31:10,531 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:31:10,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 00:31:10,566 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:31:10,566 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:31:10,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [223090498] [2023-11-29 00:31:10,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [223090498] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:31:10,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:31:10,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:31:10,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894827197] [2023-11-29 00:31:10,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:31:10,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:31:10,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:31:10,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:31:10,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:31:10,571 INFO L87 Difference]: Start difference. First operand 111 states and 163 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:31:10,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:31:10,638 INFO L93 Difference]: Finished difference Result 219 states and 322 transitions. [2023-11-29 00:31:10,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:31:10,639 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 166 [2023-11-29 00:31:10,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:31:10,643 INFO L225 Difference]: With dead ends: 219 [2023-11-29 00:31:10,643 INFO L226 Difference]: Without dead ends: 109 [2023-11-29 00:31:10,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:31:10,660 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:31:10,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 304 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:31:10,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-11-29 00:31:10,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2023-11-29 00:31:10,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 84 states have (on average 1.3452380952380953) internal successors, (113), 84 states have internal predecessors, (113), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-29 00:31:10,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 159 transitions. [2023-11-29 00:31:10,677 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 159 transitions. Word has length 166 [2023-11-29 00:31:10,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:31:10,680 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 159 transitions. [2023-11-29 00:31:10,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:31:10,680 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 159 transitions. [2023-11-29 00:31:10,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2023-11-29 00:31:10,684 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:31:10,684 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:31:10,695 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-29 00:31:10,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:31:10,888 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:31:10,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:31:10,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1403213728, now seen corresponding path program 1 times [2023-11-29 00:31:10,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:31:10,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [159647790] [2023-11-29 00:31:10,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:31:10,891 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:31:10,891 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:31:10,892 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:31:10,893 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-29 00:31:11,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:11,316 INFO L262 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 00:31:11,321 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:31:11,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 00:31:11,379 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:31:11,380 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:31:11,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [159647790] [2023-11-29 00:31:11,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [159647790] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:31:11,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:31:11,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:31:11,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345603053] [2023-11-29 00:31:11,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:31:11,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:31:11,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:31:11,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:31:11,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:31:11,384 INFO L87 Difference]: Start difference. First operand 109 states and 159 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:31:11,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:31:11,501 INFO L93 Difference]: Finished difference Result 241 states and 353 transitions. [2023-11-29 00:31:11,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:31:11,502 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 168 [2023-11-29 00:31:11,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:31:11,505 INFO L225 Difference]: With dead ends: 241 [2023-11-29 00:31:11,506 INFO L226 Difference]: Without dead ends: 133 [2023-11-29 00:31:11,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:31:11,508 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 61 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:31:11,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 475 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:31:11,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-11-29 00:31:11,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 111. [2023-11-29 00:31:11,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 86 states have (on average 1.3372093023255813) internal successors, (115), 86 states have internal predecessors, (115), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-29 00:31:11,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 161 transitions. [2023-11-29 00:31:11,524 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 161 transitions. Word has length 168 [2023-11-29 00:31:11,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:31:11,526 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 161 transitions. [2023-11-29 00:31:11,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:31:11,526 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 161 transitions. [2023-11-29 00:31:11,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2023-11-29 00:31:11,529 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:31:11,530 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:31:11,541 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-29 00:31:11,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:31:11,732 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:31:11,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:31:11,733 INFO L85 PathProgramCache]: Analyzing trace with hash -165501938, now seen corresponding path program 1 times [2023-11-29 00:31:11,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:31:11,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1504220496] [2023-11-29 00:31:11,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:31:11,734 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:31:11,734 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:31:11,735 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:31:11,736 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-29 00:31:12,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:12,193 INFO L262 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 00:31:12,198 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:31:12,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-11-29 00:31:13,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 00:31:13,022 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:31:13,022 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:31:13,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1504220496] [2023-11-29 00:31:13,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1504220496] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:31:13,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:31:13,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:31:13,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115341745] [2023-11-29 00:31:13,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:31:13,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:31:13,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:31:13,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:31:13,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:31:13,026 INFO L87 Difference]: Start difference. First operand 111 states and 161 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:31:17,465 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:31:18,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:31:18,467 INFO L93 Difference]: Finished difference Result 333 states and 483 transitions. [2023-11-29 00:31:18,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:31:18,468 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 170 [2023-11-29 00:31:18,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:31:18,471 INFO L225 Difference]: With dead ends: 333 [2023-11-29 00:31:18,471 INFO L226 Difference]: Without dead ends: 223 [2023-11-29 00:31:18,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:31:18,472 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 91 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 64 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2023-11-29 00:31:18,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 370 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 111 Invalid, 1 Unknown, 0 Unchecked, 5.4s Time] [2023-11-29 00:31:18,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2023-11-29 00:31:18,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 184. [2023-11-29 00:31:18,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 135 states have (on average 1.288888888888889) internal successors, (174), 135 states have internal predecessors, (174), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-11-29 00:31:18,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 266 transitions. [2023-11-29 00:31:18,500 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 266 transitions. Word has length 170 [2023-11-29 00:31:18,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:31:18,501 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 266 transitions. [2023-11-29 00:31:18,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:31:18,501 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 266 transitions. [2023-11-29 00:31:18,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2023-11-29 00:31:18,504 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:31:18,504 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:31:18,516 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-29 00:31:18,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:31:18,705 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:31:18,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:31:18,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1516518554, now seen corresponding path program 1 times [2023-11-29 00:31:18,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:31:18,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1146983466] [2023-11-29 00:31:18,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:31:18,707 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:31:18,707 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:31:18,709 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:31:18,711 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-29 00:31:19,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:19,143 INFO L262 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 00:31:19,146 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:31:19,164 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 00:31:19,164 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:31:19,165 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:31:19,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1146983466] [2023-11-29 00:31:19,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1146983466] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:31:19,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:31:19,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:31:19,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078611685] [2023-11-29 00:31:19,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:31:19,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:31:19,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:31:19,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:31:19,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:31:19,167 INFO L87 Difference]: Start difference. First operand 184 states and 266 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:31:19,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:31:19,218 INFO L93 Difference]: Finished difference Result 321 states and 465 transitions. [2023-11-29 00:31:19,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:31:19,219 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 173 [2023-11-29 00:31:19,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:31:19,221 INFO L225 Difference]: With dead ends: 321 [2023-11-29 00:31:19,221 INFO L226 Difference]: Without dead ends: 195 [2023-11-29 00:31:19,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:31:19,223 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 26 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:31:19,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 289 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:31:19,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2023-11-29 00:31:19,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 182. [2023-11-29 00:31:19,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 133 states have (on average 1.2781954887218046) internal successors, (170), 133 states have internal predecessors, (170), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-11-29 00:31:19,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 262 transitions. [2023-11-29 00:31:19,245 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 262 transitions. Word has length 173 [2023-11-29 00:31:19,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:31:19,246 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 262 transitions. [2023-11-29 00:31:19,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:31:19,247 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 262 transitions. [2023-11-29 00:31:19,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-29 00:31:19,249 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:31:19,249 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:31:19,260 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-11-29 00:31:19,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:31:19,456 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:31:19,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:31:19,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1906828626, now seen corresponding path program 1 times [2023-11-29 00:31:19,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:31:19,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [931584458] [2023-11-29 00:31:19,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:31:19,457 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:31:19,457 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:31:19,458 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:31:19,459 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-29 00:31:19,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:19,889 INFO L262 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 00:31:19,895 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:31:19,941 INFO L378 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 12 treesize of output 8 [2023-11-29 00:31:20,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-29 00:31:20,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 00:31:20,244 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:31:20,244 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:31:20,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [931584458] [2023-11-29 00:31:20,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [931584458] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:31:20,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:31:20,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 00:31:20,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71488623] [2023-11-29 00:31:20,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:31:20,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 00:31:20,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:31:20,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 00:31:20,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-11-29 00:31:20,248 INFO L87 Difference]: Start difference. First operand 182 states and 262 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:31:22,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:31:28,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:31:30,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:31:35,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:31:38,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:31:41,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:31:41,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:31:41,336 INFO L93 Difference]: Finished difference Result 406 states and 581 transitions. [2023-11-29 00:31:41,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-29 00:31:41,337 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2023-11-29 00:31:41,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:31:41,340 INFO L225 Difference]: With dead ends: 406 [2023-11-29 00:31:41,340 INFO L226 Difference]: Without dead ends: 282 [2023-11-29 00:31:41,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2023-11-29 00:31:41,342 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 299 mSDsluCounter, 1079 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 1204 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.6s IncrementalHoareTripleChecker+Time [2023-11-29 00:31:41,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 1204 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 390 Invalid, 2 Unknown, 0 Unchecked, 20.6s Time] [2023-11-29 00:31:41,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2023-11-29 00:31:41,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 219. [2023-11-29 00:31:41,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 170 states have (on average 1.2823529411764707) internal successors, (218), 170 states have internal predecessors, (218), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-11-29 00:31:41,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 310 transitions. [2023-11-29 00:31:41,361 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 310 transitions. Word has length 175 [2023-11-29 00:31:41,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:31:41,362 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 310 transitions. [2023-11-29 00:31:41,362 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:31:41,362 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 310 transitions. [2023-11-29 00:31:41,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-29 00:31:41,363 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:31:41,363 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:31:41,371 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-11-29 00:31:41,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:31:41,564 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:31:41,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:31:41,564 INFO L85 PathProgramCache]: Analyzing trace with hash -2041690198, now seen corresponding path program 1 times [2023-11-29 00:31:41,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:31:41,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1745097705] [2023-11-29 00:31:41,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:31:41,565 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:31:41,566 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:31:41,566 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:31:41,567 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-29 00:31:41,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:41,992 INFO L262 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 00:31:41,996 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:31:42,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 00:31:42,137 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:31:42,137 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:31:42,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1745097705] [2023-11-29 00:31:42,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1745097705] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:31:42,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:31:42,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 00:31:42,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031439320] [2023-11-29 00:31:42,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:31:42,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:31:42,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:31:42,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:31:42,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:31:42,140 INFO L87 Difference]: Start difference. First operand 219 states and 310 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:31:45,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:31:47,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:31:49,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:31:53,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:31:53,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:31:53,582 INFO L93 Difference]: Finished difference Result 450 states and 630 transitions. [2023-11-29 00:31:53,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 00:31:53,583 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2023-11-29 00:31:53,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:31:53,586 INFO L225 Difference]: With dead ends: 450 [2023-11-29 00:31:53,586 INFO L226 Difference]: Without dead ends: 289 [2023-11-29 00:31:53,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-11-29 00:31:53,588 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 160 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.3s IncrementalHoareTripleChecker+Time [2023-11-29 00:31:53,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 636 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 182 Invalid, 1 Unknown, 0 Unchecked, 11.3s Time] [2023-11-29 00:31:53,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2023-11-29 00:31:53,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 225. [2023-11-29 00:31:53,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 176 states have (on average 1.2840909090909092) internal successors, (226), 176 states have internal predecessors, (226), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-11-29 00:31:53,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 318 transitions. [2023-11-29 00:31:53,609 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 318 transitions. Word has length 175 [2023-11-29 00:31:53,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:31:53,609 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 318 transitions. [2023-11-29 00:31:53,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:31:53,610 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 318 transitions. [2023-11-29 00:31:53,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-29 00:31:53,611 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:31:53,611 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:31:53,624 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-11-29 00:31:53,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:31:53,816 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:31:53,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:31:53,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1242159848, now seen corresponding path program 1 times [2023-11-29 00:31:53,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:31:53,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [523693361] [2023-11-29 00:31:53,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:31:53,818 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:31:53,818 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:31:53,818 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:31:53,819 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-29 00:31:54,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:31:54,470 INFO L262 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 44 conjunts are in the unsatisfiable core [2023-11-29 00:31:54,486 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:31:55,130 INFO L378 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 8 treesize of output 1 [2023-11-29 00:31:55,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2023-11-29 00:32:00,586 INFO L378 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 33 treesize of output 24 [2023-11-29 00:32:01,258 INFO L378 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 30 treesize of output 32 [2023-11-29 00:32:02,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2023-11-29 00:32:03,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2023-11-29 00:32:03,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 43 [2023-11-29 00:32:04,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 46 [2023-11-29 00:32:05,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2023-11-29 00:32:06,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 57 [2023-11-29 00:32:07,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 57 [2023-11-29 00:32:09,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 57 [2023-11-29 00:32:09,891 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:32:09,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 66 treesize of output 62 [2023-11-29 00:32:10,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 654 proven. 219 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2023-11-29 00:32:10,360 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:32:11,060 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:32:11,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [523693361] [2023-11-29 00:32:11,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [523693361] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:32:11,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [728238287] [2023-11-29 00:32:11,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:32:11,061 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 00:32:11,061 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 00:32:11,062 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 00:32:11,064 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2023-11-29 00:32:12,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:32:12,372 INFO L262 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 41 conjunts are in the unsatisfiable core [2023-11-29 00:32:12,383 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:32:13,122 INFO L378 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-29 00:32:13,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 1 [2023-11-29 00:32:14,143 INFO L378 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-29 00:32:14,682 INFO L378 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-29 00:32:15,240 INFO L378 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 12 treesize of output 8 [2023-11-29 00:32:15,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 00:32:16,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-11-29 00:32:17,419 INFO L378 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 29 treesize of output 31 [2023-11-29 00:32:18,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2023-11-29 00:32:19,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 45 [2023-11-29 00:32:20,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 53 [2023-11-29 00:32:21,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 56 [2023-11-29 00:32:22,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 68 [2023-11-29 00:32:23,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 640 proven. 168 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2023-11-29 00:32:23,149 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:32:23,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [728238287] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:32:23,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:32:23,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 26 [2023-11-29 00:32:23,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899189579] [2023-11-29 00:32:23,570 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:32:23,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-29 00:32:23,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:32:23,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-29 00:32:23,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=828, Unknown=1, NotChecked=0, Total=992 [2023-11-29 00:32:23,572 INFO L87 Difference]: Start difference. First operand 225 states and 318 transitions. Second operand has 27 states, 26 states have (on average 5.576923076923077) internal successors, (145), 25 states have internal predecessors, (145), 13 states have call successors, (46), 12 states have call predecessors, (46), 13 states have return successors, (46), 13 states have call predecessors, (46), 13 states have call successors, (46) [2023-11-29 00:32:30,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:32:45,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:32:50,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:32:58,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:33:02,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:33:06,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:33:09,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:33:13,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:33:16,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:33:19,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:33:24,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:33:41,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:33:41,649 INFO L93 Difference]: Finished difference Result 670 states and 893 transitions. [2023-11-29 00:33:41,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2023-11-29 00:33:41,650 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 5.576923076923077) internal successors, (145), 25 states have internal predecessors, (145), 13 states have call successors, (46), 12 states have call predecessors, (46), 13 states have return successors, (46), 13 states have call predecessors, (46), 13 states have call successors, (46) Word has length 175 [2023-11-29 00:33:41,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:33:41,654 INFO L225 Difference]: With dead ends: 670 [2023-11-29 00:33:41,654 INFO L226 Difference]: Without dead ends: 503 [2023-11-29 00:33:41,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 384 SyntacticMatches, 2 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1858 ImplicationChecksByTransitivity, 36.1s TimeCoverageRelationStatistics Valid=1290, Invalid=5184, Unknown=6, NotChecked=0, Total=6480 [2023-11-29 00:33:41,658 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 1403 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 1677 mSolverCounterSat, 402 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 48.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1403 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 2081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 402 IncrementalHoareTripleChecker+Valid, 1677 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 49.7s IncrementalHoareTripleChecker+Time [2023-11-29 00:33:41,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1403 Valid, 803 Invalid, 2081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [402 Valid, 1677 Invalid, 2 Unknown, 0 Unchecked, 49.7s Time] [2023-11-29 00:33:41,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2023-11-29 00:33:41,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 460. [2023-11-29 00:33:41,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 373 states have (on average 1.2520107238605898) internal successors, (467), 376 states have internal predecessors, (467), 71 states have call successors, (71), 15 states have call predecessors, (71), 15 states have return successors, (71), 68 states have call predecessors, (71), 71 states have call successors, (71) [2023-11-29 00:33:41,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 609 transitions. [2023-11-29 00:33:41,730 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 609 transitions. Word has length 175 [2023-11-29 00:33:41,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:33:41,731 INFO L495 AbstractCegarLoop]: Abstraction has 460 states and 609 transitions. [2023-11-29 00:33:41,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 5.576923076923077) internal successors, (145), 25 states have internal predecessors, (145), 13 states have call successors, (46), 12 states have call predecessors, (46), 13 states have return successors, (46), 13 states have call predecessors, (46), 13 states have call successors, (46) [2023-11-29 00:33:41,732 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 609 transitions. [2023-11-29 00:33:41,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-29 00:33:41,733 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:33:41,734 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:33:41,746 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-11-29 00:33:41,942 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2023-11-29 00:33:42,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 00:33:42,135 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:33:42,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:33:42,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1978802518, now seen corresponding path program 1 times [2023-11-29 00:33:42,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:33:42,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1810127677] [2023-11-29 00:33:42,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:33:42,137 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:33:42,137 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:33:42,138 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:33:42,139 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-29 00:33:42,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:33:42,497 INFO L262 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 00:33:42,500 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:33:42,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 00:33:42,593 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:33:42,593 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:33:42,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1810127677] [2023-11-29 00:33:42,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1810127677] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:33:42,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:33:42,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 00:33:42,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36300651] [2023-11-29 00:33:42,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:33:42,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:33:42,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:33:42,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:33:42,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:33:42,595 INFO L87 Difference]: Start difference. First operand 460 states and 609 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:33:46,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:33:50,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:33:56,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:33:58,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:33:58,336 INFO L93 Difference]: Finished difference Result 890 states and 1182 transitions. [2023-11-29 00:33:58,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 00:33:58,337 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2023-11-29 00:33:58,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:33:58,341 INFO L225 Difference]: With dead ends: 890 [2023-11-29 00:33:58,341 INFO L226 Difference]: Without dead ends: 500 [2023-11-29 00:33:58,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-11-29 00:33:58,342 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 61 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.6s IncrementalHoareTripleChecker+Time [2023-11-29 00:33:58,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 588 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 236 Invalid, 1 Unknown, 0 Unchecked, 15.6s Time] [2023-11-29 00:33:58,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2023-11-29 00:33:58,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 442. [2023-11-29 00:33:58,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 355 states have (on average 1.2535211267605635) internal successors, (445), 358 states have internal predecessors, (445), 71 states have call successors, (71), 15 states have call predecessors, (71), 15 states have return successors, (71), 68 states have call predecessors, (71), 71 states have call successors, (71) [2023-11-29 00:33:58,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 587 transitions. [2023-11-29 00:33:58,405 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 587 transitions. Word has length 175 [2023-11-29 00:33:58,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:33:58,406 INFO L495 AbstractCegarLoop]: Abstraction has 442 states and 587 transitions. [2023-11-29 00:33:58,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:33:58,406 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 587 transitions. [2023-11-29 00:33:58,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-29 00:33:58,407 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:33:58,407 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:33:58,416 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-11-29 00:33:58,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:33:58,608 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:33:58,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:33:58,608 INFO L85 PathProgramCache]: Analyzing trace with hash 732686758, now seen corresponding path program 1 times [2023-11-29 00:33:58,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:33:58,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1411205260] [2023-11-29 00:33:58,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:33:58,609 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:33:58,609 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:33:58,610 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:33:58,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-11-29 00:33:59,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:33:59,186 INFO L262 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 46 conjunts are in the unsatisfiable core [2023-11-29 00:33:59,196 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:33:59,306 INFO L378 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-29 00:33:59,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2023-11-29 00:34:00,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2023-11-29 00:34:05,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 43 [2023-11-29 00:34:06,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2023-11-29 00:34:07,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 57 [2023-11-29 00:34:07,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 65 [2023-11-29 00:34:08,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 68 [2023-11-29 00:34:09,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 76 [2023-11-29 00:34:11,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 79 [2023-11-29 00:34:12,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 87 [2023-11-29 00:34:13,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 90 [2023-11-29 00:34:14,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 90 [2023-11-29 00:34:15,510 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:34:15,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 90 treesize of output 95 [2023-11-29 00:34:16,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 698 proven. 225 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2023-11-29 00:34:16,208 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:34:16,829 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:34:16,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1411205260] [2023-11-29 00:34:16,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1411205260] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:34:16,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1548206874] [2023-11-29 00:34:16,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:34:16,830 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 00:34:16,830 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 00:34:16,831 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 00:34:16,831 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2023-11-29 00:34:17,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:34:17,921 INFO L262 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 44 conjunts are in the unsatisfiable core [2023-11-29 00:34:17,930 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:34:18,104 INFO L378 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-29 00:34:18,607 INFO L378 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 12 treesize of output 8 [2023-11-29 00:34:19,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2023-11-29 00:34:23,943 INFO L378 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 32 treesize of output 23 [2023-11-29 00:34:24,600 INFO L378 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 32 treesize of output 23 [2023-11-29 00:34:25,258 INFO L378 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 29 treesize of output 31 [2023-11-29 00:34:26,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2023-11-29 00:34:26,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2023-11-29 00:34:27,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 45 [2023-11-29 00:34:28,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 53 [2023-11-29 00:34:29,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 56 [2023-11-29 00:34:30,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 64 [2023-11-29 00:34:31,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 67 [2023-11-29 00:34:32,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 79 [2023-11-29 00:34:33,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 720 proven. 168 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-11-29 00:34:33,347 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:34:33,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1548206874] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:34:33,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:34:33,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13] total 30 [2023-11-29 00:34:33,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581088783] [2023-11-29 00:34:33,796 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:34:33,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-29 00:34:33,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:34:33,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-29 00:34:33,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=1052, Unknown=2, NotChecked=0, Total=1260 [2023-11-29 00:34:33,798 INFO L87 Difference]: Start difference. First operand 442 states and 587 transitions. Second operand has 31 states, 30 states have (on average 5.3) internal successors, (159), 29 states have internal predecessors, (159), 17 states have call successors, (46), 16 states have call predecessors, (46), 17 states have return successors, (46), 17 states have call predecessors, (46), 17 states have call successors, (46) [2023-11-29 00:34:50,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:34:54,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:34:57,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.56s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:35:07,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:35:09,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:35:11,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:35:12,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:35:14,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:35:16,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:35:17,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:35:19,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:35:21,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:35:22,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:35:24,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:35:25,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:35:27,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:35:29,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:35:30,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:35:32,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:35:35,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:35:41,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:35:42,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:35:44,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:35:49,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:35:53,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:35:59,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:36:00,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:36:04,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:36:08,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:36:13,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:36:17,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:36:30,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:36:34,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:36:46,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:36:50,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:37:02,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:37:06,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:37:10,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:37:14,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:37:18,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:37:22,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:37:26,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:37:30,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:37:34,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:37:38,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:37:42,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:37:46,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:37:58,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:38:02,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:38:06,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:38:10,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:38:47,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:38:47,970 INFO L93 Difference]: Finished difference Result 1056 states and 1351 transitions. [2023-11-29 00:38:47,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2023-11-29 00:38:47,972 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 5.3) internal successors, (159), 29 states have internal predecessors, (159), 17 states have call successors, (46), 16 states have call predecessors, (46), 17 states have return successors, (46), 17 states have call predecessors, (46), 17 states have call successors, (46) Word has length 175 [2023-11-29 00:38:47,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:38:47,976 INFO L225 Difference]: With dead ends: 1056 [2023-11-29 00:38:47,976 INFO L226 Difference]: Without dead ends: 684 [2023-11-29 00:38:47,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 489 GetRequests, 380 SyntacticMatches, 2 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3538 ImplicationChecksByTransitivity, 89.3s TimeCoverageRelationStatistics Valid=2407, Invalid=9348, Unknown=17, NotChecked=0, Total=11772 [2023-11-29 00:38:47,984 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 1846 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 1609 mSolverCounterSat, 317 mSolverCounterUnsat, 27 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 176.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1846 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 1953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 317 IncrementalHoareTripleChecker+Valid, 1609 IncrementalHoareTripleChecker+Invalid, 27 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 177.4s IncrementalHoareTripleChecker+Time [2023-11-29 00:38:47,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1846 Valid, 906 Invalid, 1953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [317 Valid, 1609 Invalid, 27 Unknown, 0 Unchecked, 177.4s Time] [2023-11-29 00:38:47,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2023-11-29 00:38:48,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 455. [2023-11-29 00:38:48,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 360 states have (on average 1.2138888888888888) internal successors, (437), 361 states have internal predecessors, (437), 67 states have call successors, (67), 27 states have call predecessors, (67), 27 states have return successors, (67), 66 states have call predecessors, (67), 67 states have call successors, (67) [2023-11-29 00:38:48,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 571 transitions. [2023-11-29 00:38:48,137 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 571 transitions. Word has length 175 [2023-11-29 00:38:48,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:38:48,138 INFO L495 AbstractCegarLoop]: Abstraction has 455 states and 571 transitions. [2023-11-29 00:38:48,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 5.3) internal successors, (159), 29 states have internal predecessors, (159), 17 states have call successors, (46), 16 states have call predecessors, (46), 17 states have return successors, (46), 17 states have call predecessors, (46), 17 states have call successors, (46) [2023-11-29 00:38:48,139 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 571 transitions. [2023-11-29 00:38:48,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-29 00:38:48,140 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:38:48,140 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:38:48,155 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-11-29 00:38:48,348 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (13)] Ended with exit code 0 [2023-11-29 00:38:48,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 00:38:48,541 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:38:48,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:38:48,542 INFO L85 PathProgramCache]: Analyzing trace with hash 794726372, now seen corresponding path program 1 times [2023-11-29 00:38:48,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:38:48,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [760827139] [2023-11-29 00:38:48,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:38:48,542 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:38:48,542 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:38:48,543 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:38:48,544 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-11-29 00:38:48,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:38:48,973 INFO L262 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 00:38:48,977 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:38:49,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 00:38:49,095 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:38:49,095 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:38:49,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [760827139] [2023-11-29 00:38:49,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [760827139] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:38:49,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:38:49,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 00:38:49,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344724072] [2023-11-29 00:38:49,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:38:49,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:38:49,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:38:49,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:38:49,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:38:49,097 INFO L87 Difference]: Start difference. First operand 455 states and 571 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:38:53,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:38:54,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:38:59,628 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:39:02,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:39:02,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:39:02,978 INFO L93 Difference]: Finished difference Result 813 states and 1022 transitions. [2023-11-29 00:39:02,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:39:02,979 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2023-11-29 00:39:02,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:39:02,982 INFO L225 Difference]: With dead ends: 813 [2023-11-29 00:39:02,982 INFO L226 Difference]: Without dead ends: 444 [2023-11-29 00:39:02,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-29 00:39:02,983 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 8 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.7s IncrementalHoareTripleChecker+Time [2023-11-29 00:39:02,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 621 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 178 Invalid, 2 Unknown, 0 Unchecked, 13.7s Time] [2023-11-29 00:39:02,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2023-11-29 00:39:03,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 441. [2023-11-29 00:39:03,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 346 states have (on average 1.2023121387283238) internal successors, (416), 347 states have internal predecessors, (416), 67 states have call successors, (67), 27 states have call predecessors, (67), 27 states have return successors, (67), 66 states have call predecessors, (67), 67 states have call successors, (67) [2023-11-29 00:39:03,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 550 transitions. [2023-11-29 00:39:03,112 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 550 transitions. Word has length 175 [2023-11-29 00:39:03,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:39:03,112 INFO L495 AbstractCegarLoop]: Abstraction has 441 states and 550 transitions. [2023-11-29 00:39:03,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 00:39:03,113 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 550 transitions. [2023-11-29 00:39:03,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-29 00:39:03,114 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:39:03,114 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:39:03,122 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2023-11-29 00:39:03,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:39:03,315 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:39:03,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:39:03,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1806691688, now seen corresponding path program 1 times [2023-11-29 00:39:03,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:39:03,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [51355210] [2023-11-29 00:39:03,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:39:03,316 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:39:03,316 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:39:03,318 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:39:03,319 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-11-29 00:39:04,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:39:04,053 INFO L262 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 44 conjunts are in the unsatisfiable core [2023-11-29 00:39:04,064 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:39:04,679 INFO L378 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 8 treesize of output 1 [2023-11-29 00:39:05,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2023-11-29 00:39:10,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2023-11-29 00:39:10,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 43 [2023-11-29 00:39:11,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 46 [2023-11-29 00:39:12,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 46 [2023-11-29 00:39:13,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 46 [2023-11-29 00:39:14,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2023-11-29 00:39:15,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 57 [2023-11-29 00:39:16,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 65 [2023-11-29 00:39:17,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 68 [2023-11-29 00:39:18,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 68 [2023-11-29 00:39:19,274 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:39:19,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 64 treesize of output 67 [2023-11-29 00:39:19,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 622 proven. 219 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2023-11-29 00:39:19,725 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:39:20,405 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:39:20,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [51355210] [2023-11-29 00:39:20,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [51355210] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:39:20,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [88186849] [2023-11-29 00:39:20,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:39:20,405 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 00:39:20,405 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 00:39:20,406 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 00:39:20,407 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2023-11-29 00:39:21,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:39:21,580 INFO L262 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 41 conjunts are in the unsatisfiable core [2023-11-29 00:39:21,586 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:39:22,359 INFO L378 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 12 treesize of output 8 [2023-11-29 00:39:23,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 12 [2023-11-29 00:39:23,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 00:39:24,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-11-29 00:39:25,175 INFO L378 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 32 treesize of output 23 [2023-11-29 00:39:25,883 INFO L378 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 32 treesize of output 23 [2023-11-29 00:39:26,637 INFO L378 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 32 treesize of output 23 [2023-11-29 00:39:27,371 INFO L378 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 29 treesize of output 31 [2023-11-29 00:39:28,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2023-11-29 00:39:29,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2023-11-29 00:39:30,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2023-11-29 00:39:31,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 45 [2023-11-29 00:39:32,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 49 [2023-11-29 00:39:32,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 32 [2023-11-29 00:39:32,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 624 proven. 168 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-11-29 00:39:32,604 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:39:33,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [88186849] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:39:33,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:39:33,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 25 [2023-11-29 00:39:33,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410977298] [2023-11-29 00:39:33,147 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:39:33,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-29 00:39:33,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:39:33,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-29 00:39:33,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=775, Unknown=1, NotChecked=0, Total=930 [2023-11-29 00:39:33,150 INFO L87 Difference]: Start difference. First operand 441 states and 550 transitions. Second operand has 26 states, 25 states have (on average 5.68) internal successors, (142), 24 states have internal predecessors, (142), 12 states have call successors, (46), 11 states have call predecessors, (46), 12 states have return successors, (46), 12 states have call predecessors, (46), 12 states have call successors, (46) [2023-11-29 00:39:39,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:39:43,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:39:47,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:40:12,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:40:13,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:40:23,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:40:28,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:40:30,341 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:40:34,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:40:39,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:40:45,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:40:49,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:40:55,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:41:19,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:41:19,525 INFO L93 Difference]: Finished difference Result 901 states and 1117 transitions. [2023-11-29 00:41:19,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-11-29 00:41:19,526 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 5.68) internal successors, (142), 24 states have internal predecessors, (142), 12 states have call successors, (46), 11 states have call predecessors, (46), 12 states have return successors, (46), 12 states have call predecessors, (46), 12 states have call successors, (46) Word has length 175 [2023-11-29 00:41:19,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:41:19,529 INFO L225 Difference]: With dead ends: 901 [2023-11-29 00:41:19,529 INFO L226 Difference]: Without dead ends: 546 [2023-11-29 00:41:19,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 385 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1509 ImplicationChecksByTransitivity, 50.6s TimeCoverageRelationStatistics Valid=1096, Invalid=4150, Unknown=10, NotChecked=0, Total=5256 [2023-11-29 00:41:19,531 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 1022 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 1664 mSolverCounterSat, 304 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 62.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1022 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 1976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 304 IncrementalHoareTripleChecker+Valid, 1664 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 63.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:41:19,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1022 Valid, 830 Invalid, 1976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [304 Valid, 1664 Invalid, 8 Unknown, 0 Unchecked, 63.2s Time] [2023-11-29 00:41:19,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2023-11-29 00:41:19,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 446. [2023-11-29 00:41:19,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 351 states have (on average 1.1965811965811965) internal successors, (420), 352 states have internal predecessors, (420), 67 states have call successors, (67), 27 states have call predecessors, (67), 27 states have return successors, (67), 66 states have call predecessors, (67), 67 states have call successors, (67) [2023-11-29 00:41:19,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 554 transitions. [2023-11-29 00:41:19,642 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 554 transitions. Word has length 175 [2023-11-29 00:41:19,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:41:19,642 INFO L495 AbstractCegarLoop]: Abstraction has 446 states and 554 transitions. [2023-11-29 00:41:19,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 5.68) internal successors, (142), 24 states have internal predecessors, (142), 12 states have call successors, (46), 11 states have call predecessors, (46), 12 states have return successors, (46), 12 states have call predecessors, (46), 12 states have call successors, (46) [2023-11-29 00:41:19,643 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 554 transitions. [2023-11-29 00:41:19,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-29 00:41:19,643 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:41:19,644 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:41:19,653 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2023-11-29 00:41:19,854 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (16)] Ended with exit code 0 [2023-11-29 00:41:20,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 00:41:20,045 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:41:20,045 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:41:20,045 INFO L85 PathProgramCache]: Analyzing trace with hash 795574438, now seen corresponding path program 1 times [2023-11-29 00:41:20,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:41:20,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1469356335] [2023-11-29 00:41:20,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:41:20,046 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:41:20,046 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:41:20,047 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:41:20,047 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-11-29 00:41:20,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:20,663 INFO L262 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 47 conjunts are in the unsatisfiable core [2023-11-29 00:41:20,671 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:41:20,774 INFO L378 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 12 treesize of output 8 [2023-11-29 00:41:21,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2023-11-29 00:41:22,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2023-11-29 00:41:27,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2023-11-29 00:41:28,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 50 [2023-11-29 00:41:29,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 58 [2023-11-29 00:41:30,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 56 [2023-11-29 00:41:31,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 56 [2023-11-29 00:41:31,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 56 [2023-11-29 00:41:32,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 56 [2023-11-29 00:41:33,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 64 [2023-11-29 00:41:34,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 67 [2023-11-29 00:41:36,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 67 [2023-11-29 00:41:37,016 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:41:37,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 72 treesize of output 71 [2023-11-29 00:41:37,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 570 proven. 225 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2023-11-29 00:41:37,551 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:41:38,257 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:41:38,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1469356335] [2023-11-29 00:41:38,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1469356335] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:41:38,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [546646968] [2023-11-29 00:41:38,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:41:38,258 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 00:41:38,258 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 00:41:38,259 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 00:41:38,259 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1ee620e-1e99-4575-8051-7b00d678fb60/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2023-11-29 00:41:39,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:39,459 INFO L262 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 44 conjunts are in the unsatisfiable core [2023-11-29 00:41:39,465 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:41:39,665 INFO L378 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 12 treesize of output 8 [2023-11-29 00:41:40,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-11-29 00:41:41,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2023-11-29 00:41:41,638 INFO L378 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 29 treesize of output 31 [2023-11-29 00:41:42,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2023-11-29 00:41:43,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2023-11-29 00:41:44,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 53 [2023-11-29 00:41:45,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 56 [2023-11-29 00:41:46,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 56 [2023-11-29 00:41:47,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 64 [2023-11-29 00:41:48,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 75 [2023-11-29 00:41:49,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 86 [2023-11-29 00:41:51,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 89 [2023-11-29 00:42:04,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 93 [2023-11-29 00:42:09,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 48 [2023-11-29 00:42:09,086 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 728 proven. 168 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2023-11-29 00:42:09,086 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:42:09,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [546646968] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:42:09,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:42:09,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 31 [2023-11-29 00:42:09,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743349229] [2023-11-29 00:42:09,549 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:42:09,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-11-29 00:42:09,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:42:09,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-11-29 00:42:09,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=1100, Unknown=5, NotChecked=0, Total=1332 [2023-11-29 00:42:09,552 INFO L87 Difference]: Start difference. First operand 446 states and 554 transitions. Second operand has 32 states, 31 states have (on average 5.032258064516129) internal successors, (156), 30 states have internal predecessors, (156), 16 states have call successors, (46), 15 states have call predecessors, (46), 16 states have return successors, (46), 16 states have call predecessors, (46), 16 states have call successors, (46) [2023-11-29 00:42:15,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:42:19,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:42:23,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:42:27,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:42:31,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:42:35,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:43:08,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:43:12,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:43:16,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:43:20,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:43:24,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:43:28,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:44:00,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:44:04,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]