./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-pthread/cs_stack-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d067a09-ceaf-4545-b83b-4594550d101f/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d067a09-ceaf-4545-b83b-4594550d101f/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d067a09-ceaf-4545-b83b-4594550d101f/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d067a09-ceaf-4545-b83b-4594550d101f/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-pthread/cs_stack-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d067a09-ceaf-4545-b83b-4594550d101f/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d067a09-ceaf-4545-b83b-4594550d101f/bin/uautomizer-verify-uCwYo4JHxu --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 0a870e8a4a7dff1b238c9b19b47586f7abd44e3f0eb9969b7dad7bbd7f80e506 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:36:34,932 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:36:35,077 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d067a09-ceaf-4545-b83b-4594550d101f/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 07:36:35,085 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:36:35,086 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:36:35,133 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:36:35,134 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:36:35,135 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:36:35,136 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:36:35,141 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:36:35,142 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:36:35,143 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:36:35,143 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:36:35,145 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:36:35,146 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:36:35,146 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:36:35,146 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:36:35,147 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:36:35,147 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:36:35,148 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:36:35,148 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:36:35,149 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:36:35,149 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:36:35,150 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:36:35,150 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:36:35,151 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:36:35,151 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:36:35,152 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:36:35,152 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:36:35,153 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:36:35,154 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:36:35,155 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:36:35,155 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:36:35,155 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:36:35,155 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:36:35,156 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:36:35,156 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:36:35,156 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:36:35,156 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:36:35,157 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_6d067a09-ceaf-4545-b83b-4594550d101f/bin/uautomizer-verify-uCwYo4JHxu/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_6d067a09-ceaf-4545-b83b-4594550d101f/bin/uautomizer-verify-uCwYo4JHxu 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 -> 0a870e8a4a7dff1b238c9b19b47586f7abd44e3f0eb9969b7dad7bbd7f80e506 [2023-11-19 07:36:35,457 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:36:35,480 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:36:35,482 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:36:35,484 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:36:35,485 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:36:35,486 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d067a09-ceaf-4545-b83b-4594550d101f/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/seq-pthread/cs_stack-2.i [2023-11-19 07:36:38,640 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:36:39,010 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:36:39,011 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d067a09-ceaf-4545-b83b-4594550d101f/sv-benchmarks/c/seq-pthread/cs_stack-2.i [2023-11-19 07:36:39,038 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d067a09-ceaf-4545-b83b-4594550d101f/bin/uautomizer-verify-uCwYo4JHxu/data/7dc01bcce/e16636632eeb4dbb848b5e52b8caa75b/FLAGf13311764 [2023-11-19 07:36:39,056 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d067a09-ceaf-4545-b83b-4594550d101f/bin/uautomizer-verify-uCwYo4JHxu/data/7dc01bcce/e16636632eeb4dbb848b5e52b8caa75b [2023-11-19 07:36:39,063 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:36:39,065 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:36:39,069 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:36:39,070 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:36:39,076 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:36:39,077 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:36:39" (1/1) ... [2023-11-19 07:36:39,078 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a97350f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:36:39, skipping insertion in model container [2023-11-19 07:36:39,078 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:36:39" (1/1) ... [2023-11-19 07:36:39,166 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:36:39,690 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_6d067a09-ceaf-4545-b83b-4594550d101f/sv-benchmarks/c/seq-pthread/cs_stack-2.i[34556,34569] [2023-11-19 07:36:39,819 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:36:39,836 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:36:39,873 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_6d067a09-ceaf-4545-b83b-4594550d101f/sv-benchmarks/c/seq-pthread/cs_stack-2.i[34556,34569] [2023-11-19 07:36:39,966 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:36:40,047 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:36:40,048 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:36:40 WrapperNode [2023-11-19 07:36:40,049 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:36:40,050 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:36:40,050 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:36:40,055 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:36:40,063 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:36:40" (1/1) ... [2023-11-19 07:36:40,107 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:36:40" (1/1) ... [2023-11-19 07:36:40,166 INFO L138 Inliner]: procedures = 252, calls = 268, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 601 [2023-11-19 07:36:40,167 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:36:40,168 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:36:40,168 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:36:40,168 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:36:40,179 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:36:40" (1/1) ... [2023-11-19 07:36:40,190 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:36:40" (1/1) ... [2023-11-19 07:36:40,201 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:36:40" (1/1) ... [2023-11-19 07:36:40,201 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:36:40" (1/1) ... [2023-11-19 07:36:40,264 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:36:40" (1/1) ... [2023-11-19 07:36:40,289 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:36:40" (1/1) ... [2023-11-19 07:36:40,296 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:36:40" (1/1) ... [2023-11-19 07:36:40,318 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:36:40" (1/1) ... [2023-11-19 07:36:40,328 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:36:40,329 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:36:40,329 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:36:40,329 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:36:40,330 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:36:40" (1/1) ... [2023-11-19 07:36:40,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:36:40,367 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d067a09-ceaf-4545-b83b-4594550d101f/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:36:40,385 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d067a09-ceaf-4545-b83b-4594550d101f/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:36:40,422 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d067a09-ceaf-4545-b83b-4594550d101f/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:36:40,433 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-19 07:36:40,434 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-19 07:36:40,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:36:40,434 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2023-11-19 07:36:40,435 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2023-11-19 07:36:40,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-19 07:36:40,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:36:40,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-19 07:36:40,435 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2023-11-19 07:36:40,435 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2023-11-19 07:36:40,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 07:36:40,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:36:40,437 INFO L130 BoogieDeclarations]: Found specification of procedure get_top [2023-11-19 07:36:40,438 INFO L138 BoogieDeclarations]: Found implementation of procedure get_top [2023-11-19 07:36:40,438 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:36:40,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-19 07:36:40,439 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2023-11-19 07:36:40,439 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2023-11-19 07:36:40,439 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2023-11-19 07:36:40,439 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2023-11-19 07:36:40,439 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2023-11-19 07:36:40,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2023-11-19 07:36:40,439 INFO L130 BoogieDeclarations]: Found specification of procedure error [2023-11-19 07:36:40,440 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2023-11-19 07:36:40,440 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2023-11-19 07:36:40,440 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2023-11-19 07:36:40,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:36:40,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:36:40,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:36:40,661 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:36:40,663 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:36:40,770 INFO L767 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2023-11-19 07:36:40,770 INFO L767 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);#res := 0; [2023-11-19 07:36:40,846 INFO L767 $ProcedureCfgBuilder]: dead code at ProgramPoint L930-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296); [2023-11-19 07:36:40,846 INFO L767 $ProcedureCfgBuilder]: dead code at ProgramPoint L930-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2023-11-19 07:36:40,846 INFO L767 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##8: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2023-11-19 07:36:40,846 INFO L767 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296); [2023-11-19 07:36:40,846 INFO L767 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##7: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296); [2023-11-19 07:36:40,847 INFO L767 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2023-11-19 07:36:40,847 INFO L767 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2023-11-19 07:36:40,847 INFO L767 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296); [2023-11-19 07:36:40,847 INFO L767 $ProcedureCfgBuilder]: dead code at ProgramPoint L930: SUMMARY for call __CS_cs(); srcloc: null [2023-11-19 07:36:41,392 INFO L767 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##97: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2023-11-19 07:36:41,393 INFO L767 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##96: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);push_#res#1 := 0; [2023-11-19 07:36:41,393 INFO L767 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##54: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2023-11-19 07:36:41,393 INFO L767 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##53: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);pop_#res#1 := 0; [2023-11-19 07:36:41,393 INFO L767 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##58: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2023-11-19 07:36:41,394 INFO L767 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##57: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);pop_#res#1 := 0; [2023-11-19 07:36:41,394 INFO L767 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2023-11-19 07:36:41,394 INFO L767 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##42: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);pop_#res#1 := 0; [2023-11-19 07:36:41,394 INFO L767 $ProcedureCfgBuilder]: dead code at ProgramPoint L1002: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);pop_#res#1 := 0; [2023-11-19 07:36:41,394 INFO L767 $ProcedureCfgBuilder]: dead code at ProgramPoint L1002: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296));pop_#res#1 := 0; [2023-11-19 07:36:41,395 INFO L767 $ProcedureCfgBuilder]: dead code at ProgramPoint L986-4: SUMMARY for call __CS_cs(); srcloc: null [2023-11-19 07:36:41,395 INFO L767 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##111: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);push_#res#1 := 0; [2023-11-19 07:36:41,395 INFO L767 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##112: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2023-11-19 07:36:43,871 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:36:43,883 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:36:43,886 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-19 07:36:43,906 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:36:43 BoogieIcfgContainer [2023-11-19 07:36:43,907 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:36:43,932 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:36:43,932 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:36:43,935 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:36:43,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:36:39" (1/3) ... [2023-11-19 07:36:43,936 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d7f930d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:36:43, skipping insertion in model container [2023-11-19 07:36:43,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:36:40" (2/3) ... [2023-11-19 07:36:43,937 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d7f930d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:36:43, skipping insertion in model container [2023-11-19 07:36:43,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:36:43" (3/3) ... [2023-11-19 07:36:43,938 INFO L112 eAbstractionObserver]: Analyzing ICFG cs_stack-2.i [2023-11-19 07:36:43,973 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:36:43,974 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 07:36:44,055 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:36:44,063 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;@48d91982, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:36:44,063 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 07:36:44,069 INFO L276 IsEmpty]: Start isEmpty. Operand has 220 states, 134 states have (on average 1.5149253731343284) internal successors, (203), 137 states have internal predecessors, (203), 75 states have call successors, (75), 9 states have call predecessors, (75), 9 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2023-11-19 07:36:44,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-11-19 07:36:44,114 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:36:44,115 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 07:36:44,115 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:36:44,124 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:36:44,125 INFO L85 PathProgramCache]: Analyzing trace with hash 726696115, now seen corresponding path program 1 times [2023-11-19 07:36:44,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:36:44,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420802870] [2023-11-19 07:36:44,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:36:44,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:36:44,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:44,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-19 07:36:44,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:44,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-19 07:36:44,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:44,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-19 07:36:44,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:44,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-19 07:36:44,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:44,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:36:44,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:44,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-19 07:36:44,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:44,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:36:44,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:44,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:36:44,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:44,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:36:44,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:44,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:36:44,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:44,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:36:44,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:44,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:36:44,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:44,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:36:44,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:44,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:36:44,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:44,930 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-11-19 07:36:44,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:36:44,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420802870] [2023-11-19 07:36:44,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420802870] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:36:44,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:36:44,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:36:44,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199629198] [2023-11-19 07:36:44,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:36:44,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 07:36:44,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:36:44,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 07:36:44,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:36:44,975 INFO L87 Difference]: Start difference. First operand has 220 states, 134 states have (on average 1.5149253731343284) internal successors, (203), 137 states have internal predecessors, (203), 75 states have call successors, (75), 9 states have call predecessors, (75), 9 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-19 07:36:45,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:36:45,052 INFO L93 Difference]: Finished difference Result 436 states and 769 transitions. [2023-11-19 07:36:45,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 07:36:45,054 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 94 [2023-11-19 07:36:45,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:36:45,069 INFO L225 Difference]: With dead ends: 436 [2023-11-19 07:36:45,069 INFO L226 Difference]: Without dead ends: 216 [2023-11-19 07:36:45,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 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-19 07:36:45,084 INFO L413 NwaCegarLoop]: 349 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:36:45,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:36:45,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2023-11-19 07:36:45,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2023-11-19 07:36:45,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 131 states have (on average 1.4885496183206106) internal successors, (195), 133 states have internal predecessors, (195), 75 states have call successors, (75), 9 states have call predecessors, (75), 9 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2023-11-19 07:36:45,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 345 transitions. [2023-11-19 07:36:45,197 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 345 transitions. Word has length 94 [2023-11-19 07:36:45,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:36:45,198 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 345 transitions. [2023-11-19 07:36:45,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-19 07:36:45,198 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 345 transitions. [2023-11-19 07:36:45,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-11-19 07:36:45,207 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:36:45,207 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 07:36:45,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:36:45,208 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:36:45,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:36:45,208 INFO L85 PathProgramCache]: Analyzing trace with hash 112214679, now seen corresponding path program 1 times [2023-11-19 07:36:45,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:36:45,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101646091] [2023-11-19 07:36:45,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:36:45,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:36:45,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:46,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-19 07:36:46,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:46,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-19 07:36:46,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:46,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-19 07:36:46,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:46,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-19 07:36:46,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:46,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:36:46,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:46,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-19 07:36:46,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:46,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:36:46,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:46,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:36:46,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:46,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:36:46,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:46,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:36:46,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:46,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:36:46,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:46,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:36:46,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:46,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:36:46,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:46,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:36:46,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:46,186 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-11-19 07:36:46,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:36:46,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101646091] [2023-11-19 07:36:46,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101646091] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:36:46,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:36:46,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:36:46,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231612271] [2023-11-19 07:36:46,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:36:46,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:36:46,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:36:46,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:36:46,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:36:46,191 INFO L87 Difference]: Start difference. First operand 216 states and 345 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-19 07:36:46,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:36:46,342 INFO L93 Difference]: Finished difference Result 428 states and 693 transitions. [2023-11-19 07:36:46,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:36:46,342 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 94 [2023-11-19 07:36:46,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:36:46,353 INFO L225 Difference]: With dead ends: 428 [2023-11-19 07:36:46,353 INFO L226 Difference]: Without dead ends: 394 [2023-11-19 07:36:46,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 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-19 07:36:46,364 INFO L413 NwaCegarLoop]: 370 mSDtfsCounter, 304 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 1075 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:36:46,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 1075 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:36:46,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2023-11-19 07:36:46,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 393. [2023-11-19 07:36:46,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 239 states have (on average 1.5230125523012552) internal successors, (364), 243 states have internal predecessors, (364), 135 states have call successors, (135), 18 states have call predecessors, (135), 18 states have return successors, (143), 135 states have call predecessors, (143), 135 states have call successors, (143) [2023-11-19 07:36:46,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 642 transitions. [2023-11-19 07:36:46,441 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 642 transitions. Word has length 94 [2023-11-19 07:36:46,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:36:46,442 INFO L495 AbstractCegarLoop]: Abstraction has 393 states and 642 transitions. [2023-11-19 07:36:46,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-19 07:36:46,442 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 642 transitions. [2023-11-19 07:36:46,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2023-11-19 07:36:46,457 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:36:46,457 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 5, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 07:36:46,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:36:46,458 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:36:46,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:36:46,459 INFO L85 PathProgramCache]: Analyzing trace with hash 203580110, now seen corresponding path program 1 times [2023-11-19 07:36:46,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:36:46,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476287140] [2023-11-19 07:36:46,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:36:46,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:36:46,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:47,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-19 07:36:47,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:47,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:36:47,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:47,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-19 07:36:47,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:47,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-19 07:36:47,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:47,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-19 07:36:47,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:47,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-19 07:36:47,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:47,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-19 07:36:47,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:47,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-19 07:36:47,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:47,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-19 07:36:47,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:47,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-19 07:36:47,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:47,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-19 07:36:47,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:47,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:36:47,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:47,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:36:47,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:47,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-19 07:36:47,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:47,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-19 07:36:47,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:47,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-19 07:36:47,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:47,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-11-19 07:36:47,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:47,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-19 07:36:47,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:47,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-19 07:36:47,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:47,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-19 07:36:47,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:47,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-19 07:36:47,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:47,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-19 07:36:47,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:47,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-11-19 07:36:47,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:47,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2023-11-19 07:36:47,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:47,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2023-11-19 07:36:47,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:47,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2023-11-19 07:36:47,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:47,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2023-11-19 07:36:47,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:47,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2023-11-19 07:36:47,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:47,777 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 738 trivial. 0 not checked. [2023-11-19 07:36:47,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:36:47,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476287140] [2023-11-19 07:36:47,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476287140] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:36:47,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:36:47,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-19 07:36:47,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659750853] [2023-11-19 07:36:47,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:36:47,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 07:36:47,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:36:47,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 07:36:47,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:36:47,782 INFO L87 Difference]: Start difference. First operand 393 states and 642 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 4 states have internal predecessors, (52), 4 states have call successors, (24), 5 states have call predecessors, (24), 2 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2023-11-19 07:36:49,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-19 07:36:51,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-19 07:36:53,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-19 07:36:55,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-19 07:36:57,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-19 07:36:59,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-19 07:37:03,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:37:03,518 INFO L93 Difference]: Finished difference Result 1176 states and 1997 transitions. [2023-11-19 07:37:03,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-19 07:37:03,519 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 4 states have internal predecessors, (52), 4 states have call successors, (24), 5 states have call predecessors, (24), 2 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) Word has length 177 [2023-11-19 07:37:03,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:37:03,531 INFO L225 Difference]: With dead ends: 1176 [2023-11-19 07:37:03,531 INFO L226 Difference]: Without dead ends: 1138 [2023-11-19 07:37:03,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2023-11-19 07:37:03,535 INFO L413 NwaCegarLoop]: 345 mSDtfsCounter, 722 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 1316 mSolverCounterSat, 565 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 799 SdHoareTripleChecker+Valid, 1121 SdHoareTripleChecker+Invalid, 1887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 565 IncrementalHoareTripleChecker+Valid, 1316 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:37:03,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [799 Valid, 1121 Invalid, 1887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [565 Valid, 1316 Invalid, 6 Unknown, 0 Unchecked, 15.1s Time] [2023-11-19 07:37:03,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2023-11-19 07:37:03,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 887. [2023-11-19 07:37:03,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 887 states, 535 states have (on average 1.530841121495327) internal successors, (819), 555 states have internal predecessors, (819), 306 states have call successors, (306), 36 states have call predecessors, (306), 45 states have return successors, (355), 305 states have call predecessors, (355), 306 states have call successors, (355) [2023-11-19 07:37:03,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1480 transitions. [2023-11-19 07:37:03,765 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1480 transitions. Word has length 177 [2023-11-19 07:37:03,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:37:03,768 INFO L495 AbstractCegarLoop]: Abstraction has 887 states and 1480 transitions. [2023-11-19 07:37:03,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 4 states have internal predecessors, (52), 4 states have call successors, (24), 5 states have call predecessors, (24), 2 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2023-11-19 07:37:03,769 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1480 transitions. [2023-11-19 07:37:03,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2023-11-19 07:37:03,788 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:37:03,788 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 07:37:03,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:37:03,789 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:37:03,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:03,789 INFO L85 PathProgramCache]: Analyzing trace with hash -899337024, now seen corresponding path program 1 times [2023-11-19 07:37:03,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:03,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244567105] [2023-11-19 07:37:03,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:03,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:03,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:04,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:37:04,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:04,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-19 07:37:04,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:04,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-19 07:37:04,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:04,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-19 07:37:04,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:04,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-19 07:37:04,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:04,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-19 07:37:04,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:04,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:37:04,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:04,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-19 07:37:04,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:04,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:37:04,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:04,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-19 07:37:04,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:04,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-19 07:37:04,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:04,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-19 07:37:04,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:04,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-19 07:37:04,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:04,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-19 07:37:04,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:04,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-19 07:37:04,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:04,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-19 07:37:04,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:04,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 07:37:04,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:04,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-19 07:37:04,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:04,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-19 07:37:04,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:04,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-19 07:37:04,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:04,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-11-19 07:37:04,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:04,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-11-19 07:37:04,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:04,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-11-19 07:37:04,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:04,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-11-19 07:37:04,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:04,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-19 07:37:04,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:04,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2023-11-19 07:37:04,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:04,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2023-11-19 07:37:04,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:04,684 INFO L134 CoverageAnalysis]: Checked inductivity of 734 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 734 trivial. 0 not checked. [2023-11-19 07:37:04,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:37:04,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244567105] [2023-11-19 07:37:04,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244567105] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:37:04,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:37:04,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-19 07:37:04,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640428815] [2023-11-19 07:37:04,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:37:04,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 07:37:04,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:37:04,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 07:37:04,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:37:04,688 INFO L87 Difference]: Start difference. First operand 887 states and 1480 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 4 states have internal predecessors, (53), 4 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2023-11-19 07:37:06,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-19 07:37:08,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-19 07:37:10,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-19 07:37:13,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-19 07:37:15,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-19 07:37:17,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:37:17,473 INFO L93 Difference]: Finished difference Result 1771 states and 2936 transitions. [2023-11-19 07:37:17,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-19 07:37:17,478 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 4 states have internal predecessors, (53), 4 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 173 [2023-11-19 07:37:17,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:37:17,489 INFO L225 Difference]: With dead ends: 1771 [2023-11-19 07:37:17,489 INFO L226 Difference]: Without dead ends: 888 [2023-11-19 07:37:17,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2023-11-19 07:37:17,500 INFO L413 NwaCegarLoop]: 337 mSDtfsCounter, 467 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 942 mSolverCounterSat, 318 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 1118 SdHoareTripleChecker+Invalid, 1265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 318 IncrementalHoareTripleChecker+Valid, 942 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2023-11-19 07:37:17,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 1118 Invalid, 1265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [318 Valid, 942 Invalid, 5 Unknown, 0 Unchecked, 12.4s Time] [2023-11-19 07:37:17,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2023-11-19 07:37:17,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 870. [2023-11-19 07:37:17,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 526 states have (on average 1.5247148288973384) internal successors, (802), 546 states have internal predecessors, (802), 298 states have call successors, (298), 35 states have call predecessors, (298), 45 states have return successors, (340), 298 states have call predecessors, (340), 298 states have call successors, (340) [2023-11-19 07:37:17,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1440 transitions. [2023-11-19 07:37:17,667 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1440 transitions. Word has length 173 [2023-11-19 07:37:17,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:37:17,667 INFO L495 AbstractCegarLoop]: Abstraction has 870 states and 1440 transitions. [2023-11-19 07:37:17,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 4 states have internal predecessors, (53), 4 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2023-11-19 07:37:17,668 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1440 transitions. [2023-11-19 07:37:17,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2023-11-19 07:37:17,680 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:37:17,680 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 5, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 07:37:17,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:37:17,681 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:37:17,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:17,681 INFO L85 PathProgramCache]: Analyzing trace with hash -63509980, now seen corresponding path program 1 times [2023-11-19 07:37:17,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:17,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000363143] [2023-11-19 07:37:17,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:17,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:17,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:18,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-19 07:37:18,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:18,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:37:18,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:18,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-19 07:37:18,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:18,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-19 07:37:18,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:18,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-19 07:37:18,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:18,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-19 07:37:18,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:18,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-19 07:37:18,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:18,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-19 07:37:18,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:18,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-19 07:37:18,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:18,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-19 07:37:18,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:18,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-19 07:37:18,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:18,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:37:18,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:18,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:37:18,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:18,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-19 07:37:18,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:18,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-19 07:37:18,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:18,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-19 07:37:18,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:18,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-11-19 07:37:18,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:18,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-19 07:37:18,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:18,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-19 07:37:18,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:18,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-19 07:37:18,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:18,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-19 07:37:18,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:18,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-19 07:37:18,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:18,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-11-19 07:37:18,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:18,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2023-11-19 07:37:18,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:18,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2023-11-19 07:37:18,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:18,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2023-11-19 07:37:18,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:18,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2023-11-19 07:37:18,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:18,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2023-11-19 07:37:18,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:18,904 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 735 trivial. 0 not checked. [2023-11-19 07:37:18,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:37:18,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000363143] [2023-11-19 07:37:18,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000363143] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:37:18,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140565121] [2023-11-19 07:37:18,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:18,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:37:18,905 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d067a09-ceaf-4545-b83b-4594550d101f/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:37:18,907 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d067a09-ceaf-4545-b83b-4594550d101f/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:37:18,915 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d067a09-ceaf-4545-b83b-4594550d101f/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 07:37:19,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:19,457 INFO L262 TraceCheckSpWp]: Trace formula consists of 1120 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-19 07:37:19,472 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:37:19,710 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 280 proven. 4 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2023-11-19 07:37:19,711 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:37:20,181 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 734 trivial. 0 not checked. [2023-11-19 07:37:20,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140565121] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:37:20,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:37:20,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 5] total 16 [2023-11-19 07:37:20,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247621569] [2023-11-19 07:37:20,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:37:20,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-19 07:37:20,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:37:20,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-19 07:37:20,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2023-11-19 07:37:20,185 INFO L87 Difference]: Start difference. First operand 870 states and 1440 transitions. Second operand has 16 states, 16 states have (on average 5.375) internal successors, (86), 12 states have internal predecessors, (86), 9 states have call successors, (51), 8 states have call predecessors, (51), 7 states have return successors, (49), 7 states have call predecessors, (49), 9 states have call successors, (49) [2023-11-19 07:37:22,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-19 07:37:24,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-19 07:37:26,238 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-19 07:37:28,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-19 07:37:30,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-19 07:37:35,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:37:35,350 INFO L93 Difference]: Finished difference Result 2529 states and 4257 transitions. [2023-11-19 07:37:35,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-19 07:37:35,351 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.375) internal successors, (86), 12 states have internal predecessors, (86), 9 states have call successors, (51), 8 states have call predecessors, (51), 7 states have return successors, (49), 7 states have call predecessors, (49), 9 states have call successors, (49) Word has length 177 [2023-11-19 07:37:35,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:37:35,368 INFO L225 Difference]: With dead ends: 2529 [2023-11-19 07:37:35,369 INFO L226 Difference]: Without dead ends: 1663 [2023-11-19 07:37:35,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 409 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=275, Invalid=781, Unknown=0, NotChecked=0, Total=1056 [2023-11-19 07:37:35,378 INFO L413 NwaCegarLoop]: 349 mSDtfsCounter, 1758 mSDsluCounter, 1205 mSDsCounter, 0 mSdLazyCounter, 1841 mSolverCounterSat, 1670 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1872 SdHoareTripleChecker+Valid, 1554 SdHoareTripleChecker+Invalid, 3516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1670 IncrementalHoareTripleChecker+Valid, 1841 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:37:35,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1872 Valid, 1554 Invalid, 3516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1670 Valid, 1841 Invalid, 5 Unknown, 0 Unchecked, 14.2s Time] [2023-11-19 07:37:35,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1663 states.